Relative Computability
Relative Computability is a concept in computability theory denoting the capacity of a Turing machine to compute a function or decide a set when furnished with an oracle for another set, thereby extending the notion of computability by relativizing it to external information.
28
Publications
1.4K
Citations
37
Authors
24
Institutions
Publications per year
2017–2026
1
Variants
Relativized Computability
28
Joel David Hamkins, Andy Lewis · Journal of Symbolic Logic · 2000 · 259 citations
Rudimentary Predicates and Relative Computation
Celia Wrathall · SIAM Journal on Computing · 1978 · 108 citations
The realizability approach to computable analysis and topology
Andrej Bauer, Dana Scott · 2000 · 82 citations
Strong and weak constructivization and computable families
A. T. Nurtazin · Algebra and Logic · 1974 · 79 citations
1–5 of 28
37
3
h-index
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 37
24
Carnegie Mellon University
Pittsburgh, United States
2 h-index
5 publications
84 citations
University of Chicago
Chicago, United States
2 h-index
2 publications
84 citations

Victoria University of Wellington
Wellington, New Zealand
2 h-index
2 publications
78 citations
FernUniversität in Hagen
Hagen, Germany
2 h-index
3 publications
299 citations
City University of New York
New York, United States
2 h-index
2 publications
307 citations
Center for Discrete Mathematics and Theoretical Computer Science
Piscataway, United States
1 h-index
1 publications
66 citations
University of Illinois Chicago
Chicago, United States
1 h-index
1 publications
18 citations

College of Staten Island
New York, United States
1 h-index
1 publications
259 citations
1–8 of 24
5 publications · 375 citations
5
h-index
ENTCS · 2 publications · 54 citations
2
h-index
2 publications · 158 citations
2
h-index
TRAN · 2 publications · 70 citations
2
h-index
2 publications · 84 citations
2
h-index
1–5