News for hackers. Stuff that matters.
Re:Nearly all binary search and merge sort implementations a... by wisty on Tuesday January 31, 2012 @02:20AM (#3532242)
It depends on the scope of the proof. It's sloppy to say "this is proved to be correct". They should say "this is proved to be terminate with output X in a finite time, for input values in the range -Y:Y".

Everything can be proved to be "correct", for some definition of "correct" (i.e. "output undefined, program may not terminate").

There are no comments on this comment yet.