Codex Wiki OurBigBook logoOurBigBook.comSite Source code

Distinct representative of the halting many-one degree

If , then
(40)
differs from , while the computable map proves .

Ancestors (9)

  1. Many-one completeness of the halting problem
  2. Diagonal halting set
  3. Halting problem
  4. Computably enumerable language
  5. Formal language theory
  6. Foundations of mathematics
  7. Area of mathematics
  8. Mathematics
  9. Home

Incoming links (1)