2000 character limit reached
Undecidable word problem in subshift automorphism groups
Published 28 Aug 2018 in cs.CC, math.DS, and math.GR | (1808.09194v2)
Abstract: This 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
