Keyword

Turing degrees

Description: Turing degrees classify sets of natural numbers by their relative levels of algorithmic unsolvability under Turing reducibility.

Primary topic: Computability, Logic, AI Algorithms (89%)

Wikidata ID: wiki/Q1527413

OpenAlex ID: keywords/turing-degrees

Theory of Recursive Functions and Effective Computability

1987 · Jr. Hartley Rogers · CERN Document Server (European Organization for Nuclear Research) · 1,987

Recursively enumerable sets and degrees

1978 · Robert I. Soare · Bulletin of the American Mathematical Society · 1,540

PDF

Recursively Enumerable Sets and Degrees

1987 · Robert I. Soare · Perspectives in mathematical logic · 1,339

Classes of Recursively Enumerable Sets and Their Decision Problems

1953 · H. G. Rice · Transactions of the American Mathematical Society · 865

PDF

Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets

1987 · Robert I. Soare · 354

Π⁰₁ classes and degrees of theories

1972 · Carl G. Jockusch, Robert I. Soare · Transactions of the American Mathematical Society · 353

Computability: An Introduction to Recursive Function Theory

1980 · Nigel J. Cutland · Medical Entomology and Zoology · 332

Recursion-Theoretic Hierarchies

1978 · Peter G. Hinman · Perspectives in mathematical logic · 306

Degrees of Unsolvability

1983 · Manuel Lerman · Springer eBooks · 303

Two Recursively Enumerable Sets of Incomparable Degrees of Unsolvability (solution of Post's Problem, 1944)

1957 · Richard M. Friedberg · Proceedings of the National Academy of Sciences · 295

The Upper Semi-Lattice of Degrees of Recursive Unsolvability

1954 · S. C. Kleene, Emil L. Post · Annals of Mathematics · 269

Quantum Computability

1997 · Leonard M. Adleman, Jonathan DeMarrais, et al. · SIAM Journal on Computing · 262

On Degrees of Unsolvability

1959 · J. R. Shoenfield · Annals of Mathematics · 261

Classical recursion theory : the theory of functions and sets of natural numbers

1999 · Piergiorgio Odifreddi · Thammasat University Digital Collections · 231

Lower Bounds for Pairs of Recursively Enumerable Degrees

1966 · A. H. Lachlan · Proceedings of the London Mathematical Society · 214

Classes of Recursively Enumerable Sets and Degrees of Unsolvability

1966 · Donald A. Martin · Mathematical logic quarterly · 211

Computability

1980 · Nigel Cutland · Cambridge University Press eBooks · 206

Degrees of Unsolvability.

1965 · T. G. McLaughlin, Gerald E. Sacks · American Mathematical Monthly · 205

On the strength of Ramsey's theorem for pairs

2001 · Peter A. Cholak, Carl G. Jockusch, et al. · Journal of Symbolic Logic · 204

The Recursively Enumerable Degrees are Dense

1964 · Gerald E. Sacks · Annals of Mathematics · 201

Recursively enumerable sets and degrees

1988 · Gian-Carlo Rota · Advances in Mathematics · 199

On Degrees of Recursive Unsolvability

1956 · Clifford Spector · Annals of Mathematics · 199

Classical Recursion Theory

1993 · J. E. Fenstad · Bulletin of the London Mathematical Society · 159

On the Degrees Less than 0 �

1963 · Gerald E. Sacks · Annals of Mathematics · 153

Theorie der Numerierungen I

1973 · Ju. L. Eršov · Mathematical logic quarterly · 152

Works count: 2,934

Citation count: 32,140