Verifying whether one-tape Turing machines run in linear time (Q2009635)
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 7138695
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Verifying whether one-tape Turing machines run in linear time |
scientific article; zbMATH DE number 7138695 |
Statements
Verifying whether one-tape Turing machines run in linear time (English)
0 references
29 November 2019
0 references
one-tape Turing machine
0 references
crossing sequence
0 references
linear time
0 references
running time
0 references
lower bounds
0 references
0 references
0.8380043506622314
0 references
0.7889577150344849
0 references
0.7875431180000305
0 references
0.7861059904098511
0 references
0.7800561785697937
0 references
