OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

High (computability)

 Home Mathematics Fields of mathematics Mathematical logic Mathematical logic stubs
 0 By others on same topic  0 Discussions  1970-01-01  See my version
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.

 Ancestors (5)

  1. Mathematical logic stubs
  2. Mathematical logic
  3. Fields of mathematics
  4. Mathematics
  5.  Home

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook