Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!think.com!linus!agate!ucbvax!bloom-beacon!eru!hagbard!sunic!mcsun!hp4nl!fwi.uva.nl!smagt
From: smagt@fwi.uva.nl (Patrick van der Smagt)
Newsgroups: comp.ai.neural-nets
Subject: Re: Travelling Salesman problem
Message-ID: <1991Apr17.080130.15000@fwi.uva.nl>
Date: 17 Apr 91 08:01:30 GMT
References: <1991Apr16.232447.14364@solo.csci.unt.edu>
Sender: news@fwi.uva.nl
Organization: FWI, University of Amsterdam
Lines: 17
Nntp-Posting-Host: chris.fwi.uva.nl

ian@ponder.csci.unt.edu (Ian Parberry) writes:

>>>The first person to SOLVE tsp earns the Nobel prize for maths, I'm sure.
>>
>>
>>	If I'm not mistaken, I believe there is no Nobel prize for
>>Mathematics, (rumor has it that Nobel's wife ran off with a
>>mathematician).

>The person who (sic) "solves" TSP (which I take as meaning the person
>who proves that P is not equal to NP, or otherwise), would probably
>be in line for the Turing award.  I don't know if the Fields medal
>committee considers theoretical computer science as mathematics.

No, quite convinced.  Would earn the Nobel prize for maths.

						Patrick