Submitted by gil on Sat, 02/12/2011 - 6:00pm http://www.lel.ed.ac.uk/~gpullum/loopsnoop.html A poetic proof of the undecidability of the halting problem. Tags computer science