Turing degree

(computer science, logic) A measure of the level of algorithmic unsolvability of the decision problem of whether a given set of natural numbers contains any given number.