Undecidable word problem in subshift automorphism groups
P. Guillon, Emmanuel Jeandel, Jarkko Kari, Pascal Vanier · arXiv (Cornell University) · 2018
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.