The undecidability of the Turing machine immortality problem

Hooper, P. (1966). The undecidability of the Turing machine immortality problem.

Type

Unclassified

Intellectual base

Unclassified

Year

1966

DOI

10.2307/2269811

Link

https://doi.org/10.2307/2269811

Cited by

1 citation across 1 artifact.

Domain-specific

• Mortality (computability theory)
  • Mortality problems occur for matrices, automata, rewriting systems and cellular processes; the carrier, composition convention and mortal target determine sharply different decidability boundaries.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:6fa76cc7d278 · see in the full table