Turing degree

Measure of unsolvability

In computer science and mathematical logic the Turing degree (named after Alan Turing) or degree of unsolvability of a set of natural numbers measures the level of algorithmic unsolvability of the set.

From Wikipedia, under CC BY-SA. More on occurri.