Turing Compliant?
SorinRoke
chrisv at satl.com
Tue Sep 7 04:47:16 EDT 1999
Greg Ewing <greg.ewing at compaq.com> wrote in message
news:37D42AC0.5354FD48 at compaq.com...
> Kristopher Johnson wrote:
> >
> > But can Python efficently solve the Traveling Salesman Problem,
> > or other NP-complete problems?
Although I have this feeling I'm missing something here, I know there's a
pretty efficient way to solve this problem.
So, basically, what's the problem?
More information about the Python-list
mailing list