Re: What if all things computable are computable in polynomial time?

2003-08-07 Thread Billy
On Wed, Aug 06, 2003 at 09:49:36AM -0700, Major Variola (ret) wrote: At 01:18 AM 8/6/03 -0700, Eric Cordian wrote: An anonymous sender writes: Rely on math, not humans. What if all things computable are computable in polynomial time? You mean polynomials like O(n^10^10^10) ?

Re: What if all things computable are computable in polynomial time?

2003-08-06 Thread Major Variola (ret)
At 02:16 PM 8/6/03 -0700, Bill Stewart wrote: What if all things computable are computable in polynomial time? We wouldn't have to go back to OTP, just symmetric-key keyservers which people used before public-key became well-known. While the public-key algorithms are based on math problems like