The Group of Reversible Turing Machines - Cellular Automata and Discrete Complex Systems Access content directly
Conference Papers Year : 2016

The Group of Reversible Turing Machines


We consider Turing machines as actions over configurations in Σ Z d which only change them locally around a marked position that can move and carry a particular state. In this setting we study the monoid of Turing machines and the group of reversible Turing machines. We also study two natural subgroups, namely the group of finite-state automata, which generalizes the topological full groups studied in the theory of orbit-equivalence, and the group of oblivious Turing machines whose movement is independent of tape contents, which generalizes lamplighter groups and has connections to the study of universal reversible logical gates. Our main results are that the group of Turing machines in one dimension is neither amenable nor residually finite, but is locally embeddable in finite groups, and that the torsion problem is decidable for finite-state automata in dimension one, but not in dimension two.
Fichier principal
Vignette du fichier
395687_1_En_5_Chapter.pdf (336.1 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01435034 , version 1 (13-01-2017)





Sebastián Barbieri, Jarkko Kari, Ville Salo. The Group of Reversible Turing Machines. 22th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2016, Zurich, Switzerland. pp.49-62, ⟨10.1007/978-3-319-39300-1_5⟩. ⟨hal-01435034⟩
215 View
128 Download



Gmail Facebook X LinkedIn More