[Shootout-list] fibonacci and ackermann

[Robert Seeger]

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