Computably inseparable
Summary
In computability theory, two disjoint sets of natural numbers are called computably inseparable or recursively inseparable if they cannot be "separated" with a computable set. These sets arise in the study of computability theory itself, particularly in relation to classes. Computably inseparable sets also arise in the study of Gödel's incompleteness theorem.
Further reading
- Wikipedia, page 26004614, revision 1298641139, Computably inseparable. adopted
About this page
| Tag | 1HXBZNJQDX |
|---|---|
| URI | m2://1HXBZNJQDX |
| Aliases | computably-inseparable-sets, effectively-inseparable, effectively-inseparable-sets, effectively-separable, effectively-separable-set, effectively-separable-sets, recursive-inseparability, recursively-inseparable, recursively-inseparable-sets, recursively-separable, recursively-separable-sets |
| 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.