Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03637734n
Noun Concept
SYL
No term available
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
Relations
Sources
NAMED AFTER
EN
Turing

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