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)

Related topics

Related topics

25 relations
Algorithmically random sequenceArithmetical hierarchyChaitin's constantComputable function

Broader (2)

Computability theoryTheory of computation

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Degrees of Unsolvability
Highly Cited
2014
Highly Cited
2014
The TODIM analysis approach based on novel measured functions under hesitant fuzzy environment
Highly Cited
2011
Highly Cited
2011
Fuzzy analytic hierarchy process: A logarithmic fuzzy preference programming methodology
Highly Cited
2011
Highly Cited
2011
The optimal priority models of the intuitionistic fuzzy preference relation and their application in selecting industries with higher meteorological sensitivity
Review
1998
Review
1998
Concurrency control: methods, performance, and analysis
Standard locking (two-phase locking with on-demand lock requests and blocking upon lock conflict) is the primary concurrency… 
Highly Cited
1998
Highly Cited
1998
Enumerations, countable structures and Turing degrees
It is proven that there is a family of sets of natural numbers which has enumerations in every Turing degree except for the… 
Highly Cited
1984
Highly Cited
1984
Which set existence axioms are needed to prove the Cauchy/Peano theorem for ordinary differential equations?
Abstract We investigate the provability or nonprovability of certain ordinary mathematical theorems within certain weak… 
Highly Cited
1977
Highly Cited
1977
Elements of Recursion Theory
Review
1975
Review
1975
A Preliminary Evaluation of the Critical Path Method for Scheduling Tasks on Multiprocessor Systems
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
Lower Bounds for Pairs of Recursively Enumerable Degrees
The degrees of unsolvability have been extensively studied by Sacks in (4). This paper studies problems concerned with lower… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)