---
tag: DKQG0X84D9
kind: concept
name: Low (computability)
sources:
  - wikipedia: en:9767106@r1350018931
    locator: Low (computability)
    note: adopted
    mention: wikipedia://en/9767106
    sections: [Summary]
same_as:
  wikidata: Q6692805
  wikipedia: Low (computability)
inventory: [G7RDZXC5TC]
---

## Summary

In computability theory, a Turing degree \[*X*\] is **low** if its Turing jump \[*X*′\] = 0′. A subset $S \subset \mathbb{N}$ is **low** if its Turing degree is low.