Observations on the Halting Problem
Eric C. R. Hehner
TL;DR
This paper critically examines the Halting Problem, arguing that it is fundamentally ill-conceived and ill-defined, challenging traditional assumptions in computability theory.
Contribution
It provides a novel critique of the Halting Problem, questioning its foundational assumptions and proposing a re-evaluation of its conceptual basis.
Findings
The Halting Problem is ill-conceived and ill-defined.
Traditional proofs of undecidability rely on questionable assumptions.
A re-examination of computability concepts is necessary.
Abstract
The Halting Problem is ill-conceived and ill-defined.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Algorithms and Data Compression · Cellular Automata and Applications