12 search results - page 1 / 3 » Small Weakly Universal Turing Machines |
FCT
2009
Springer
14 years 17 days ago
2009
Springer
We give small universal Turing machines with state-symbol pairs of (6, 2), (3, 3) and (2, 4). These machines are weakly universal, which means that they have an infinitely repeate...
FOCS
2006
IEEE
14 years 1 days ago
2006
IEEE
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 ma...
MCU
2007
13 years 7 months ago
2007
We present small polynomial time universal Turing machines with state-symbol pairs of (5, 5), (6, 4), (9, 3) and (18, 2). These machines simulate our new variant of tag system, the...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
geometrical computation 4: small Turing universal signal machines J
CIE
2007
Springer
14 years 5 days ago
2007
Springer