Programming style proof of The Halting Problem
This is an attempt at creating a proof to illustrate Alan Turing's work on determining that The Halting Problem is undecidable. The syntax for the proof is JS, but it could be done in any programming language that supports functions.
Here's some information on what the Halting Problem is.