Sorry, I'll translate:

Recursion seems to behave funny in a normal-optimized Pike.

I run the test I wrote earlier on 1) my valgrind-deoptimized Pike and 2) my normal optimized one:

test 1) 2) Pike start overhead........ 0.000s 0.000s Ackermann.................. 1.172s 0.576s Array & String Juggling.... 0.693s 0.636s Compile.................... 1.393s 1.010s Compile & Exec............. 1.383s 1.018s Matrix multiplication...... 0.968s 0.407s Loops Nested............... 0.762s 0.292s Loops Recursed............. 1.090s 1.625s <-

Why is the normal one *that* slow?

The funniest of it all is that Ackermann isn't slow at all.