home *** CD-ROM | disk | FTP | other *** search
- Xref: sparky sci.math:15377 sci.physics:19422
- Newsgroups: sci.math,sci.physics
- Path: sparky!uunet!cs.utexas.edu!tamsun.tamu.edu!snorkelwacker.mit.edu!galois!riesz!jbaez
- From: jbaez@riesz.mit.edu (John C. Baez)
- Subject: Re: RSA Encryption
- Message-ID: <1992Nov22.224208.12455@galois.mit.edu>
- Keywords: cryptography, primes
- Sender: news@galois.mit.edu
- Nntp-Posting-Host: riesz
- Organization: Department of Mathematics, Smogville, USA
- References: <avatarp.722363576@well.sf.ca.us> <1992Nov22.011016.6268@CSD-NewsHost.Stanford.EDU>
- Date: Sun, 22 Nov 92 22:42:08 GMT
- Lines: 24
-
- 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.
-
- Of course, this assumes the world's future is deterministically
- predictable, which it's not, thanks to quantum mechanics. (Please
- folks, don't mention chaos. I'm sick of it.) I leave it as an exercise
- for the reader to ponder what corrections need to be made to my previous
- paragraph to take quantum mechanics into account.
-
-
-