in computer science and mathematical logic the turing degree or degree of unsolvability of a set of natural numbers measures the level of algorithmic unsolvability of the set. the concept of turing degree is fundamental in computability theory, where sets of natural numbers are often regarded as decision problems; the turing degree of a set tells how difficult it is to solve the decision problem associated with the set. that is, to determine whether an arbitrary number is in the given set. two sets are turing equivalent if they have the same level of unsolvability; each turing degree is a collection of turing equivalent sets, so that two sets are in different turing degrees exactly when they are not turing equivalent. furthermore, the turing degrees are partially ordered so that if the turing degree of a set x is less than the turing degree of a set y then any (noncomputable) procedure that correctly decides whether numbers are in y can be effectively converted to a procedure that correctly decides whether numbers are in x. it is in this sense that the turing degree of a set corresponds to its level of algorithmic unsolvability. the turing degrees were introduced by emil leon post (1944), and many fundamental results were established by stephen cole kleene and post (1954). the turing degrees have been an area of intense research since then. many proofs in the area make use of a proof technique known as the priority method. == turing equivalence ==  for the rest of this article, the word set will refer to a set of natural numbers. a set x is said to be turing reducible to a set y if there is an oracle turing machine that decides membership in x when given an oracle for membership in y. the notation x &le;t y indicates that x is turing reducible to y. two sets x and y are defined to be turing equivalent if x is turing reducible to y and y is turing reducible to x. the notation x &equiv;t y indicates that x and y are turing equivalent. the relation &equiv;t can be seen to be an equivalence relation, which means that for all sets x, y, and z: * x &equiv;t x * x &equiv;t y implies y &equiv;t x * if x &equiv;t y and y &equiv;t z then x &equiv;t z. a turing degree is an equivalence class of the relation &equiv;t. the notation [x] denotes the equivalence class containing a set x. the entire collection of turing degrees is denoted \mathcal{d}. the turing degrees have a partial order &le; defined so that [x] &le; [y] if and only if x &le;t y. there is a unique turing degree containing all the computable sets, and this degree is less than every other degree. it is denoted ''
Computability_theory Theory_of_computation