A Machine-Independent Theory of the Complexity of Recursive Functions
Journal of the ACM (JACM)
Deterministic simulation of non-deterministic turing machines (Detailed Abstract)
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Computational complexity and nondeterminism in flowchart programs.
Computational complexity and nondeterminism in flowchart programs.
The theory of signature testing for VLSI
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Universal classes of hash functions (Extended Abstract)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Reducibility, randomness, and intractibility (Abstract)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Relativized questions involving probabilistic algorithms
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Logics for probabilistic programming (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
P systems with elementary active membranes: beyond NP and coNP
CMC'10 Proceedings of the 11th international conference on Membrane computing
On using probabilistic Turing machines to model participants in cryptographic protocols
Theoretical Computer Science
Hi-index | 0.01 |
Probabilistic Turing machines are Turing machines with the ability to flip coins in order to make random decisions. We allow probabilistic Turing machines small but nonzero error probability in computing number-theoretic functions. An example is given of a function computable more quickly by probabilistic Turing machines than by deterministic Turing machines. It is shown how probabilistic linear-bounded automata can simulate nondeterministic linear-bounded automata.