By the mid-1960s, in fact, Holland had proved what he called the schema theorem, the fundamental theorem of genetic algorithms: in the presence of reproduction, crossover, and mutation, almost any compact cluster of genes that provides above-average fitness will grow in the population exponentially. ("Schema" was his term for any specific pattern of genes.)
