In computability theory, the Turing degree of a subset X of the natural numbers ω, is the equivalence class consisting of all subsets of ω equivalent to X under Turing reducibility. In other words, two sets of natural numbers have the same Turing degree when the question of whether a natural number belongs to one can be decided by a Turing machine having an oracle that can answer the question of whether a number belongs to the other, and vice versa. So the Turing degree measures precisely the computability or incomputability of X. Turing reducibility induces a partial order on the Turing degrees. The degree of a set X is denoted . The least element in the partial order is and is the degree of all recursive sets (computable sets).

For each Turing degree (say, to which a set X belongs), there is another degree, , which is greater than , constructed in the following way: choose (once and for all) a standard enumeration of all Turing machines having (the characteristic function of) X as an oracle, and form the set K^X of all n such that the n-th such machine halts (on the input n, but this doesn't matter very much). Then X is computable from this set K^X but the converse isn't true. We call (which depends only on and not on the choice of X having that Turing degree) the Turing jump of . For example, is the Turing degree of the usual halting problem.

A recursively enumerable Turing degree (computably enumerable Turing degree) is one containing a recursively enumerable set (computably enumerable set). The recursively enumerable Turing degrees under the partial order induced by Turing reducibility form an upper semi-lattice, having 0 as smallest element and as greatest element, and are an object that has been much studied by the logic community. One of the famous problems associated with the recursively enumerable degrees, known as Post's problem, is whether there exists such a degree which is not equal to 0 nor . It is now known that the answer is positive (and much more is known).