[sci.math] Unproven results

franka@mmintl.UUCP (Frank Adams) (04/02/88)

In article <11440@duke.cs.duke.edu> srt@duke.UUCP (Stephen R. Tate) writes:
>Lastly, I hope that if you're doing work using unproven hypotheses
>(even something as plausable as the RH) that you're not working on
>something critical...

Well, there's a lot of rather critical stuff being done in cryptology on the
assumption that P != NP.  (Actually, it's worse than that, since factoring
is not known to be NP complete.)
-- 

Frank Adams                           ihnp4!philabs!pwa-b!mmintl!franka
Ashton-Tate          52 Oakland Ave North         E. Hartford, CT 06108