Undecidable word problem in subshift automorphism groups
Computational Complexity
2018-09-05 v2 Dynamical Systems
Group Theory
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.
Keywords
Cite
@article{arxiv.1808.09194,
title = {Undecidable word problem in subshift automorphism groups},
author = {Pierre Guillon and Emmanuel Jeandel and Jarkko Kari and Pascal Vanier},
journal= {arXiv preprint arXiv:1808.09194},
year = {2018}
}