A Morpho-Recursive Function for Pi
I'm working on building a little video (still!) to explain how I came up with a method that borrows a bit from recursive function theory to build a method for generating pi by iteratively building a recursive method, which morphs at first, and then eventually stabilizes to generate an n sided polygon. As each iteration goes forth, n increases, doubling the number of sides of an n- sided polygon, until the sides get so small that it "smooths" out the perception of a circle - which is interesting because after the 5 th iteration, the function "stabilizes", and smooths out, making the incremental change between values of pi get smaller, but pi itself gets more precise to the "true" value of pi itself. The problem with this method computationally is that computers start "blowing up" because the sides approach a value of 0, but cannot actually get there. But, from a computer's point of view, these sides might as well be zero. The sides ...