Asynchronous game of life

This paper proposes the 8-state asynchronous equivalence of the well-known game of life (GL). Our cellular automaton, called asynchronous game of life, simulates exactly the behavior of the GL, such as universal computation and self-organization, no matter whether the update of cells is simultaneous or independent according to some updating scheme, like a step-driven or time-driven method [see BioSystems 51 (1999) 123]. We employ the updating scheme of Blok and Bergersen [Phys. Rev. E 59 (1999) 3876] such that at every time step each cell has a certain probability to be updated, and investigate the statistical properties of our model through power spectral analyses.