The Group of Reversible Turing Machines

DOI10.1007/978-3-319-39300-1_5zbMath1350.68101arXiv1603.08715OpenAlexW2315683245WikidataQ62045888 ScholiaQ62045888MaRDI QIDQ3186472

Sebastián Barbieri, Jarkko Peltomäki, Jarkko Kari

Publication date: 10 August 2016

Published in: Cellular Automata and Discrete Complex Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1603.08715

Mathematics Subject Classification ID

Related Items (8)

Universal groups of cellular automata ⋮ On relations between properties in transitive Turing machines ⋮ A physically universal Turing machine ⋮ Transitive action on finite points of a full shift and a finitary Ryan’s theorem ⋮ Subshifts with sparse traces ⋮ No Tits alternative for cellular automata ⋮ Distortion in automorphisms of expansive systems ⋮ Universal gates with wires in a row

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cantor systems, piecewise translations and simple amenable groups
• Simulation of effective subshifts by two-dimensional subshifts of finite type
• A notion of effectiveness for subshifts on finitely generated groups
• One head machines from a symbolic approach
• Erratum to: Entropy of Turing machines with moving head
• On topological dynamics of Turing machines
• Full groups of Cantor minimal systems
• On the presence of periodic configurations in Turing machines and in counter machines.
• On finite approximations of groups and algebras
• Conjugacy and dynamics in Thompson's groups.
• A tight linear bound on the synchronization delay of bijective automata
• Some undecidability results for asynchronous transducers and the Brin-Thompson group $2V$
• Computability of the entropy of one-tape Turing Machines
• Zigzags in Turing Machines
• Cellular Automata and Groups
• Effective Closed Subshifts in 1D Can Be Implemented in 2D
• Periodicity and Immortality in Reversible Computing
• The Automorphism Group of a Shift of Finite Type
• The Classification of Reversible Bit Operations
• An Introduction to Symbolic Dynamics and Coding
• Representation of reversible cellular automata with block permutations
• Group-Walking Automata
• Plane-Walking Automata

This page was built for publication: The Group of Reversible Turing Machines