Square time is optimal for simulation of one pushdown store or one queue by an oblivious one-head tape unit (Q1064067)
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: Square time is optimal for simulation of one pushdown store or one queue by an oblivious one-head tape unit |
scientific article; zbMATH DE number 3919822
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Square time is optimal for simulation of one pushdown store or one queue by an oblivious one-head tape unit |
scientific article; zbMATH DE number 3919822 |
Statements
Square time is optimal for simulation of one pushdown store or one queue by an oblivious one-head tape unit (English)
0 references
1985
0 references
To simulate a pushdown store or queue on-line by an oblivious one-head tape unit takes at least square time. Since each multitape Turing machine can be trivially simulated by an oblivious one-head tape unit in square time, this result is optimal.
0 references
time complexity
0 references
on-line simulation
0 references
Kolmogorov complexity
0 references
multitape Turing machine
0 references
