[Shootout-list] fibonacci and ackermann

[Sebastien Loisel]

I personally prefer Ackermann because it is less likely to be memoized
by a smartypants compiler. Purely functional, shmurely shmunctional.

On Apr 3, 2005 6:55 PM, Robert Seeger <rhseeger@gmail.com> wrote:
> It occurred to me today that the Fibonacci and Ackermann tests are
> testing the exact same thing. They both measure the speed of recursive
> function performance, specifically with integers.
> 
> Is there a reason that both tests need to exist? It seems to me that
> the Fibonacci test measures everything that Ackermann does, while not
> having the liability of running up against the recursion limit of some
> languages (which, it is my understanding, is not something the
> Shootout is designed to test).
> 
> Rob Seeger
> 
> _______________________________________________
> Shootout-list mailing list
> Shootout-list@lists.alioth.debian.org
> http://lists.alioth.debian.org/mailman/listinfo/shootout-list
>