Skip to search formSkip to main contentSkip to account menu

Turing degree

Known as: Turing equivalence (recursion theory), Recursively enumerable Turing degree, T-degree 
In computer science and mathematical logic the Turing degree (named after Alan Turing) or degree of unsolvability of a set of natural numbers… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2013
Highly Cited
2011
Highly Cited
2010
Highly Cited
2010
The last 40 years have witnessed a remarkable boom in higher education, particularly of women. Today in most higher-income… 
Highly Cited
2005
Highly Cited
2005
Abstract We compare various notions of algorithmic randomness. First we consider relativized randomness. A set is n-random if it… 
Review
1998
Review
1998
Standard locking (two-phase locking with on-demand lock requests and blocking upon lock conflict) is the primary concurrency… 
Highly Cited
1996
Highly Cited
1996
RIVM en TNO hebben gezamenlijk een mondiale emissiedatabase EDGAR (Emission Database for Global Atmospheric Research… 
Highly Cited
1977
Highly Cited
1977
Review
1975
Review
1975
  • W. Kohler
  • IEEE Transactions on Computers
  • 1975
  • Corpus ID: 20200139
The problem of scheduling tasks on a system of independent identical processors is discussed and the performance of a suboptimal… 
Highly Cited
1966
Highly Cited
1966
The degrees of unsolvability have been extensively studied by Sacks in (4). This paper studies problems concerned with lower… 
Highly Cited
1959
Highly Cited
1959
This is the third of a series of papers in these Transactions on hierarchies obtained by quantifying variables of recursive…