Hooper, P. K. The undecidability of the Turing machine immortality problem. (English) Zbl 0173.01201 J. Symb. Log. 31, 219-234 (1966). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 23 Documents Keywords:recursion theory, constructive mathematics PDF BibTeX XML Cite \textit{P. K. Hooper}, J. Symb. Log. 31, 219--234 (1966; Zbl 0173.01201) Full Text: DOI References: [1] DOI: 10.1145/320856.320867 · doi:10.1145/320856.320867 [2] DOI: 10.1007/BF01343730 · Zbl 0131.24602 · doi:10.1007/BF01343730 [3] DOI: 10.1145/321160.321170 · Zbl 0118.25401 · doi:10.1145/321160.321170 [4] DOI: 10.1007/BF01470748 · Zbl 0118.01602 · doi:10.1007/BF01470748 [5] Notices of the American Mathematical Society 12 pp 371– (1965) [6] Computability and Unsolvability (1958) [7] DOI: 10.2307/1970290 · Zbl 0105.00802 · doi:10.2307/1970290 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.