@inproceedings{10.1007/978-3-642-30870-3_34,
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.},
Address = {Berlin, Heidelberg},
Author = {Jeandel, Emmanuel},
BookTitle = {How the World Computes},
Editor = {Cooper, S. Barry and Dawar, Anuj and L{\"o}we, Benedikt},
File = {On Immortal Configurations in Turing Machines - Jeandel2012\_Chapter\_OnImmortalConfigurationsInTuri - a - c.pdf},
ISBN = {978-3-642-30870-3},
Pages = {334--343},
Publisher = {Springer Berlin Heidelberg},
Title = {On Immortal Configurations in Turing Machines},
Year = {2012},
date-added = {2020-12-16 22:33:42 +0100},
date-modified = {2020-12-16 22:33:42 +0100},
doi = {10.1007/978-3-642-30870-3_34}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A