AbstractA probabilistic Turing machine acceptor is a Turing machine acceptor that flips unbiased coins to decide what its next move will be and accepts its input if the probability of reaching a final accepting is greater than 12. We show that deterministic and probabilistic tape complexities are polynomially related
Sources that generate symbolic sequences with algorithmic nature may differ in statistical complexit...
AbstractThis paper introduces a probabilistic rebound Turing machine (PRTM), and investigates the fu...
Sipser and Gács, and independently Lautemann, proved in \u2783 that probabilistic polynomial time i...
A probabilistic Turing machine acceptor is a Turing machine acceptor that flips unbiased coins to de...
AbstractA probabilistic Turing machine acceptor is a Turing machine acceptor that flips unbiased coi...
A computation of a single tape Turing machine can be simulated by a probabilistic random access mach...
AbstractA probabilistic Turing machine (PTM) is a Turing machine that flips an unbiased coin to deci...
Let L be a language recognized by a nondeterministic (single-tape) Turing machine of time complexity...
The model of Turing machines has been studied since its birth in 1936. Researchers have continuously...
In this thesis we examine some of the central problems in the theory of computational complexity, l...
The amount of storage needed to simulate a nondeterministic tape bounded Turingmachine on a determin...
Borodin, Cook, and Pippenger (Inform. and Control 58 (1983), 96–114) proved that both probabilistic ...
. Nondeterministic Turing acceptors can be viewed as probabilistic acceptors with errors that are on...
AbstractWe study three aspects of the power of space-bounded probabilistic Turing machines. First, w...
AbstractThe paper develops the theory of Turing machines as recognizers of infinite (ω-type) input t...
Sources that generate symbolic sequences with algorithmic nature may differ in statistical complexit...
AbstractThis paper introduces a probabilistic rebound Turing machine (PRTM), and investigates the fu...
Sipser and Gács, and independently Lautemann, proved in \u2783 that probabilistic polynomial time i...
A probabilistic Turing machine acceptor is a Turing machine acceptor that flips unbiased coins to de...
AbstractA probabilistic Turing machine acceptor is a Turing machine acceptor that flips unbiased coi...
A computation of a single tape Turing machine can be simulated by a probabilistic random access mach...
AbstractA probabilistic Turing machine (PTM) is a Turing machine that flips an unbiased coin to deci...
Let L be a language recognized by a nondeterministic (single-tape) Turing machine of time complexity...
The model of Turing machines has been studied since its birth in 1936. Researchers have continuously...
In this thesis we examine some of the central problems in the theory of computational complexity, l...
The amount of storage needed to simulate a nondeterministic tape bounded Turingmachine on a determin...
Borodin, Cook, and Pippenger (Inform. and Control 58 (1983), 96–114) proved that both probabilistic ...
. Nondeterministic Turing acceptors can be viewed as probabilistic acceptors with errors that are on...
AbstractWe study three aspects of the power of space-bounded probabilistic Turing machines. First, w...
AbstractThe paper develops the theory of Turing machines as recognizers of infinite (ω-type) input t...
Sources that generate symbolic sequences with algorithmic nature may differ in statistical complexit...
AbstractThis paper introduces a probabilistic rebound Turing machine (PRTM), and investigates the fu...
Sipser and Gács, and independently Lautemann, proved in \u2783 that probabilistic polynomial time i...
DOI
Add to ORKG