If you're a computer scientist, then you've heard of the halting problem. If you're a mathematician or even a middle school geometer, then you've heard of proof by contradiction. If you're an English-speaking child, then you know Dr. Seuss. Put them together, and what do you get? An amazing Seuss-esque poetic proof of the undecidability of the halting problem, one of the most famous results in mathematics and computer science. Look here: http://ling.ed.ac.uk/~gpullum/loopsnoop.pdf . Wow.
No comments:
Post a Comment