home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.theory
- Path: sparky!uunet!charon.amdahl.com!pacbell.com!ames!agate!doc.ic.ac.uk!aixssc.uk.ibm.com!yktnews!admin!flu!lowry
- From: lowry@watson.ibm.com (Andy Lowry)
- Subject: Re: Cryptography and P=NP
- Sender: news@watson.ibm.com (NNTP News Poster)
- Message-ID: <LOWRY.92Nov17131906@rotor.watson.ibm.com>
- In-Reply-To: clong@remus.rutgers.edu's message of 16 Nov 92 21:59:47 GMT
- Date: Tue, 17 Nov 1992 18:19:06 GMT
- Disclaimer: This posting represents the poster's views, not necessarily those of IBM
- References: <1992Nov15.110945.19939@ringer.cs.utsa.edu> <15115@ember.UUCP>
- <Nov.16.16.59.47.1992.6436@remus.rutgers.edu>
- Nntp-Posting-Host: rotor.watson.ibm.com
- Organization: IBM T.J. Watson Research Center
- Followup-To: comp.theory
- Lines: 9
-
- In article <Nov.16.16.59.47.1992.6436@remus.rutgers.edu> clong@remus.rutgers.edu (Chris Long) writes:
- > Both are unproven, but there are *very* strong reasons for
- > believing them to be true. So strong that anyone who believes
- > otherwise must be either ignorant or a crackpot.
-
- Who better to make a breakthrough discovery than an ignorant crackpot?
- --
- Andy Lowry, lowry@watson.ibm.com, (914) 784-7925
- IBM Research, P.O. Box 704, Yorktown Heights, NY 10598
-