242 search results - page 2 / 49 » Zigzags in Turing Machines |
JAPLL
2008
13 years 4 months ago
2008
Maurer machines are much closer to real computers than Turing machines. Computer instructions play a prominent part in Maurer machines. We show a straightforward way to simulate Tu...
MSCS
2010
13 years 3 months ago
2010
ABSTRACT. In this note we prove that any Turing machine which uses only a finite computational space for every input cannot solve an uncomputable problem even in case it runs in a...
FCT
2009
Springer
13 years 11 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
13 years 6 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...
EUROGP
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. Turing machines are playing an increasingly significant role in Computer Science domains such as bioinformatics. Instead of directly formulating a solution to a problem, ...