Lerch distribution based on maximum nonsymmetric entropy principle: Application to Conway’s game of life cellular automaton

2021 ◽  
Vol 151 ◽  
pp. 111272
Author(s):  
Javier E. Contreras-Reyes
2015 ◽  
Vol 21 (1) ◽  
pp. 1-19 ◽  
Author(s):  
Randall D. Beer

Maturana and Varela's concept of autopoiesis defines the essential organization of living systems and serves as a foundation for their biology of cognition and the enactive approach to cognitive science. As an initial step toward a more formal analysis of autopoiesis, this article investigates its application to the compact, recurrent spatiotemporal patterns that arise in Conway's Game-of-Life cellular automaton. In particular, we demonstrate how such entities can be formulated as self-constructing networks of interdependent processes that maintain their own boundaries. We then characterize the specific organizations of several such entities, suggest a way to simplify the descriptions of these organizations, and briefly consider the transformation of such organizations over time.


10.37236/2611 ◽  
2013 ◽  
Vol 20 (3) ◽  
Author(s):  
Christiaan Hartman ◽  
Marijn J. H. Heule ◽  
Kees Kwekkeboom ◽  
Alain Noels

Conway's Game of Life has inspired enthusiasts to search for a wide range of patterns for this classic cellular automaton. One important challenge in this context is finding the smallest Garden of Eden (GoE), a state without a predecessor. We take up this challenge by applying two techniques. First, we focus on GoEs that contain a symmetry. This significantly reduces the size of the search space for interesting sizes of the grid. Second, we implement the search using incremental satisfiability solving to check thousands of states per second. By combining these techniques, we broke several records regarding GoEs: the fewest defined cells, the smallest bounding box, and the lowest living density. Furthermore, we established a new lower bound for the smallest GoE.


Author(s):  
Kent Fenwick

John Conway’s Game of Life, published in Scientific American in 1970 is an attempt to model the behavior  of life using a 2D cellular automaton. Although a breakthrough discovery for cellular automata and  emergence theory, the game is restricted and incomplete due to its static, simplified rules. We will show that the game does not model life accurately and propose an alternative: TrueLife. TrueLife is a non­  deterministic, non­local, evolving Game of Life variant that we believe is more complete than Life for  several key reasons. TrueLife is unique since at each generation a rule is chosen randomly from a list and  applied to the current state. This allows the game to be inherently non­deterministic since it is impossible to know which rule is being applied at a given iteration. TrueLife will also be a learning simulation where rules that produce better results will be applied more frequently. Another unique aspect of TrueLife is the motivation behind the rules. The original Life rules are Darwinian and selfish acting only on local inputs that lead to local outputs. TrueLife’s rules will be non­local and act globally across the entire grid. TrueLife’s rules were formalized by drawing on much broader areas of science such as ecology, psychology and quantum theory. We are currently in the process of finding a model system to which  TrueLife would be best suited.


1993 ◽  
Vol 48 (5) ◽  
pp. 3345-3351 ◽  
Author(s):  
J. B. C. Garcia ◽  
M. A. F. Gomes ◽  
T. I. Jyh ◽  
T. I. Ren ◽  
T. R. M. Sales

Author(s):  
David Griffeath ◽  
Dean Hickerson

We solve a problem posed recently by Gravner and Griffeath [4]: to find a finite seed A0 of 1s for a simple {0, l}-valued cellular automaton growth model on Z2 such that the occupied crystal An after n updates spreads with a two-dimensional asymptotic shape and a provably irrational density. Our solution exhibits an initial A0 of 2,392 cells for Conway’s Game Of Life from which An cover nT with asymptotic density (3 - √5/90, where T is the triangle with vertices (0,0), (-1/4,-1/4), and (1/6,0). In “Cellular Automaton Growth on Z2: Theorems, Examples, and Problems” [4], Gravner and Griffeath recently presented a mathematical framework for the study of Cellular Automata (CA) crystal growth and asymptotic shape, focusing on two-dimensional dynamics. For simplicity, at any discrete time n, each lattice site is assumed to be either empty (0) or occupied (1). Occupied sites after n updates grows linearly in each dimension, attaining an asymptotic density p within a limit shape L: . . . n-1 A → p • 1L • (1) . . . This phenomenology is developed rigorously in Gravner and Griffeath [4] for Threshold Growth, a class of monotone solidification automata (in which case p = 1), and for various nonmonotone CA which evolve recursively. The coarse-grain crystal geometry of models which do not fill the lattice completely is captured by their asymptotic density, as precisely formulated in Gravner and Griffeath [4]. It may happen that a varying “hydrodynamic” profile p(x) emerges over the normalized support L of the crystal. The most common scenario, however, would appear to be eq. (1), with some constant density p throughout L. All the asymptotic densities identified by Gravner and Griffeath are rational, corresponding to growth which is either exactly periodic in space and time, or nearly so. For instance, it is shown that Exactly 1 Solidification, in which an empty cell permanently joins the crystal if exactly one of its eight nearest (Moore) neighbors is occupied, fills the plane with density 4/9 starting from a singleton.


2020 ◽  
Vol 26 (3) ◽  
pp. 338-365
Author(s):  
Peter D. Turney

We present a computational simulation of evolving entities that includes symbiosis with shifting levels of selection. Evolution by natural selection shifts from the level of the original entities to the level of the new symbiotic entity. In the simulation, the fitness of an entity is measured by a series of one-on-one competitions in the Immigration Game, a two-player variation of Conway's Game of Life. Mutation, reproduction, and symbiosis are implemented as operations that are external to the Immigration Game. Because these operations are external to the game, we can freely manipulate the operations and observe the effects of the manipulations. The simulation is composed of four layers, each layer building on the previous layer. The first layer implements a simple form of asexual reproduction, the second layer introduces a more sophisticated form of asexual reproduction, the third layer adds sexual reproduction, and the fourth layer adds symbiosis. The experiments show that a small amount of symbiosis, added to the other layers, significantly increases the fitness of the population. We suggest that the model may provide new insights into symbiosis in biological and cultural evolution.


1976 ◽  
Vol 23 (1) ◽  
pp. 56-60
Author(s):  
Lauren L. Meneghan

John Conway's game of “life” provides a delightful and fascinating game for students of junior high school. (The introduction to Mr. Conway's game can be found in an article by Martin Gardner in the October 1970 issue of Scientific American.) Mr. Conway intended that the game be played by one person, but it can easily be adapted so that two or three students can play the game at one time.


2016 ◽  
Vol 89 ◽  
pp. 348-352 ◽  
Author(s):  
Jinling Wei ◽  
Haiyan Zhou ◽  
Jun Meng ◽  
Fan Zhang ◽  
Yunmo Chen ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document