Dear all,

At Julia site (http://julialang.org/) they placed the results 

of a battery of small performance tests. The test scripts

are referenced in the citation below:

"

we’ve written a small set of micro-benchmarks in a variety of

 languages:  C ,  Fortran ,  Julia ,  Python ,  Matlab/Octave ,  R ,  JavaScript ,  Java ,  Lua ,  Go , and  Mathematica .

"

I began to translate R code into gretl to do the same battery

of tests for Gretl. The script attached.

The firs test is about recursion: compute

Fibonacci numbers.

Either, I wrote very inefficient code, or

recursion in Gretl is very slow and needs amending.

The attachment also contains non-recursive script

for Fibonacci numbers. It works several thousands

 times faster ( 172092 times on my pc) .

Oleh