Turing Degrees

Turing Degrees is an equivalence relation on sets of natural numbers that classifies their relative computational unsolvability by measuring the level of algorithmic non-computability under Turing reducibility.

157

Publications

5K

Citations

130

Authors

92

Institutions

Publications per year

2017–2026

7

Authors

130

  1. TA
    Theodore A. Slaman

    University of California, Berkeley, United States

    14 publications · 335 citations

    11

    h-index

  2. RA
    Richard A. Shore

    Cornell University, United States

    8 publications · 205 citations

    8

    h-index

  3. RD
    Rod Downey

    Victoria University of Wellington, New Zealand

    8 publications · 209 citations

    8

    h-index

  4. SL
    Steffen Lempp

    University of Wisconsin–Madison, United States

    8 publications · 155 citations

    8

    h-index

  5. CG
    Carl G. Jockusch

    University of Illinois Urbana-Champaign, United States

    7 publications · 252 citations

    7

    h-index

1–5 of 130

Venues

  1. Journal of Symbolic Logic

    72 publications · 2.5K citations

    28

    h-index

  2. Proceedings of the American Mathematical Society

    PROC · 11 publications · 359 citations

    10

    h-index

  3. Transactions of the American Mathematical Society

    TRAN · 8 publications · 200 citations

    8

    h-index

  4. Journal of the London Mathematical Society

    5 publications · 166 citations

    5

    h-index

  5. Annals of Pure and Applied Logic

    5 publications · 139 citations

    5

    h-index

1–5