El Jue 01 Oct 2009 20:33:37 Paul D. Buck escribió: > On Oct 1, 2009, at 3:48 PM, Nicolás Alvarez wrote: > > El Jue 01 Oct 2009 10:41:16 john.mcl...@sybase.com escribió: > >> Redundancy of 2 catches essentially ALL random errors Given the > >> current > >> number of computers, it would be more than a millennium before a > >> single > >> undetected random error was missed - assuming that there were only > >> 128 bits > >> of output / task. > > > > "Number is prime" is a 1-bit output. > > Depends on how you search ... if you issue one number and divide down > then you have a one bit return > > If you issue a range to search , using sieve for example, then the > number(s) have/has to be returned.
"Number is prime" is *not* the result of a sieve. It's the result of a prime test on an individual number. And that's not the point anyway. I just showed there is one kind of app where there *is* a 1-bit output. -- Nicolas _______________________________________________ boinc_dev mailing list boinc_dev@ssl.berkeley.edu http://lists.ssl.berkeley.edu/mailman/listinfo/boinc_dev To unsubscribe, visit the above URL and (near bottom of page) enter your email address.
