Computability and the Halting Problem: Scooping the Loop Snooper

Since we proved the uncomputability of the halting problem in class, I thought I'd share a version of the proof I particularly enjoyed - one written entirely in the poetic style of Dr. Seuss.  It's called "Scooping the Loop Snooper" and it uses the same argument we covered in class.

There's also an extra stanza, which I found here:

Or so you might think… but before you get smug,
There’s one last loop to throw you for, speaking of bugs.
It’s a Turing tape parade so I hate it to rain,
But the whole preceding argument applies to your brain!