244 search results - page 1 / 49 » Turing machines and bimachines |
TCS
2008
13 years 4 months ago
2008
We associate the iterated block product of a bimachine with a deterministic Turing machine. This allows us to introduce new algebraic notions to study the behavior of the Turing m...
FOCS
2006
IEEE
13 years 10 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...
MSCS
2010
13 years 2 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...
CIE
2007
Springer
13 years 10 months ago
2007
Springer
We study Post’s Problem for the ordinal register machines defined in [6], showing that its general solution is positive, but that any set of ordinals solving it must be unbounde...