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).

Philosophers who discussed Turing degree

• Gottfried Wilhelm Leibniz
• Hilary Putnam

Related ideas

• 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

Place in the tradition

Part of Outline of logic.

Explore Turing degree in the interactive graph →