High (computability)
Jump to navigation
Jump to search
Script error: No such module "Unsubst". In computability theory, a Turing degree [X] is high if it is computable in 0Template:Prime, and the Turing jump [Template:Prime] is 0Template:PrimeTemplate:Prime, which is the greatest possible degree in terms of Turing reducibility for the jump of a set which is computable in 0Template:Prime.[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 0Template:Prime.
See also
References
<templatestyles src="Reflist/styles.css" />
- ↑ Script error: No such module "citation/CS1".
Script error: No such module "Check for unknown parameters".