The group of reversible Turing machines
Preprint
Abstract
We consider Turing machines as actions over configurations in $\Sigma^{\mathbb{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.
Keywords
All Related Versions
This publication has 13 references indexed in Scilit:
- A notion of effectiveness for subshifts on finitely generated groupsTheoretical Computer Science, 2017
- Some undecidability results for asynchronous transducers and the Brin-Thompson group 2𝑉Transactions of the American Mathematical Society, 2016
- Strongly Universal Reversible Gate Sets2016
- On algebraic properties of topological full groupsSbornik: Mathematics, 2014
- Cantor systems, piecewise translations and simple amenable groupsAnnals of Mathematics, 2013
- Simulation of Effective Subshifts by Two-dimensional Subshifts of Finite TypeActa Applicandae Mathematicae, 2013
- Erratum to: Entropy of Turing machines with moving headTheoretical Computer Science, 2010
- One Head Machines from a symbolic approachTheoretical Computer Science, 2007
- Full groups of Cantor minimal systemsIsrael Journal of Mathematics, 1999
- On topological dynamics of Turing machinesTheoretical Computer Science, 1997