The Halting Problem, in Verse: Scooping the Loop Snooper

Coat of arms of the University of Edinburgh, o...

Image via Wikipedia

Geoffrey K. Pullum, Professor of General Linguistics in the School of Philosophy, Psychology, and Language Sciences University of Edinburgh has written a marvelous verse, in the style of Dr. Suess, that explains the proof that the Halting Problem is undecidable in a clear and humorous way. The verse is called Scooping the Loop Snooper (PDF). If only all of Computational Theory were this easy to understand!

Please leave comments using the sidebar.