Skip to main content
Conference Proceedings

On immortal configurations in Turing machines

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2012) 7318 LNCS 334-343
DOI: 10.1007/978-3-642-30870-3_34
9Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

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. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Jeandel, E. (2012). On immortal configurations in Turing machines. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7318 LNCS, pp. 334–343). https://doi.org/10.1007/978-3-642-30870-3_34

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free