🚀 go-pugleaf

In article <1993Apr27.184408.10491@ast.saic.com>, hilljr@jupiter.saic.com (Jay R. Hill) writes:
|> Hello Netters,
|> 
|> We'd like to ask for your help (actually your CPU's help) in doing
|> a large scale parallel computation. This computation will give
|> upper and lower bounds on the area of the Mandelbrot set.
 ...
|> The mail server mset@kepler.ucsd.edu can send you 
...
|> 
|> To get a piece of the action (a segment to compute) send email to
|> mset@kepler.ucsd.edu.  The message should have the word "join",

Please no more 'join'  since the cells are all assigned. For some reason
the deamon will now send out cell #48 again, which has already been
assigned. If you want to experiment with #48, feel free. Just, please
do not send in the result to the  mset@kepler.ucsd.edu account.

Thank you for the overwhelming response. Many machines are expected to be
continuing the calculation for a week or two. Then we can all see the
result.  Don't feel left out if you didnot get in on GIPPP#3.  The
independant and fundamentally different approach to the Mandelbrot
Set area calculation known as GIPPP#2 (Robert P. Munafo - 
mrob@world.std.com) is still waiting to be run.

|> When the 'smoke clears' in a week or two or three, we'll have an
|> area estimate.  Your contributations will be logged and acknowledged.
|> 
|> Thanks,
|> 
|> Jay Hill
|> Yuval Fisher
|> 

Jay
-- 
{ hilljr@jupiter.saic.com } begin writeln(3*ln(640320)/sqrt(163):17:15) end.
void main(){double sqrt(), y=1/sqrt(2.), a=.5, m=1,z; int n=0;
for(;m*=2,z=sqrt(1-y*y),y=(1-z)/(1+z),a=a*(1+y)*(1+y)-m*y,n<3;n++);
printf("%17.15lf\n",1/a);}