On immortal configurations in turing machines

Authors:
Emmanuel Jeandel
Affiliations:
Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier, UMR 5506, Montpellier, Cedex 5, France
Venue:
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Year:
2012

Citing 7
Cited 0

An introduction to symbolic dynamics and coding

An introduction to symbolic dynamics and coding
A small aperiodic set of Wang tiles

Discrete Mathematics
On topological dynamics of Turing machines

Theoretical Computer Science
On the presence of periodic configurations in Turing machines and in counter machines

Theoretical Computer Science
Quasi-periodic configurations and undecidable dynamics for tilings, infinite words and turing machines

Theoretical Computer Science - Combinatorics of the discrete plane and tilings
Computation: finite and infinite machines

Computation: finite and infinite machines
Periodicity and Immortality in Reversible Computing

MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the immortality problem for Turing machines and prove that there exists a Turing Machine that is immortal but halts on every recursive configuration. The result is obtained by combining a new proof of Hooper's theorem [11] with recent results on effective symbolic dynamics.