Source: wikibot/turing-degree
= Turing degree
{wiki=Turing_degree}
In computability theory, a **Turing degree** is a measure of the level of non-computability of sets of natural numbers (or, more generally, of decision problems). It is a way to classify problems based on their inherent difficulty in terms of solutions that can be obtained by a Turing machine.