Linked from

The 32 pages that link to Halting problem, each with the reason it gives.

• Computable setCompared with: Its undecidability shows why a membership procedure must halt by design, not merely when it finds a witness.

• Blum axiomsCompared with: The axioms do not make halting decidable; they require agreement between two possibly partial domains.