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.
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00663457
Contributor : Emmanuel Jeandel
<>
Submitted on : Friday, January 27, 2012 - 10:57:37 AM
Last modification on : Thursday, May 24, 2018 - 3:59:23 PM
Document(s) archivé(s) le : Wednesday, December 14, 2016 - 2:03:26 AM
Emmanuel Jeandel. On Immortal Configurations in Turing Machines. CiE: Computability in Europe, 2012, Cambridge, United Kingdom. pp.334-343, ⟨10.1007/978-3-642-30870-3_34⟩. ⟨lirmm-00663457⟩
