 |
HAL-LIRMM - Open Archive |  |
Conference papers
On Immortal Configurations in Turing Machines
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.
Cited literature [18 references]
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
Long-term archiving on: : Wednesday, December 14, 2016 - 2:03:26 AM
Contributor : Emmanuel Jeandel <>
Submitted on : Friday, January 27, 2012 - 10:57:37 AM
Last modification on : Thursday, May 24, 2018 - 3:59:23 PM
Long-term archiving on: : Wednesday, December 14, 2016 - 2:03:26 AM
File
turing.pdf
Files produced by the author(s)