Verifying time complexity of Turing machines (Q496007)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Verifying time complexity of Turing machines |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Verifying time complexity of Turing machines |
scientific article |
Statements
Verifying time complexity of Turing machines (English)
0 references
16 September 2015
0 references
Turing machine
0 references
running time
0 references
decidable
0 references
crossing sequence
0 references
regular expression
0 references
0.8380043506622314
0 references
0.7444900870323181
0 references
0.7347313761711121
0 references
