On the presence of periodic configurations in Turing machines and in counter machines.

DOI10.1016/S0304-3975(01)00382-6zbMath1061.68050MaRDI QIDQ1853547

Codrin Nichitiu, Julien Cassaigne, Blondel, Vincent D.

Publication date: 21 January 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Related Items (16)

Infinite traces and symbolic dynamics ⋮ Undecidability of the Surjectivity of the Subshift Associated to a Turing Machine ⋮ The Group of Reversible Turing Machines ⋮ A small minimal aperiodic reversible Turing machine ⋮ One head machines from a symbolic approach ⋮ Quasi-periodic configurations and undecidable dynamics for tilings, infinite words and Turing machines ⋮ The Transitivity Problem of Turing Machines ⋮ Topological mixing notions on Turing machine dynamical systems ⋮ On relations between properties in transitive Turing machines ⋮ A physically universal Turing machine ⋮ The Most General Conservation Law for a Cellular Automaton ⋮ The periodic domino problem revisited ⋮ On the hierarchy of conservation laws in a cellular automaton ⋮ Periodicity and Immortality in Reversible Computing ⋮ Undecidability of the speed positiveness problem in reversible and complete Turing machines ⋮ On dynamics of automata with a stack

Cites Work

• Unnamed Item
• On topological dynamics of Turing machines
• Automata Studies. (AM-34)
• Generalized shifts: unpredictability and undecidability in dynamical systems
• The undecidability of the Turing machine immortality problem
• Deciding stability and mortality of piecewise affine dynamical systems
• The stability of saturated linear dynamical systems is undecidable

This page was built for publication: On the presence of periodic configurations in Turing machines and in counter machines.