Turing Compliant?

Greg Ewing greg.ewing at compaq.com
Mon Sep 6 16:57:36 EDT 1999


Kristopher Johnson wrote:
> 
> But can Python efficently solve the Traveling Salesman Problem,
> or other NP-complete problems?

You need a Touring Complete language for that. This will have to
wait for Python 3.0 when Guido gets around to adding quantum 
computing opcodes. When that will happen is, of course, subject
to Heisenberg uncertainty.

Greg




More information about the Python-list mailing list