n
nicefa
.
Foundational Proof
The Halting Problem
The CS version of 'This sentence is a lie.' If the checker says it halts, it loops; if it loops, it halts. Logic breaks the machine.
Institutional Reference: Mathematical Discourse
View Full Proof →