244 search results - page 12 / 49 » Turing machines and bimachines |
TCS
2010
13 years 2 months ago
2010
We describe a solution to the SAT problem via non-confluent P systems with active membranes, without using membrane division rules. Furthermore, we provide an algorithm for simula...
CDES
2006
13 years 8 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.
JCSS
2000
13 years 7 months ago
2000
We give the first nontrivial model-independent time-space tradeoffs for satisfiability. Namely, we show that SAT cannot be solved simultaneously in n1+o(1) time and n1space for an...
SOFSEM
2001
Springer
13 years 11 months ago
2001
Springer
The class of weak parallel machines is interesting, because it contains some realistic parallel machine models, especially suitable for pipelined computations. We prove that a modi...
AIML
2004
13 years 8 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...