Undecidability of the Surjectivity of the Subshift Associated to a Turing Machine
From MaRDI portal
Publication:3453734
DOI10.1007/978-3-642-36315-3_4zbMath1333.68113OpenAlexW1600706349MaRDI QIDQ3453734
Nicolas Ollinger, Rodrigo C. Torres, Anahí Gajardo
Publication date: 30 November 2015
Published in: Reversible Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-36315-3_4
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
The Transitivity Problem of Turing Machines ⋮ On relations between properties in transitive Turing machines ⋮ Undecidability of the speed positiveness problem in reversible and complete Turing machines
Cites Work
- One head machines from a symbolic approach
- On topological dynamics of Turing machines
- Universality of a reversible two-counter machine
- On the presence of periodic configurations in Turing machines and in counter machines.
- On entropy and Turing machine with moving tape dynamical model
- Zigzags in Turing Machines
- Periodicity and Immortality in Reversible Computing
This page was built for publication: Undecidability of the Surjectivity of the Subshift Associated to a Turing Machine
