Feed on
Posts
Comments

Archive for April 24th, 2007

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 [...]

Read Full Post »