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