Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03875325n
Noun Concept
Categories: Mathematical logic stubs, Computability theory
EN
high
EN
In computability theory, a Turing degree [X] is high if it is computable in 0′, and the Turing jump [X′] is 0′′, which is the greatest possible degree in terms of Turing reducibility for the jump of a set which is computable in 0′. Wikipedia
English:
computability
Definitions
Sources
EN
In computability theory, a Turing degree [X] is high if it is computable in 0′, and the Turing jump [X′] is 0′′, which is the greatest possible degree in terms of Turing reducibility for the jump of a set which is computable in 0′. Wikipedia
A quality of a Turing degree, in computability theory Wikipedia Disambiguation
Wikipedia
EN
high (computability)
Wikidata
EN
high

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