The complexity of small universal Turing machines: A survey (Q1004087)
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: The complexity of small universal Turing machines: A survey |
scientific article; zbMATH DE number 5522107
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of small universal Turing machines: A survey |
scientific article; zbMATH DE number 5522107 |
Statements
The complexity of small universal Turing machines: A survey (English)
0 references
2 March 2009
0 references
small universal Turing machines
0 references
computational complexity
0 references
polynomial time
0 references
simulation
0 references
tag systems
0 references
cellular automata
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.97766864
0 references
0 references
0.8965945
0 references
0.8965945
0 references
0 references
0 references
