Abstract
The controversy regarding the occurrence of self-organized criticality in the cellular automaton Game of Life has not yet been resolved, mainly due to its massive computational requirements. We consider a one-dimensional version of Life which shows essentially the same local complexity as its two-dimensional counterpart but allows a more extensive computational implementation. General cluster statistics, geometrical properties and self-organized criticality are investigated. Implications concerning higher-dimensional Life are discussed.

This publication has 11 references indexed in Scilit: