[Shootout-list] Re: ackermann, fibonacci and takfp benchmarks

[Aaron Denney]

On 2005-03-19, Daniel South <WildCard_25@HotMail.Com> wrote:
> This will of course impact the languages that had been optimising out
> the recursions, but the whole point is to test the cost of calling the
> function, not to test how well the compiler optimises.

"The cheapest function call is one the compiler can optimize away."
IOW, I think it's completely valid as is.

-- 
Aaron Denney
-><-