On Wed, 21 Jan 2009 12:55:42 -0500, Luis Zarrabeitia wrote: > Btw, the correctness of a program (on a turing-complete language) cannot > be statically proven. Ask Turing about it.
The correctness of *all* *arbitrary* programs cannot be proven. That doesn't mean that no programs can be proven. -- Steven -- http://mail.python.org/mailman/listinfo/python-list