Asynchronous updating cellular automata Free dirty chat lines
Conway chose his rules carefully, after considerable experimentation, to meet these criteria: The earliest interesting patterns in the Game of Life were discovered without the use of computers.
The simplest static patterns ("still lifes") and repeating patterns ("oscillators" - a superset of still lifes) were discovered while tracking the fates of various small starting configurations using graph paper, blackboards, physical game boards (such as Go) and the like.
At each step in time, the following transitions occur: The initial pattern constitutes the seed of the system.
The Game of Life, also known simply as Life, is a cellular automaton devised by the British mathematician John Horton Conway in 1970.
During this early research, Conway discovered that the R-pentomino failed to stabilize in a small number of generations.
In fact, it takes 1103 generations to stabilize, by which time it has a population of 116 and has fired six escaping gliders (these were the first gliders ever discovered).
This paper presents an asynchronously updating cellular automaton that conducts computation without relying on a simulated global synchronization mechanism.
The two-dimensional cellular automaton employs a Moore neighborhood and 85 totalistic transition rules describing the asynchronous interactions between the cells.
From a theoretical point of view, it is interesting because it has the power of a universal Turing machine: that is, anything that can be computed algorithmically can be computed within Conway's Game of Life.