TASP - Computer Science edition
Posted in English, Second-hand blogging, TASP, Tech on April 24, 2007 | No Comments »
Another TASP, another proof by contradiction. This one was found on the mathematics & computer blog QED (in Dutch).
Scooping the Loop Snooper - an elementary proof of the undecidability of the halting problem
No program can say what another will do.
Now, I won’t just assert that, I’ll prove it to you:
I will prove that although [...]
