Computational Complexity of Probabilistic Turing Machines

@article{Gill1977ComputationalCO,
  title={Computational Complexity of Probabilistic Turing Machines},
  author={John Gill},
  journal={SIAM J. Comput.},
  year={1977},
  volume={6},
  pages={675-695}
}
  • John Gill
  • Published 1977
  • Mathematics, Computer Science
  • SIAM J. Comput.
A probabilistic Turing machine is a Turing machine with the ability to make decisions based on the outcomes of unbiased coin tosses. The partial function computed by a probabilistic machine is defined by assigning to each input the output which occurs with probability greater than $\frac{1}{2}$. With this definition, only partial recursive functions are probabilistically computable. The run time and tape of probabilistic machines are defined. A palindrome-like language is described that can be… Expand
The Time-Precision Tradeoff Problem on On-Line Probabilistic Turing Machines
Theory of one-tape linear-time Turing machines
Amplification of slight probabilistic advantage at absolutely no cost in space
Probabilistic Communication Complexity (Preliminary Version)
Space-Bounded Hierarchies and Probabilistic Computations
Threshold Computation and Cryptographic Security
On the Structure of Logspace Probabilistic Complexity Classes
  • I. Macarie
  • Computer Science, Mathematics
  • SIAM J. Comput.
  • 1999
Properties of Probabilistic Pushdown Automata
...
1
2
3
4
5
...