Orchid XP v8 <voi### [at] devnull> wrote:
> What is Ackermann's function, why does it grow so fast, and why does 
> anybody care anyway?

  From a programmer's point of view, simplified: The Ackermann's function
is an example of a function which cannot be computed iteratively, but must
be computed recursively.

  This proves by example that not all algorithms can be implemented
iteratively.

  (And "iteratively" in this context means "only requires O(1) memory to
compute the algorithm".)

-- 
                                                          - Warp

Post a reply to this message