Oracle Computation
Oracle Computation is a theoretical model of computation in which a Turing machine is augmented with an oracle—a black box capable of solving a specific decision problem in a single step, thereby enabling the study of relative computability and the hierarchy of unsolvable problems.
228
Publications
16.1K
Citations
454
Authors
274
Institutions
Publications per year
2017–2026
61
Variants
Relativized Computation
Parents
228
Ethan Bernstein, Umesh Vazirani · SIAM Journal on Computing · 1997 · 1.5K citations
Ethan Bernstein, Umesh Vazirani · 1993 · 1.3K citations
Quantum random-walk search algorithm
Neil Shenvi, Julia Kempe, K. Birgitta Whaley · Physical Review A · 2003 · 1.2K citations · Full text
Computing, Computer Science, Physics +11
On Testing Non-Testable Programs
Elaine J. Weyuker · The Computer Journal · 1982 · 600 citations · Full text
1–5 of 228
454
8
h-index
8
h-index
8
h-index
6
h-index
University at Buffalo, State University of New York, United States
5 publications · 179 citations
5
h-index
1–5 of 454
274
University of California, Berkeley
Berkeley, United States
8 h-index
14 publications
5.3K citations

Swansea University
Swansea, United Kingdom
8 h-index
16 publications
370 citations
University of Lisbon
Lisbon, Portugal
7 h-index
11 publications
265 citations
Princeton University
Princeton, United States
7 h-index
7 publications
813 citations
IBM Research - Almaden
San Jose, United States
5 h-index
5 publications
415 citations
Georgia Institute of Technology
Atlanta, United States
5 h-index
14 publications
614 citations
Microsoft (United States)
Redmond, United States
5 h-index
8 publications
320 citations
Google (United States)
Mountain View, United States
5 h-index
6 publications
289 citations
1–8 of 274
12 publications · 2.9K citations
12
h-index
Repository · 14 publications · 320 citations
11
h-index
PRA · 9 publications · 1.5K citations
9
h-index
7 publications · 186 citations
7
h-index
Conference · 4 publications · 117 citations
4
h-index
1–5