242 search results - page 4 / 49 » Zigzags in Turing Machines |
FUIN
2007
13 years 6 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 7 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
13 years 11 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...
FCT
2005
Springer
13 years 11 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...
AIML
2004
13 years 7 months ago
2004
This paper shows that satisfiability for Propositional Dynamic Logic with Intersection is EXPSPACE-hard. The proof uses a reduction from the word problem for alternating, exponent...