home *** CD-ROM | disk | FTP | other *** search
- Xref: sparky sci.math:15387 sci.physics:19443
- Path: sparky!uunet!olivea!charnel!sifon!thunder.mcrcim.mcgill.edu!snorkelwacker.mit.edu!galois!riesz!jbaez
- From: jbaez@riesz.mit.edu (John C. Baez)
- Newsgroups: sci.math,sci.physics
- Subject: Re: RSA Encryption
- Keywords: cryptography, primes
- Message-ID: <1992Nov23.012510.14142@galois.mit.edu>
- Date: 23 Nov 92 01:25:10 GMT
- References: <avatarp.722363576@well.sf.ca.us> <1992Nov22.011016.6268@CSD-NewsHost.Stanford.EDU> <1992Nov22.224208.12455@galois.mit.edu>
- Sender: news@galois.mit.edu
- Organization: MIT Department of Mathematics, Cambridge, MA
- Lines: 20
- Nntp-Posting-Host: riesz
-
- In article <1992Nov22.224208.12455@galois.mit.edu> jbaez@riesz.mit.edu (John C. Baez) writes:
- >In article <1992Nov22.011016.6268@CSD-NewsHost.Stanford.EDU> pratt@Sunburn.Stanford.EDU (Vaughan R. Pratt) writes:
- >
- >>Apropos of which, here is my proof that P=NP. (I came up with it
- >>around 1972, if you have an earlier source then it's not mine after
- >>all.) Computers double in speed every 18 months or so, whence any
- >>exponential time problem can be solved in linear time by waiting the
- >>requisite number of months for the problem to become solvable in one
- >>month and then starting the computation. This counts the waiting time,
- >>and has the additional advantage that you can use your computer on
- >>something else while waiting.
- >
- >Very interesting. Like Lewis Carroll's jokes, there is a real fact
- >lurking in this one. *If* the world's future was predictable in
- >polynomial time from initial data, and *if* P was not equal to NP, one
- >could use the contrapositive of Pratt's joke to prove that the rate of
- >speed of computers cannot double each 18 months or so forever.
-
- Whoops. One only needs that polynomial time is not equal to exponential
- time, not that P is not equal to NP. The former is known to be true.
-