2000 character limit reached
Undecidable word problem in subshift automorphism groups (1808.09194v2)
Published 28 Aug 2018 in cs.CC, math.DS, and math.GR
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.