Mathematical logic and foundations Computability theory Concept
Turing degree
Summary
The Turing degree of a set of natural numbers is the class of all sets that are Turing equivalent to it. Two sets have the same degree when each is computable from the other, so the degree measures how uncomputable a set is. The degrees are partially ordered by Turing reducibility, and the study of this order is a central part of computability theory.
Where this leads
3 pages build on this one.
Further reading
About this page
| Tag | P5N2ND3VCG |
|---|---|
| URI | m2://P5N2ND3VCG |
| Kind | concept |
| Writing | W0 stub |
| MSC | 03D28, 03D30 |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.