- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
The undecidability of the Turing machine immortality problem
Journal of Symbolic Logic 31 (2):219-234 (1966)
Abstract
This article has no associated abstract. (fix it)Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
The Undecidability of the Turing Machine Immortality Problem.Philip K. Hooper - 1971 - Journal of Symbolic Logic 36 (1):150-150.
Philip K. Hooper. The undecidability of the Turing machine immortality problem. The journal of symbolic logic, vol. 31 , pp. 219–234. [REVIEW]Gabor T. Herman - 1971 - Journal of Symbolic Logic 36 (1):150-150.
Review: Philip K. Hooper, Monogenic Post Normal Systems of Arbitrary Degree. [REVIEW]M. D. Gladstone - 1969 - Journal of Symbolic Logic 34 (3):508-509.
Philip K. Hooper. Monogenic Post normal systems of arbitrary degree. Journal of the Association for Computing Machinery, vol. 13 , pp. 359–363. [REVIEW]M. D. Gladstone - 1969 - Journal of Symbolic Logic 34 (3):508-509.
Undecidability in the imitation game.Y. Sato & T. Ikegami - 2004 - Minds and Machines 14 (2):133-43.
Review: Shen Lin, Tibor Rado, Computer Studies of Turing Machine Problems; Allen H. Brady, The Conjectured Highest Scoring Machines for Rado's $sum(k)$ for the Value $K = 4$; Milton W. Green, A Lower Bound on Rado's Sigma Function for Binary Turing Machines. [REVIEW]H. B. Enderton - 1975 - Journal of Symbolic Logic 40 (4):617-617.
The unsolvability of the uniform halting problem for two state Turing machines.Gabor T. Herman - 1969 - Journal of Symbolic Logic 34 (2):161-165.
A Universal Inductive Turing Machine.D. Osherson & S. Weinstein - 1989 - Journal of Symbolic Logic 56:661-672.
Review: Haskell B. Curry, The Undecidability of $lambda$K-Conversion. [REVIEW]Richard J. Orgass - 1975 - Journal of Symbolic Logic 40 (2):246-246.
Analytics
Added to PP
2009-01-28
Downloads
12 (#1,115,280)
6 months
42 (#98,106)
2009-01-28
Downloads
12 (#1,115,280)
6 months
42 (#98,106)
Historical graph of downloads
Citations of this work
Typability and type checking in System F are equivalent and undecidable.J. B. Wells - 1999 - Annals of Pure and Applied Logic 98 (1-3):111-156.
On immortal configurations in turing machines.Emmanuel Jeandel - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 334--343.
A New General Approach to the Theory of the Many‐One Equivalence of Decision Problems for Algorithmic Systems.Egon Börger - 1979 - Mathematical Logic Quarterly 25 (7-12):135-162.
Strong Computability and Variants of the Uniform Halting Problem.Gabor T. Herman - 1971 - Mathematical Logic Quarterly 17 (1):115-131.
Quantificational variants on the halting problem for turing machines.Patrick C. Fischer - 1969 - Mathematical Logic Quarterly 15 (13-15):211-218.
References found in this work
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-68866f4b87-6mvtb uwo