Low (computability)
Summary
In computability theory, a Turing degree [X] is low if its Turing jump [X′] = 0′. A subset is low if its Turing degree is low.
Further reading
- Wikipedia, page 9767106, revision 1350018931, Low (computability). adopted
About this page
| Tag | DKQG0X84D9 |
|---|---|
| URI | m2://DKQG0X84D9 |
| Kind | concept |
| Writing | W1 stated |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.