Computing aggregate properties of preimages for 2D cellular automata.

Computing properties of the set of precursors of a given configuration is a common problem underlying many important questions about cellular automata. Unfortunately, such computations quickly become intractable in dimension greater than one. This paper presents an algorithm-incremental aggregation-that can compute aggregate properties of the set of precursors exponentially faster than naïve approaches. The incremental aggregation algorithm is demonstrated on two problems from the two-dimensional binary Game of Life cellular automaton: precursor count distributions and higher-order mean field theory coefficients. In both cases, incremental aggregation allows us to obtain new results that were previously beyond reach.

[1]  Thomas Worsch.  Cellular Automata as Models of Parallel Computation , 2009, Encyclopedia of Complexity and Systems Science.

[2]  Lemont B. Kier,et al.  Cellular Automata Modeling of Complex Biochemical Systems , 2009, Encyclopedia of Complexity and Systems Science.

[3]  Birger Bergersen,et al.  Effect of boundary conditions on scaling in the ''game of Life'' , 1997 .

[4]  L. Schulman,et al.  Statistical mechanics of a dynamical system based on Conway's game of Life , 1978 .

[5]  P. Bak,et al.  Self-organized criticality in the 'Game of Life" , 1989, Nature.

[6]  Klaus Sutner,et al.  On the Computational Complexity of Finite Cellular Automata , 1995, J. Comput. Syst. Sci..

[7]  S. Ruffo,et al.  Some facts of life , 1991 .

[8]  Sandro M. Reia,et al.  Conway's Game of Life is a near-critical metastable state in the multiverse of cellular automata. , 2014, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  Erica Jen.  Enumeration of Preimages in Cellular Automata , 1989, Complex Syst..

[10]  Bastien Chopard,et al.  Cellular Automata Modeling of Physical Systems , 1999, Encyclopedia of Complexity and Systems Science.