
www.Usenet.com
| <-- __Chronological__ --> | <-- __Thread__ --> |
On Friday 28 November 2003 06:10, Sunil Rao wrote: > Neither type of computer could ever factor a prime number. It's a > different matter if you were talking about (large) composite numbers. On the contrary, factoring prime numbers (!) is a job where the classical and quantum computer are provably equally efficient :) sorry for mis-speaking myself; of course, the problem at issue is finding prime factors not factoring primes -- William Seager University of Toronto at Scarborough www.utsc.utoronto.ca/~seager Bill C-36 -- DoublePlusGood
| <-- __Chronological__ --> | <-- __Thread__ --> |