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.
References
1.
B.
Chopard
, “Cellular automata modeling of physical systems
,” in Encyclopedia of Complexity and Systems Science
, edited by R. A.
Meyers
(Springer
, 2009
), pp. 865
–892
.2.
L. B.
Kier
and P. G.
Seybold
, “Cellular automata modeling of complex biochemical systems
,” in Encyclopedia of Complexity and Systems Science
, edited by R. A.
Meyers
(Springer
, 2009
), pp. 848
–865
.3.
T.
Worsch
, “Cellular automata as models of parallel computation
,” in Encyclopedia of Complexity and Systems Science
, edited by R. A.
Meyers
(Springer
, 2009
), pp. 741
–755
.4.
J. E.
Hanson
, “Emergent phenomenon in cellular automata
,” in Encyclopedia of Complexity and Systems Science
, edited by R. A.
Meyers
(Springer
, 2009
), pp. 768
–778
.5.
J.
Durand-Lose
, “Universality of cellular automata
,” in Encyclopedia of Complexity and Systems Science
, edited by R. A.
Meyers
(Springer
, 2009
), pp. 901
–913
.6.
E.
Jen
, “Enumeration of preimages in cellular automata
,” Complex Syst.
3
, 421
–456
(1989
).7.
A.
Wuensche
and M.
Lesser
, The Global Dynamics of Cellular Automata
(Addison Wesley
, 1994
).8.
E. R.
Berlekamp
, J. H.
Conway
, and R. K.
Guy
, Winning Ways for Your Mathematical Plays
(A. K. Peters
, 1982
), Vol. 2
.9.
Game of Life Cellular Automata
, edited by A.
Adamatzky
(Springer
, 2010
).10.
K.
Sutner
, “On the computational complexity of finite cellular automata
,” J. Comput. Syst. Sci.
50
, 87
–97
(1995
).11.
D. E.
Knuth
, The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1
(Addison Wesley
, 2011
).12.
L. S.
Schulman
and P.
Seiden
, “Statistical mechanics of a dynamical system based on Conway's Game of Life
,” J. Stat. Phys.
19
, 293
–314
(1978
).13.
F.
Bagnoli
, R.
Rechtman
, and S.
Ruffo
, “Some facts of Life
,” Physica A
171
, 249
–264
(1991
).14.
P.
Bak
, K.
Chen
, and M.
Creutz
, “Self-organized criticality in the Game of Life
,” Nature
342
, 780
–782
(1989
).15.
H. J.
Blok
and B.
Bergersen
, “Effect of boundary conditions on scaling in the ‘Game of Life’
,” Phys. Rev. E
55
, 6249
–6252
(1997
).16.
S. M.
Reia
and O.
Kinouchi
, “Conway's Game of Life is a near-critical metastable state in the multiverse of cellular automata
,” Phys. Rev. E
89
, 052123
–052125
(2014
).© 2017 Author(s).
2017
Author(s)
You do not currently have access to this content.
