562 search results - page 3 / 113 » Concurrent Turing Machines |
CIE
2007
Springer
15 years 3 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...
CIE
2006
Springer
15 years 1 months ago
2006
Springer
Wegner and Eberbach[Weg04b] have argued that there are fundamental limitations to Turing Machines as a foundation of computability and that these can be overcome by so-called super...
CDES
2006
14 years 11 months ago
2006
In this paper we define splicing rules for class II restriction endonucleases and show how a Turing Machine can be simulated using such rules.
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Turing machines exposed to a small stochastic noise are considered. An exact characterisation of their (≈ Π0 2 ) computational power (as noise level tends to 0) is obt...
77
Voted
FCT
2005
Springer
15 years 3 months ago
2005
Springer
Unambiguity in alternating Turing machines has received considerable attention in the context of analyzing globally-unique games by Aida et al. [ACRW04] and in the design of effic...