562 search results - page 1 / 113 » Concurrent Turing Machines |
FUIN
2007
13 years 11 months ago
2007
We define Concurrent Turing Machines (CTMs) as Turing machines with Petri nets as finite control. This leads to machines with arbitrary many tape heads, thus subsuming any class ...
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...
JAPLL
2008
13 years 11 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 9 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
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...