3 ms·
There are some questions though where the saved energy from not running the batch jobs is worth more than the answer (e.g. searching for the next prime).
by hueving 10y ago
There are some questions though where the saved energy from not running the batch jobs is worth more than the answer (e.g. searching for the next prime).
- dekhn 10y agoWe (google) ran numerous theory problems on Google's computing platform via the Exacycle program. Peter Norvig convinced me this was a bad idea, but mainly to say that time was better spent on disproving the conjecture using pure math, not search. http://norvig.com/beal.html http://norvig.com/beal.html "But Witold Jarnicki and David Konerding already did that: they wrote a C++ program that built a table of Cz(modp)Cz(modp) up to 5000500050005000 , and, in parallel across thousands of machines, searched for A,BA,B up to 200,000 and x,yx,y up to 5,000, but found no counterexamples. On a smaller scale, Edwin P. Berlin Jr. searched all CzCz up to 10171017 and also found nothing. So I don't think it is worthwhile to continue on that path."