Codex Wiki OurBigBook logoOurBigBook.comSite Source code

Halting problem

The halting set is computably enumerable but undecidable, and its complement is not computably enumerable.

Ancestors (6)

  1. Computably enumerable language
  2. Formal language theory
  3. Foundations of mathematics
  4. Area of mathematics
  5. Mathematics
  6. Home

Incoming links (2)