Undecidability of the Surjectivity of the Subshift Associated to a Turing Machine
From MaRDI portal
Recommendations
- Some undecidable problems about the trace-subshift associated to a Turing machine
- Turing machines associated with the undecidability property of the halting problem
- scientific article; zbMATH DE number 522847
- Decidability and undecidability in the enumerable Turing degrees
- (Un)Decidability of Injectivity and Surjectivity in One-Dimensional Sand Automata
- Computability of countable subshifts
- Undecidable word problem in subshift automorphism groups
- scientific article; zbMATH DE number 1114344
- Undecidable properties of self-affine sets and multi-tape automata
- Undecidability of the speed positiveness problem in reversible and complete Turing machines
Cites work
- On entropy and Turing machine with moving tape dynamical model
- On the presence of periodic configurations in Turing machines and in counter machines.
- On topological dynamics of Turing machines
- One head machines from a symbolic approach
- Periodicity and Immortality in Reversible Computing
- Universality of a reversible two-counter machine
- Zigzags in Turing Machines
Cited in
(7)- On topological dynamics of Turing machines
- Undecidability of the speed positiveness problem in reversible and complete Turing machines
- Topological mixing notions on Turing machine dynamical systems
- The transitivity problem of Turing machines
- Some undecidable problems about the trace-subshift associated to a Turing machine
- Generalized shifts: unpredictability and undecidability in dynamical systems
- On relations between properties in transitive Turing machines
This page was built for publication: Undecidability of the Surjectivity of the Subshift Associated to a Turing Machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3453734)
