Re: Factoring integers on a classical computer

From: *** T. Winter (***.Winter_at_cwi.nl)
Date: 03/17/05

  • Next message: Craig Feinstein: "Re: Factoring integers on a classical computer" 
    Date: Thu, 17 Mar 2005 01:53:33 GMT

    In article <42385afd$0$560$b45e6eb0@senator-bedfellow.mit.edu> tchow@lsa.umich.edu writes:
    ...
    > But to call it a "fallacy" to think that a polytime algorithm for (a)
    > suggests the possible existence of a polytime algorithm for (b) is to
    > conflate rigorous proofs with speculation.

    The "fallacy" is not that it might suggest such a thing, the "fallacy"
    is that such a thing *should* be true. I am quite open to polytime
    algorithms for factoring, but what I do know about primality proving
    does not even come close to suggesting such a thing. 

    -- 
*** t. winter, cwi, kruislaan 413, 1098 sj  amsterdam, nederland, +31205924131
home: bovenover 215, 1025 jn  amsterdam, nederland; http://www.cwi.nl/~***/
  • Next message: Craig Feinstein: "Re: Factoring integers on a classical computer"
    • Quantcast