Emergent phenomena in large sparse random arrays of Conway's 'Game of Life'

  title={Emergent phenomena in large sparse random arrays of Conway's 'Game of Life'},
  author={Nicholas Mark Gotts},
  journal={International Journal of Systems Science},
  pages={873 - 894}
  • N. Gotts
  • Published 1 January 2000
  • Computer Science, Mathematics
  • International Journal of Systems Science
This paper describes some well-defined types of emergence that occur in a class of large, initially random arrays of a well-known binary cellular automaton, Conway's 'Game of Life'. Results concerning the existence or non-existence of finite patterns with particular properties are used to advance the global analysis. It is shown that in infinite (and very large finite) arrays of the Game of Life with initially sparse and randomly distributed non-uniformities, self-organized construction… 
Emergent Complexity in Conway's Game of Life
  • N. Gotts
  • Computer Science
    Game of Life Cellular Automata
  • 2010
It is shown that both small, finite patterns and random infinite very low density (“sparse”) arrays of the Game of Life can produce emergent structures and processes of great complexity, through
Ramifying Feedback Networks, Cross-Scale Interactions, and Emergent Quasi Individuals in Conway's Game of Life
  • N. Gotts
  • Computer Science, Medicine
    Artificial Life
  • 2009
It is proposed that analogous networks and interactions may have been precursors to natural selection in the real world.
Emergent phenomena in cellular automata modeling
The emergent computational paradigm is introduced, and its theoretical formulation is discussed using a new general model of cellular automata, and a technique to study the structure of the state transition of cellular Automata in the limit of large system size is developed.
Emergent computation using a new model of cellular automata
A general model for describing the emergent computational strategies in decentralized spatially extended systems, such as in Cellular Automata, is introduced.
Emergent rough set data analysis
Many systems in nature produce complicated behaviors,which emerge from the local interactions of relatively simple individual components that live in some spatially extended world. Notably, this type
Life Worth Mentioning: Complexity in Life-Like Cellular Automata
It is shown that Life is capable of maintaining as much complexity as similar rules while remaining the most parsimonious, and the complexity of higher density Life-like rules, which themselves contain the Life rule as a subset, form a distinct concave density-complexity relationship whereby an optimal complexity candidate is proposed.
The modeling language for interacting hybrid systems in which a new hybrid model of cellular automata and multiagent technology is built, used for traffic system which lies in coordinating the local behavior of individual agent to provide an appropriate system-level behavior in grid of interacting organisms.
Adaptive behaviorin cellular automata using rough set theory
A road-traffic system based on two-dimensional cellular automata combined with rough set theory, to model the flow and jamming that is common in an urban environment and an illustration of how simple learning processes may lead to the formation of the state machine behavior, which can give emergence to the model.
Rough Set adaptive in the Model Based of Cellular Automata and Multi-Agents
The need for intelligent systems has grown in the past decade because of the increasing demand on humans and machines for better performance. The researchers of AI have responded to these needs with
Emergence decision using hybrid rough sets/cellular automata
A road traffic system based on two‐dimensional cellular automata combined with rough set theory to model the flow and jamming that is suitable to an urban environment and provides an illustration of how simple learning processes may lead to the formation of a automaton.


Nonlinear dynamics of the cellular-automaton "game of Life"
  • Garcia, Gomes, Jyh, Ren, Sales
  • Physics, Medicine
    Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics
  • 1993
A statistical analysis of the «game of Life» due to Conway is reported, based on extensive computer simulations starting with uncorrelated distributions of live sites at t=0.
Self-organized criticality in the 'Game of Life"
THE 'Game of Life'1,2 is a cellular automaton, that is, a lattice system in which the state of each lattice point is determined by local rules. It simulates, by means of a simple algorithm, the
On the game of life: population and its diversity
Abstract One of the most important features of biological life in all levels is its astounding diversity. In this work we study the well-known game “Life” due to Conway analysing the statistics of
Self-replicating structures in a cellular automata space
This article demonstrates for the first time that it is possible to create cellular automata models in which a self-replicating structure emerges from an initial state having a random density and distribution of individual components.
Tight Bounds on Periodic Cell Configurations in Life
Three explicit methods are presented to construct oscillators in Conway's Life while guaranteeing certain complexity bounds, leading to the existence of an infinite sequence of oscillators of periods n = 58, 59, 60, … and uniformly bounded population.
'Life' not critical?
SIR - Bak et al. have presented evidence that the cellular automaton, the 'game of life', develops into a self-organized critical state, characterized by a D(T)^(-1.6) distribution of times T
Some New Facts of Life
We investigate the asymptotic density of living cells as dependent on an initial density, the results of scattering of gliders on small stable configurations and the damage spreading in an open
Computational mechanics of cellular automata: an example
We illustrate and extend the techniques of computational mechanics in explicating the structures that emerge in the space-time behavior of elementary one-dimensional cellular automaton rule 54. The
Role of initial conditions in the classification of the rule space of cellular automata dynamics.
  • Dhar, Lakdawala, Mandal, Wadia
  • Mathematics, Medicine
    Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics
  • 1995
This work describes the embedding of a "small" universal turing machine, due to Minski, into a cellular automaton rule table and shows that the identification of the Wolfram class depends crucially on the set of initial conditions used to simulate the given CA.
Cellular automata with almost periodic initial conditions
Cellular automata are dynamical system on the compact metric space of subshifls. They leave many classes of sukhifts invariant. Here we show that c e l l u l ~ automata leave 'circle subhhifls'