7 research outputs found
Undecidable word problem in subshift automorphism groups
Get PDFThis article studies the complexity of the word problem in groups of
automorphisms of subshifts. We show in particular that for any Turing degree,
there exists a subshift whose automorphism group contains a subgroup whose word
problem has exactly this degree
Undecidable word problem in subshift automorphism groups
Get PDFInternational audienceThis article studies the complexity of the word problem in groups of automorphisms of subshifts. We show in particular that for any Turing degree, there exists a subshift whose automorphism group contains a subgroup whose word problem has exactly this degree
Undecidable word problem in subshift automorphism groups
No full textInternational audienceThis article studies the complexity of the word problem in groups of automorphisms of subshifts. We show in particular that for any Turing degree, there exists a subshift whose automorphism group contains a subgroup whose word problem has exactly this degree
Undecidable word problem in subshift automorphism groups
No full textInternational audienceThis article studies the complexity of the word problem in groups of automorphisms of subshifts. We show in particular that for any Turing degree, there exists a subshift whose automorphism group contains a subgroup whose word problem has exactly this degree
Undecidable word problem in subshift automorphism groups
No full textInternational audienceThis article studies the complexity of the word problem in groups of automorphisms of subshifts. We show in particular that for any Turing degree, there exists a subshift whose automorphism group contains a subgroup whose word problem has exactly this degree
