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
Variants
Degrees Of Unsolvability
157
Leonard M. Adleman, Jonathan DeMarrais, Ming-Deh A. Huang · SIAM Journal on Computing · 1997 · 275 citations
Joel David Hamkins, Andy Lewis · Journal of Symbolic Logic · 2000 · 259 citations
Degrees coded in jumps of orderings
Julia F. Knight · Journal of Symbolic Logic · 1986 · 151 citations
Randomness, relativization and Turing degrees
André Nies, Frank Stephan, Sebastiaan A. Terwijn · Journal of Symbolic Logic · 2005 · 136 citations · Full text
1–5 of 157
130
11
h-index
8
h-index
8
h-index
8
h-index
University of Illinois Urbana-Champaign, United States
7 publications · 252 citations
7
h-index
1–5 of 130
92
University of Chicago
Chicago, United States
13 h-index
24 publications
522 citations

Victoria University of Wellington
Wellington, New Zealand
12 h-index
22 publications
448 citations

University of Leeds
Leeds, United Kingdom
11 h-index
19 publications
565 citations
University of Wisconsin–Madison
Madison, United States
11 h-index
19 publications
457 citations

Cornell University
Ithaca, United States
11 h-index
14 publications
328 citations
University of California, Berkeley
Berkeley, United States
10 h-index
22 publications
486 citations

University of Notre Dame
Notre Dame, United States
8 h-index
10 publications
192 citations
National University of Singapore
Singapore, Singapore
7 h-index
8 publications
253 citations
1–8 of 92
72 publications · 2.5K citations
28
h-index
PROC · 11 publications · 359 citations
10
h-index
TRAN · 8 publications · 200 citations
8
h-index
5 publications · 166 citations
5
h-index
5 publications · 139 citations
5
h-index
1–5