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

Authors

37

  1. DS
    Dana Scott

    Carnegie Mellon University, United States

    3 publications · 117 citations

    3

    h-index

  2. LB
    Lars Birkedal

    Aarhus University, Denmark

    3 publications · 75 citations

    3

    h-index

  3. JD
    Joel David Hamkins

    City University of New York, United States

    2 publications · 307 citations

    2

    h-index

  4. RI
    Robert I. Soare

    University of Chicago, United States

    2 publications · 34 citations

    2

    h-index

  5. DR
    Denis R. Hirschfeldt

    University of Chicago, United States

    2 publications · 116 citations

    2

    h-index

1–5 of 37

Venues

  1. Journal of Symbolic Logic

    5 publications · 375 citations

    5

    h-index

  2. Electronic Notes in Theoretical Computer Science

    ENTCS · 2 publications · 54 citations

    2

    h-index

  3. SIAM Journal on Computing

    2 publications · 158 citations

    2

    h-index

  4. Transactions of the American Mathematical Society

    TRAN · 2 publications · 70 citations

    2

    h-index

  5. Bulletin of Symbolic Logic

    2 publications · 84 citations

    2

    h-index

1–5