Random Search is Parsimonious

We model in detail the distribution of Boolean functions implemented by random non-recursive programs, similar to linear genetic programming. Most functions are constants, the remainder are mostly simple. Bounds on how long programs need to be before the distribution of their functionality is close to its limiting distribution are provided in general and for average computers