// Workers AI · dad joke modeIs high computability a tall order?
 | This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages)
|
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′.[1]
Similarly, a degree is high n if its n'th jump is the (n+1)'st jump of 0. Even more generally, a degree d is generalized high n if its n'th jump is the n'th jump of the join of d with 0′.
See also
[edit]References
[edit]- ↑ Soare, R. I. (1987). Recursively enumerable sets and degrees : a study of computable functions and computably generated sets. Berlin: Springer-Verlag. p. 71. ISBN 3-540-15299-7.
 | This mathematical logic–related article is a stub. You can help Wikipedia by adding missing information. |