On Thu, Feb 07, 2008 at 10:36:35PM -0500, Mark Schoonover wrote:
Note: I researched the Ackerman function on Wikipedia. Interesting function to say the least. According to SICP, when (= x 0) (* 2 y), but according to the defn, when (= x 0) (+ 1 y). Am I missing something?
CISP's coding of Ackermann is not the standard one, although it still does the right amount of excess recursion, which is what Ackermann's intent was. The SICP one ends up with a lot bigger numbers, though. Ok, Um, a _lot_ bigger. Which scheme implementation are you using? Does it support big numbers? David -- [email protected] http://www.kernel-panic.org/cgi-bin/mailman/listinfo/kplug-lpsg
