Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!solo.csci.unt.edu!ponder.csci.unt.edu!ian
From: ian@ponder.csci.unt.edu (Ian Parberry)
Newsgroups: comp.ai.neural-nets
Subject: Re: Travelling Salesman problem
Message-ID: <1991Apr16.232447.14364@solo.csci.unt.edu>
Date: 16 Apr 91 23:24:47 GMT
Sender: usenet@solo.csci.unt.edu (Usenet News)
Organization: University of North Texas, Denton
Lines: 20

>>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.

[For those who don't keep up with either Computer Science or Mathematics,
the Fields medal is to Mathematics what the Nobel prize is to Science.
The Turing award is to Computer Science what the Fields medal is to
Mathematics. To a first approximation.]
____
Ian Parberry  ian@dept.csci.unt.edu  Dept. of Computer Science,
Univ. of North Texas, P.O. Box 13886, Denton, TX 76203-3886
"Bureaucracy is expanding to meet the needs of an expanding bureaucracy"