Fitness distributions (landscapes) of programs tend to a limit as they get bigger. Markov minorization gives upper bounds ((15.3 + 2.30m)/ log I) on the length of program run on random or average computing devices. I is the size of the instruction set and m size of output register. Almost all
programs are constants. Convergence is exponential with 90% of programs of length 1.6 n2N yielding constants (n = size input register and size of memory = N). This is supported by experiment
