Call for participants
in [Math]
|
Prev: How Can ZFC/PA do much of Math - it Can't Even Prove PA isConsistent(EASYPROOF)
Next: How Can ZFC/PA do much of Math - it Can't Even Prove PA isConsistent(EASYPROOF)
From: Pubkeybreaker on 3 Jul 2010 10:37 The NFS(a)Home project is moving towards factoring larger numbers. This is a call for participants. Visit: http://escatter11.fullerton.edu/nfs/
From: Tom St Denis on 9 Jul 2010 14:42 On Jul 3, 10:37 am, Pubkeybreaker <pubkeybrea...(a)aol.com> wrote: > The NFS(a)Home project is moving towards factoring larger numbers. > > This is a call for participants. Visit: > > http://escatter11.fullerton.edu/nfs/ No offense, but stop. This is really pointless busywork at this point. If they were using the cycles to develop a new factoring algorithm I'd be all for it, but you of all people should know that we [humanity] have bounded [more or less] the GNFS and NFS fairly well. Spending more cycles to prove that a computer today is faster than a computer yesterday is nothing but a waste of electricity. If you want to spend cycles try donating to folding(a)home or whatever ... Tom
From: Pubkeybreaker on 9 Jul 2010 17:00 On Jul 9, 2:42 pm, Tom St Denis <t...(a)iahu.ca> wrote: > On Jul 3, 10:37 am, Pubkeybreaker <pubkeybrea...(a)aol.com> wrote: > > > The NFS(a)Home project is moving towards factoring larger numbers. > > > This is a call for participants. Visit: > > >http://escatter11.fullerton.edu/nfs/ > > No offense, but stop. This is really pointless busywork at this > point. The Cunningham project is the longest on-going computation project in history. It would be nice to finish it.
From: Tom St Denis on 11 Jul 2010 10:55 On Jul 9, 5:00 pm, Pubkeybreaker <pubkeybrea...(a)aol.com> wrote: > On Jul 9, 2:42 pm, Tom St Denis <t...(a)iahu.ca> wrote: > > > On Jul 3, 10:37 am, Pubkeybreaker <pubkeybrea...(a)aol.com> wrote: > > > > The NFS(a)Home project is moving towards factoring larger numbers. > > > > This is a call for participants. Visit: > > > >http://escatter11.fullerton.edu/nfs/ > > > No offense, but stop. This is really pointless busywork at this > > point. > > The Cunningham project is the longest on-going computation project in > history. It would be nice to finish it. Are they looking to develop new algorithms or merely burn more cycles? My complaint is mostly along the lines of it's a poor use of electricity [which in turn creates more demand for generation and pollution]. If I run a for loop from 1 to 2^50 I will have counted to 2^50, but will have I learned? Tom
From: Kristian Gj�steen on 11 Jul 2010 12:39
Tom St Denis <tom(a)iahu.ca> wrote: >On Jul 9, 5:00�pm, Pubkeybreaker <pubkeybrea...(a)aol.com> wrote: >> The Cunningham project is the longest on-going computation project in >> history. �It would be nice to finish it. > >Are they looking to develop new algorithms or merely burn more >cycles? My complaint is mostly along the lines of it's a poor use of >electricity [which in turn creates more demand for generation and >pollution]. > >If I run a for loop from 1 to 2^50 I will have counted to 2^50, but >will have I learned? For this particular loop, the factorizations of a bunch of interesting numbers. Type "the cunningham project" into a search engine. -- kg |