PhiloWikiGraph

Concept

Turing degree

Illustration: Rehasse
Illustration: “Rehasse”, a related picture, not the idea itself. CMummert · Public domain · source

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.

Explore Turing degree in the interactive graph →

Suggest a correction

Quick graph

Open the full graph