Possibly some of you are familiar with McCarthy's "91 function" and Takeuchi's function - Gabriel [1985] had used several variants of the latter in checking the performance of Lisp systems.
To be sure, neither of these functions is of any practical importance; yet, both functions are quite instructive and make excellent examples for exploring recursion. So, I'd be interested to know - in terms of performance - how much we have progressed in the last 25+ years. The only rule of this amicable contest is that you do it on an SGI box. Otherwise, use any language you are most familiar with [whether compiled or interpreted]. Just state your timings and environment. However, for better comparison, if you try Takeuchi, call it with (18,12,6) - the result should be 7.
To be sure, neither of these functions is of any practical importance; yet, both functions are quite instructive and make excellent examples for exploring recursion. So, I'd be interested to know - in terms of performance - how much we have progressed in the last 25+ years. The only rule of this amicable contest is that you do it on an SGI box. Otherwise, use any language you are most familiar with [whether compiled or interpreted]. Just state your timings and environment. However, for better comparison, if you try Takeuchi, call it with (18,12,6) - the result should be 7.
_________________
For aliens we're aliens.