Epimenides, G\"odel, Turing: an Eternal G\"olden Tangle
Eric C. R. Hehner
TL;DR
This paper explores the deep connections between the Halting Problem, the Liar's Paradox, and foundational issues in logic and computation, highlighting their intertwined nature and implications.
Contribution
It offers a novel perspective linking classical paradoxes with computational undecidability, enriching understanding of logical and computational limits.
Findings
The Halting Problem is analogous to the Liar's Paradox.
Foundational paradoxes reveal intrinsic limits of formal systems.
Connections suggest new directions for logic and computation research.
Abstract
The Halting Problem is a version of the Liar's Paradox.
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 · Cellular Automata and Applications · DNA and Biological Computing