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 you might work till you drop,
you can’t predict whether a program will stop.
Filed under: English, Second-hand blogging, TASP, Tech
