Concept
Turing degree

Overview
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.
Overview adapted from Wikipedia (CC BY-SA 4.0; see the article history for authors).
Connections in the graph
These are recorded graph connections, not independently reviewed claims of influence, agreement, opposition or classification.
- Outline of logic
- Gottfried Wilhelm Leibniz
- Hilary Putnam
- Journal of Symbolic Logic
- Alan Turing
- If and only if
- Computability theory
- Mathematical logic
- Natural number
- Partially ordered set
- Bulletin of the American Mathematical Society
- Theory (mathematical logic)
- Emil Leon Post
- Bijection
- Elsevier
- Computer science
- Boolean algebra
- Cambridge, Massachusetts
- Countable set
- MIT Press
- Decision problem
- Equivalence relation
- Empty set
- Post's theorem