The density of randomly generated cells in the environment also is limited, because in the early stages of cell evolution, cells often trade resources with their nearest neighbors in a non-parasitic manner. Therefore some population stability must exist for this method to succeed. Each cell is allocated a slice of computer processor unit time during each generation. The time allotted for each cell is proportional to its size. By reducing the time slightly, cells can be driven to smaller size over time, Pargellis claims.
Evolution proceeds primarily through the introduction of random mutations in offspring.
Approximately 10 percent of the offspring in each new generation will have at least one operational mutation. Sixty percent of these mutations are substitutional, and 40 percent are split evenly between insertions and deletions of operations. Ninety-seven percent of these mutations result in code that cannot replicate successfully. Evolution also is driven by withholding computer processor unit time from cells that execute operations improperly. A cell might lose some or all of its computer processor unit time depending on the infraction.