4 research outputs found
On the time complexity of 2-tag systems and small universal Turing machines
Get PDFWe show that 2-tag systems efficiently simulate Turing machines. As a
corollary we find that the small universal Turing machines of Rogozhin, Minsky
and others simulate Turing machines in polynomial time. This is an exponential
improvement on the previously known simulation time overhead and improves a
forty year old result in the area of small universal Turing machines.Comment: Slightly expanded and updated from conference versio
Hao Wang. Tag systems and lag systems. Mathematische Annalen, vol. 152 (1963), pp. 65–74. - John Cocke and Marvin Minsky. Universality of tag systems with D = 2. Journal of the Association for Computing Machinery, vol. 11 (1964), pp. 15–20. - Stephen A. Cook. The solvability of the derivability problem for one-normal systems. Journal of the Association for Computing Machinery, vol. 13 (1966), pp. 223–225.
No full text
