No general procedure for bug checks 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 cannot tell if computation will stop.
A poetic proof of the Halting Problem’s undecidability by one Geoffrey Pullum, continued here. Enjoy!
No general procedure for bug checks 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 cannot tell if computation will stop.
A poetic proof of the Halting Problem’s undecidability by one Geoffrey Pullum, continued here. Enjoy!