Halting problem (undecidability) — The Number Path

Node

Halting problem (undecidability) (Theorem) in The Number Path. Era: 1936. Origin axiom of path: Peano's axioms. Modern reach: Incompleteness theorems · Computer science.

Links

• The Number Path
• Theorem: Halting problem (undecidability)
• Alan Turing

Explore

• Dashboard
• Theorems
• Frameworks
• Lineage
• People