Undecidable word problem in subshift automorphism groups

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.
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01862896
Contributor : Pierre Guillon <>
Submitted on : Monday, September 3, 2018 - 5:28:23 PM
Last modification on : Friday, April 19, 2019 - 4:55:04 PM
Document(s) archivé(s) le : Tuesday, December 4, 2018 - 6:23:43 PM

Files

wordpb.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01862896, version 2
  • ARXIV : 1808.09194

Citation

Pierre Guillon, Emmanuel Jeandel, Jarkko Kari, Pascal Vanier. Undecidable word problem in subshift automorphism groups. 2018. ⟨hal-01862896v2⟩

Share

Metrics

Record views

128

Files downloads

109