On the generic undecidability of the halting problem for normalized Turing machines (Q2398210): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Most programs stop quickly or never halt / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Theory of Program Size Formally Identical to Information Theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The halting problem is decidable on a set of asymptotic probability one / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Generic-case complexity, decision problems in group theory, and random walks. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the strongly generic undecidability of the halting problem / rank | |||
Normal rank | |||
Latest revision as of 06:01, 14 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the generic undecidability of the halting problem for normalized Turing machines |
scientific article |
Statements
On the generic undecidability of the halting problem for normalized Turing machines (English)
0 references
15 August 2017
0 references
generic complexity
0 references
halting problem
0 references
