High (computability)
= High (computability)
{wiki=High_(computability)}
In the context of computability theory, "high" is a term used to describe a particular kind of Turing degree that is above a certain threshold of complexity. Specifically, a Turing degree is considered "high" if it can compute all recursive sets and also has the ability to compute a nontrivial amount of \$\\Delta^0_2\$ sets.