The paper presents a formalization of Turing's proof of the unsolvability of the Halting Problem using M routines, revealing nine program transformations that lead to inherent inconsistencies. It demonstrates that if a program could determine halting, it would create contradictions when applied to itself. The author provides an M routine that generates lists of solvable and unsolvable problems, including the Halting Problem and other notable theorems.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0 ratings0% found this document useful (0 votes)
12 views5 pages
A Simple Generator of Incompleteness Theorems
The paper presents a formalization of Turing's proof of the unsolvability of the Halting Problem using M routines, revealing nine program transformations that lead to inherent inconsistencies. It demonstrates that if a program could determine halting, it would create contradictions when applied to itself. The author provides an M routine that generates lists of solvable and unsolvable problems, including the Halting Problem and other notable theorems.