Turing degree

degrees of unsolvabilitypriority methoddegreedegree of unsolvabilityrecursively enumerable Turing degreeTuring equivalentTuring-equivalent
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
0 Related Articles
No Results Found!