8 search results - page 1 / 2 » Small Semi-weakly Universal Turing Machines |
FOCS
2006
IEEE
14 years 5 months 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...
FCT
2009
Springer
14 years 5 months 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...
MCU
2007
14 years 13 days 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
14 years 24 days ago
2008
Springer
geometrical computation 4: small Turing universal signal machines J
CIE
2007
Springer
14 years 5 months ago
2007
Springer