Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03637734n
Noun Concept
Categories: Theory of computation, Computability theory, Alan Turing
EN
Turing degree  degree of unsolvability  degrees of unsolvability  Post's problem  Post problem
EN
In computer science and mathematical logic the Turing degree or degree of unsolvability of a set of natural numbers measures the level of algorithmic unsolvability of the set. Wikipedia
Definitions
Relations
Sources
EN
In computer science and mathematical logic the Turing degree or degree of unsolvability of a set of natural numbers measures the level of algorithmic unsolvability of the set. Wikipedia
A measure of the level of algorithmic unsolvability of the decision problem of whether a given set of natural numbers contains any given number. Wiktionary
NAMED AFTER
Turing
Wikipedia
EN
Turing degree
Wikidata
EN
Turing degree
Wiktionary
EN
Turing degree
Wikipedia Redirections
EN
degree of unsolvability, degrees of unsolvability, Post's problem, Post problem, priority argument, priority method, Recursively enumerable Turing degree, T-degree, T degree, Turing degrees, Turing equivalence (recursion theory)
Wikidata Alias
EN
degree of unsolvability, degrees of unsolvability, Turing degree of unsolvability, Turing degrees of unsolvability, unsolvability (mathematical logic)

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License