Areas Computability theory Topic
The c.e. degrees and the priority method
Summary
This topic is a part of computability theory. It covers the degrees of computably enumerable sets, Post's problem and the priority constructions that solved it, and the structure theory of the computably enumerable degrees.
About this page
| Tag | 30W9QGNV3D |
|---|---|
| URI | m2://30W9QGNV3D |
| Kind | topic |
| Writing | W0 stub |
| MSC | 03D25 |
| Part of | Computability theory |
| Changed | 17 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a same_as or a source (0 of 1)
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
History
Each change to this page, from its provenance log. A change by an agent names its run.
| Date | Change | Field | By |
|---|---|---|---|
| 2026-11-17 | add | the whole node | tamnd |
What links here
No page links to this page yet.