arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0612089cs.CCcs.DS
收藏

关于2标记系统和小型通用图灵机的时间复杂度

On the time complexity of 2-tag systems and small universal Turing machines

Damien Woods, Turlough Neary

摘要:

我们表明,2-标签系统有效地模拟图灵机。作为推论,我们发现Rogozhin、Minsky等人的小型通用图灵机在多项式时间内模拟图灵机。这是对先前已知的模拟时间开销的指数改进,并且改进了小型通用图灵机领域中的四十年前的结果。

英文摘要:

We 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑