Probabilistic Turing Machines
Probabilistic Turing Machine is a computational model that extends the deterministic Turing machine by incorporating a probabilistic transition function, enabling it to choose among possible transitions according to a defined probability distribution, thereby allowing for randomized computation.
51
Publications
8K
Citations
84
Authors
51
Institutions
Publications per year
2017–2026
3
Parents
51
Ethan Bernstein, Umesh Vazirani · SIAM Journal on Computing · 1997 · 1.5K citations
On the Power of Quantum Computation
Daniel Simón · SIAM Journal on Computing · 1997 · 1.3K citations
Computing, Computer Science, Physics +14
Ethan Bernstein, Umesh Vazirani · 1993 · 1.3K citations
Computational Complexity of Probabilistic Turing Machines
John Gill · SIAM Journal on Computing · 1977 · 694 citations
On the power of quantum computation
Damien Simon · 2002 · 495 citations
Computing, Computer Science, Physics +14
1–5 of 51
84
5
h-index
4
h-index
3
h-index
3
h-index
3
h-index
1–5 of 84
51
Massachusetts Institute of Technology
Cambridge, United States
3 h-index
7 publications
520 citations

University of Rochester
Rochester, United States
3 h-index
4 publications
240 citations

Pennsylvania State University
State College, United States
3 h-index
3 publications
66 citations
ETH Zurich
Zurich, Switzerland
2 h-index
2 publications
137 citations

Universidade Estadual de Campinas (UNICAMP)
Campinas, Brazil
2 h-index
2 publications
32 citations

Queensland University of Technology
Brisbane, Australia
2 h-index
10 publications
325 citations

The University of Queensland
Brisbane, Australia
2 h-index
10 publications
325 citations

University of Latvia
Riga, Latvia
2 h-index
3 publications
45 citations
1–8 of 51
6 publications · 4.1K citations
6
h-index
4 publications · 96 citations
4
h-index
Conference · 2 publications · 65 citations
2
h-index
2 publications · 130 citations
2
h-index
PROC · 2 publications · 56 citations
2
h-index
1–5