Lesson plan
High (computability)
In computability theory, a Turing degree [X] is high if it is computable in 0 , and the Turing jump [ ] is 0 , which is the greatest possible degree in terms of Turing reducibility for the jump of a set which is computable in 0 . 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 .
Article summary
In computability theory, a Turing degree [X] is high if it is computable in 0 , and the Turing jump [ ] is 0 , which is the greatest possible degree in terms of Turing reducibility for the jump of a set which is computable in 0 . 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 .
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.