Article View: sci.crypt
Article #4137Re: Fermat's Last Theorem apparently proven
From: td
Date: Tue, 15 Mar 1988 14:19
Date: Tue, 15 Mar 1988 14:19
9 lines
971 bytes
971 bytes
> The proof of the running time cannot >show that the algorithm will always stop in polynomial time unless the RH >is known to be true. This also has practical considerations -- what if >there are times when the algorithm will not stop? Then you sit there >waiting and waiting for your primality certificate that will never come. personally, i wouldn't sit waiting and waiting. as soon as the run-time exceeded the bound implied by the Reimann Hypothesis, i'd start writing up my proof of ~RH.
Technical Details
Message-ID:
<7738@alice.UUCP>Path:
arc1-ca.pugleaf.net!utzoo!mnetor!uunet!husc6!mailrus!umix!umich!mibte!gamma!ulysses!andante!alice!tdReferences:
<977@thumper.bellcore.com> <7440@brl-smoke.ARPA> <26797@linus.UUCP> <11288@duke.cs.duke.edu>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!mnetor!uunet!husc6!mailrus!umix!umich!mibte!gamma!ulysses!andante!alice!td From: td@alice.UUCP Newsgroups: sci.crypt Subject: Re: Fermat's Last Theorem apparently proven Message-ID: <7738@alice.UUCP> Date: 15 Mar 88 14:19:39 GMT References: <977@thumper.bellcore.com> <7440@brl-smoke.ARPA> <26797@linus.UUCP> <11288@duke.cs.duke.edu> Organization: AT&T Bell Laboratories, Murray Hill NJ Lines: 9 Summary: proof of Reimann Hypothesis