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
Contributeur : Emmanuel Jeandel
<>
Soumis le : vendredi 27 janvier 2012 - 10:57:37
Dernière modification le : jeudi 24 mai 2018 - 15:59:23
Document(s) archivé(s) le : mercredi 14 décembre 2016 - 02:03:26
Emmanuel Jeandel. On Immortal Configurations in Turing Machines. CiE: Computability in Europe, 2012, Cambridge, United Kingdom. pp.334-343, 2012, 〈10.1007/978-3-642-30870-3_34〉. 〈lirmm-00663457〉
