315 search results - page 3 / 63 » Reactive Turing Machines |
AMC
2006
13 years 5 months ago
2006
Church thesis and its variants say roughly that all reasonable models of computation do not have more power than Turing machines. In a contrapositive way, they say that any model ...
CIE
2007
Springer
13 years 11 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
13 years 9 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...
FUIN
2007
13 years 5 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 ...
CDES
2006
13 years 6 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.