![]() |
This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these template messages)
|
Incomputability 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 disgeneralized high n if its n'th jump is the n'th jump of the join of d with 0′.
![]() | This mathematical logic-related article is a stub. You can help Wikipedia by expanding it. |