🚀 go-pugleaf

Re:GIPPP#3 paper now available.
In article <1993May14.214702.29442@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.
|>  ...
Only a week or two to go.  Of the 119 cells originally sent out, 105 are 
returned completed.  Thanks.   A paper (post script) describing the method
and preliminary results is now available at mset@kepler.ucsd.edu. Just
email the word 

paper

and "Bounding the Area of the Mandelbrot Set" by Yuval Fisher and Jay Hill
will be sent to you by email.  We give results of a test run to depth 17
(thank you Bill Broadley <Broadley@neurocog.lrdc.pitt.edu>).  The 
Grand Internet Parallel Processing Project (GIPPP#3) is collecting
calculations by at least 38 subscribers to the net. These calculations
make an area estimation to depth 19 (equivalent to 4^19 pixels). We now
know the upper bound is less than pi/2 and the lower bound is greater 
than 1.503.  I estimate there are about 1000 million million floating
point operations in this calculation on more than 50 machines.  With
lightning stopping two sites from completing their cells,  several
sites having fingers applied to the big red button, and SysAdmin types
trying to maintain machine idleness :-), it's been an interesting project.

Thanks again for all who have or tried to participate.  Only 14 cells to
go.  It has been just one month, not too bad.

|> Thanks,  Jay Hill    Yuval Fisher
 
Jay 'Not tonight honey, I have a bifurcating fractal' Hill
-- 
{ 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);} /* 9 billion digits of pi, anyone? */