🚀 go-pugleaf

In article <1993Apr30.204926.6970@ast.saic.com>, hilljr@jupiter.saic.com (Jay R. Hill) writes:
|> 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.
...
|> 
|> 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 did not get in on GIPPP#3.  
...
There are a few cells which require very long computer run times still
available. We have seen runtimes from 1 minute to 6000 minutes on a 15MFlop
machine. That is the nature of the MSet. Some parts are easy, some hard.
If you have a fast machine available to run any of these special hard
cells, please email me directly. 

Of the 119 cells originally sent out, 77 are returned completed. The rest
are assigned except for these special ones. We had at least 41 different
people respond with about a dozen joining to late to get a cell. Some 
of you have a very fast machine and did not get a cell. If you do still
want to get in on this, let me know. 
|> 
|> |> When the 'smoke clears' in a week or two or three, we'll have an
|> |> area estimate.  Your contributations will be logged and acknowledged.
|> |> 
|> |> Jay Hill
|> |> Yuval Fisher
 
Thank you all for helping with GIPPP#3
 
Jay 'Not tonight honey, I have a 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);}