Recursive implementation of Fibonacci in main.cc, in O(2^N).
Recursive implementation of Fibonacci in main.cc, in O(2^N).

With this implementation, computing F(35) takes several seconds on a 2+ GHz CPU.

This allows to experiment with the efficiency of the VM.

ggutierrez/mozart2css,miavisa/Mozart2-vm-old