Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!seismo!rutgers!mit-eddie!genrad!decvax!mcnc!duke!ola
From: ola@duke.UUCP (Owen L. Astrachan)
Newsgroups: sci.math
Subject: Re: P = NP
Message-ID: <8884@duke.duke.UUCP>
Date: Sun, 23-Nov-86 22:58:54 EST
Article-I.D.: duke.8884
Posted: Sun Nov 23 22:58:54 1986
Date-Received: Mon, 24-Nov-86 22:57:31 EST
References: <1953@emory.UUCP> <269@mipos3.UUCP>
Reply-To: ola@duke.UUCP (Owen L. Astrachan)
Distribution: na
Organization: Le Klatsch de Fermat et Cook @ duke
Lines: 25
Keywords: P=NP, computability, 8-)

In article <269@mipos3.UUCP> ekwok@mipos3.UUCP (Edward C. Kwok) writes:
>In article <1953@emory.UUCP> cmb@emory.UUCP (Chang Bang) writes:
>>I heard a rumor that somebody in the west coast proved
>>P = NP.  I would like to get a preprint of the proof or
>>any information for the rumor.
>
>Me too!!!!!!!!!!!!!!!!!!!!

A small but productive and insightful group of graduate students here at
Duke have discovered a wonderful proof that the question "P=NP?" is, in
fact, computable.

Unfortunately, the margins of our editor are too small to contain this
marvelous proof.

Before requesting a "preprint" via email please be sure that you understand
exactly what is being proved here.  I would like to mention the co-authors
(and  fellow travellers) Albert Nigrin and Paul Lanzkron who helped simplify
the proof considerably.

-- 
Owen L. Astrachan, Dept.of Computer Science, Duke University, 
Durham NC 27706  Phone (919)684-5110 Ext. 29
CSNET: ola@duke        UUCP: {ihnp4!decvax}!duke!ola
ARPA:  ola%duke@csnet-relay