Turing Compliant?

[Aahz Maruch]

In article <7r2jdb$10fg$1 at buty.wanadoo.nl>, SorinRoke <chrisv at satl.com> wrote:
>> 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.

Really?  Mind sharing it?  I'm sure there are several people on this
newsgroup who'd love to borrow it.
--
                      --- Aahz (@netcom.com)

Androgynous poly kinky vanilla queer het    <*>      http://www.rahul.net/aahz/
Hugs and backrubs -- I break Rule 6  (if you want to know, do some research)