Re: [math-fun] "Utilizing Infinite Loops to Compute an Approximate Value of Infinity"
I've commented elsewhere that access to terabyte (& beyond) storage poses a problem: Simply accessing every single byte of a terabyte disk is a non-trivial exercise. Also, many storage & network devices consider an error rate of 1 in 10^12 quite acceptable, so you can't be sure that you've actually read all of these bytes correctly. Re incrementing integers: The usual method of incrementing bignums in Lisp (& many other interpreted languages) is terribly expensive, because it copies the entire bignum on each increment & then causes lots of garbage collections. This is one of the reasons why I investigated implementing bignums which were forced to have a reference count of one -- i.e., guaranteed to be unshared. Then you can "increment in place" & avoid copying. At 01:13 PM 6/15/2010, Paul Reiners wrote:
Kind of funny:
http://www-user.slac.stanford.edu/jimstan/Infinity.htm
The author should probably have tried using an Amiga 500, rather than a Commodore 64, though.
participants (1)
-
Henry Baker