Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sdd.hp.com!zaphod.mps.ohio-state.edu!samsung!uunet!super!mfb
From: mfb@super.ORG (Michael F. Bridgland)
Newsgroups: comp.theory
Subject: Re: P=NP message in sci.math
Message-ID: <33664@super.ORG>
Date: 21 Sep 90 13:47:48 GMT
References: <1990Sep17.180646.14346@watdragon.waterloo.edu>
Sender: news@super.ORG
Distribution: comp
Organization: Supercomputing Research Center, Bowie, Md.
Lines: 27


The rumor (from thefool@athena.mit.edu) was:

    rumors are flying around MIT that P=NP is about to be solved.
    the team of Gamburd/Rota seems to have solved an important precursor to the
    problem.
    Gamburd, who is an undergraduate, estimates that P=NP will be solved in a 
    month and that he will get the Fielding medal at the age of 21.

    -- michael de la maza     thefool@athena.mit.edu   horse@ai.mit.edu

and one of the followups (from bs@linus.mitre.org) was:

    Let me throw water on this rumor. 

    I just got off the telephone with Rota. He denies any and all knowledge
    of the above and claims that he is not even working on the problem.

    I hope that the MIT undergrad who posted this will refrain from making up
    wild rumors in the future.

    --

    Bob Silverman


Mike Bridgland
mfb@super.org