Undecidable word problem in subshift automorphism groups
classification
💻 cs.CC
math.DSmath.GR
keywords
problemwordautomorphismdegreegroupssubshiftwhosearticle
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.