The undecidability of the Turing machine immortality problem (Q5559248): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.2307/2269811 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2161843469 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Tag systems and lag systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computability of Recursive Functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Turing-machines and the Entscheidungsproblem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Recursive unsolvability of Post's problem of ''Tag'' und other topics in theory of Turing machines / rank | |||
Normal rank | |||
Latest revision as of 23:56, 11 June 2024
scientific article; zbMATH DE number 3275586
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The undecidability of the Turing machine immortality problem |
scientific article; zbMATH DE number 3275586 |
Statements
The undecidability of the Turing machine immortality problem (English)
0 references
1966
0 references
recursion theory, constructive mathematics
0 references
