Even the word "googolplex" is quite a bit longer than the lambda calculus program in question...

The actual bit is just 1 though, the word "googolplex" is in the accompanying documents for interpreting the bit.

The course on reading and using lambda calculus is similarly longer than than the actual lambda calculus expression

> The course on reading and using lambda calculus is similarly longer than than the actual lambda calculus expression

I'm not sure what a "course on reading and using" has to do with description complexity? In any case, it takes 206 bits to implement a binary lambda calculus interpreter (that's Theorem 1 in http://tromp.github.io/cl/LC.pdf )