429 search results - page 4 / 86 » Noisy Turing Machines |
FCT
2005
Springer
14 years 27 days 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 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...
TCS
2008
13 years 7 months ago
2008
We associate the iterated block product of a bimachine with a deterministic Turing machine. This allows us to introduce new algebraic notions to study the behavior of the Turing m...
EUROGP
1999
Springer
13 years 11 months ago
1999
Springer
The Busy Beaver is an interesting theoretical problem proposed by Rado in 1962. In this paper we propose an evolutionary approach to this problem. We will focus on the representati...
CORR
1999
Springer
13 years 7 months 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...