14 Oct
2012
14 Oct
'12
5:12 p.m.
pi has maximal Kolmogorov complexity. But rational approximations to pi don't. Is there some way to define the minimum algorithm for computing pi to say N decimal places. And if so, what is the length of the algorithm as a function of N? Brent Meeker On 10/14/2012 3:53 PM, Stuart Errol Anderson wrote:
Continued fraction of ln(pi^7) leads to an approximation of pi as e^87/76 = 3.1416, and C.F. ln(pi^19) gives e^41129/35929 = 3.14159264.
Also iteration of a complex number near Seahorse Valley (Mandelbrot Set) can be used to approximate pi _______________________________________________ math-fun mailing list math-fun@mailman.xmission.com http://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun