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

被引：0

作者：

Woods, Damien ^{[1
]}

Neary, Turlough ^{[2
]}

机构：

[1] Univ Coll Cork, Boole Ctr Res Informat, Dept Math, Cork, Ireland

[2] Natl Univ Ireland Univ Coll Cork, Dept Comp Sci, TASS, Maynooth, Kildare, Ireland

来源：

47TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS | 2006年

关键词：

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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.

引用

页码：439 / +

页数：4

共 50 条

[21] Solvability of the Halting and Reachability Problem for Binary 2-tag Systems
De Mol, Liesbeth
[J]. FUNDAMENTA INFORMATICAE, 2010, 99 (04) : 435 - 471
[22] Universal Reversible Turing Machines with a Small Number of Tape Symbols
Morita, Kenichi
[J]. FUNDAMENTA INFORMATICAE, 2015, 138 (1-2) : 17 - 29
[23] Yurii Rogozhin's Contributions to the Field of Small Universal Turing Machines
Woods, Damien
Neary, Turlough
[J]. FUNDAMENTA INFORMATICAE, 2015, 138 (1-2) : 251 - 258
[24] Abstract geometrical computation 4: Small Turing universal signal machines
Durand-Lose, Jerome
[J]. THEORETICAL COMPUTER SCIENCE, 2011, 412 (1-2) : 57 - 67
[25] ON THE COMPLEXITY OF LEARNING MINIMUM TIME-BOUNDED TURING-MACHINES
KO, KI
[J]. SIAM JOURNAL ON COMPUTING, 1991, 20 (05) : 962 - 986
[26] Space complexity equivalence of P systems with active membranes and Turing machines
Alhazov, Artiom
Leporati, Alberto
Mauri, Giancarlo
Porreca, Antonio E.
Zandron, Claudio
[J]. THEORETICAL COMPUTER SCIENCE, 2014, 529 : 69 - 81
[27] 2 UNIVERSAL TURING-MACHINES WITH AT MOST 2 LEFT INSTRUCTIONS
MARGENSTERN, M
PAVLOTSKAIA, L
[J]. COMPTES RENDUS DE L ACADEMIE DES SCIENCES SERIE I-MATHEMATIQUE, 1995, 320 (11): : 1395 - 1400
[28] Calculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing Machines
Soler-Toscano, Fernando
Zenil, Hector
Delahaye, Jean-Paul
Gauvrit, Nicolas
[J]. PLOS ONE, 2014, 9 (05):
[29] ALTERNATING ONLINE TURING-MACHINES WITH ONLY UNIVERSAL STATES AND SMALL SPACE BOUNDS
INOUE, K
TAKANAMI, I
VOLLMAR, R
[J]. THEORETICAL COMPUTER SCIENCE, 1985, 41 (2-3) : 331 - 339
[30] On small space complexity classes of stochastic Turing machines and Arthur-Merlin-games
M. Liskiewicz
R. Reischuk
[J]. computational complexity, 1999, 8 : 273 - 307

← 1 2 3 4 5 →