Does Python really follow its philosophy of "Readability counts"?

Steven D'Aprano steven at
Thu Jan 22 09:24:10 CET 2009

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.


More information about the Python-list mailing list