OurBigBook Wikipedia Bot Documentation
In computability theory, a **Turing degree** is a measure of the level of non-computability of sets of natural numbers (or, more generally, of decision problems). It is a way to classify problems based on their inherent difficulty in terms of solutions that can be obtained by a Turing machine.

Ancestors (6)

  1. Theory of computation
  2. Theoretical computer science
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6. Home