Matt McCutchen wrote:
> If you want to talk about correctness of algorithms, there is a notion
> of "negligible" (less than inverse polynomial) probability of failure
> that can be used. In the real world, you are not doing yourself any
> measurable good by professing to go after this risk which is orders of
> magnitude smaller than all the others you face every day.
I'm a mathematician, for me there's no such thing as a "negligible" failure
probability. The probability of failure is either zero (i.e. the algorithm
works) or not (i.e. the algorithm doesn't work). Using an algorithm which
doesn't work is unacceptable.
Kevin Kofler
--
devel mailing list
devel@xxxxxxxxxxxxxxxxxxxxxxx
https://admin.fedoraproject.org/mailman/listinfo/devel
