MLQ
2007
13 years 12 months ago
2007
Let ω denote the set of natural numbers. For functions f, g : ω → ω, we say that f is dominated by g if f(n) < g(n) for all but finitely many n ∈ ω. We consider the st...
CORR
1999
Springer
14 years 3 days ago
1999
Springer
: In the early 1980s, Selman's seminal work on positive Turing reductions showed that positive Turing reduction to NP yields no greater computational power than NP itself. Thu...
CORR
2000
Springer
14 years 8 days ago
2000
Springer
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata...
AML
2004
14 years 10 days ago
2004
We show that there exists a single minimal (Turing) degree b < 0 s.t. for all c.e. degrees 0 < a < 0 , 0 = a b. Since b is minimal this means that b complements all c.e....
BSL
2005
14 years 10 days ago
2005
A mass problem is a set of Turing oracles. If P and Q are mass problems, we say that P is weakly reducible to Q if every member of Q Turing computes a member of P. We say that P i...
AMC
2005
14 years 11 days ago
2005
We derive a necessary and sufficient condition for Turing instabilities to occur in two-component systems of reaction-diffusion equations with Neumann boundary conditions. We appl...
FUIN
2007
14 years 12 days 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 ...
JAPLL
2008
14 years 13 days ago
2008
Maurer machines are much closer to real computers than Turing machines. Computer instructions play a prominent part in Maurer machines. We show a straightforward way to simulate Tu...
APAL
2006
14 years 15 days ago
2006
Abstract. We show that the identity bounded Turing degrees of computably enumerable sets are not dense.
APAL
2010
14 years 17 days ago
2010
We prove that if S is an -model of weak weak K