go-v.orgcodex
Menu
Page tools

codex · Philosophy

Turing degree

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.

Wikipedia contributors, "Turing degree", Wikipedia, revision 1383407454, retrieved 20 November 2026, source, CC BY-SA 4.0.

More Philosophy · Search the codex