On the generic undecidability of the halting problem for normalized Turing machines (Q2398210)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6760477
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the generic undecidability of the halting problem for normalized Turing machines |
scientific article; zbMATH DE number 6760477 |
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
0.8641794919967651
0 references
0.7734652757644653
0 references
0.7643985152244568
0 references
0.7463516592979431
0 references
