Daniel0

Well all seems logical, but the one bit that is bothering me is that algorithm. How does it randomly pick a value from the predefined list ??

It isn't random. It's pseudorandom. Given the same seed, you'll always get the same number. PRNGs generate numbers that are difficult to predict without the seed so they look random.

What do you consider 'complex'?

1+i

This one for vim: https://github.com/tomasr/molokai

Thank you for your detailed explanation. I have no experience with lambda-calculus. Bookmarked your code example on the Y combinator. Shouldn't this also be added to that Wikipedia page?

I'm not sure it's worth adding one more example in a new language. Any Turing-complete language will be able to express the Y combinator (though some prettier than others).

$f and $g are just functions, so they're properly named as well by standard mathematical conventions.

LOL. I know what kind of face I'd be getting if I said that to my colleagues because I named all my functions y($x) x($y).

Well, if you know what the Y combinator is, then you'll understand the naming convention of $f and $g. If you don't, giving them other names wouldn't help you at all

I think a perfect script should have a better variable naming convention

I don't know what this does though:

$ff = function($f) { return $f($f); }; // PHP doesn't allow function call chaining
    return $ff(
        function ($g) use ($f) {
            return $f(function() use ($g) {
                return call_user_func_array($g($g), func_get_args());
            });
        }
    );

My guess would go to currying of some sort?

It's the Y combinator, so it's called "Y" on purpose. It computes the fixpoint in (untyped) λ-calculus. $f and $g are just functions, so they're properly named as well by standard mathematical conventions.

Given to Y is a function that given a "partial" Fibonacci function returns a new function that can compute one more recursive step of the Fibonacci function, so to speak (that is, if it can compute f(n), then the new function can compute f(n+1)). The fixpoint of this function is the "full" Fibonacci function.

The Y combinator allows you to express any recursive computation without using recursion.