The introduction of a quantum mirror in the game of life cellular automaton

Author(s):  
Mikael Fridenfalk
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

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.


2001 ◽  
Vol DMTCS Proceedings vol. AA,... (Proceedings) ◽  
Author(s):  
Kellie M. Evans

International audience We introduce the Larger than Life family of two-dimensional two-state cellular automata that generalize certain nearest neighbor outer totalistic cellular automaton rules to large neighborhoods. We describe linear and quadratic rescalings of John Conway's celebrated Game of Life to these large neighborhood cellular automaton rules and present corresponding generalizations of Life's famous gliders and spaceships. We show that, as is becoming well known for nearest neighbor cellular automaton rules, these ``digital creatures'' are ubiquitous for certain parameter values.


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.


2010 ◽  
pp. 437-450 ◽  
Author(s):  
A. R. Hernández-Montoya ◽  
H. F. Coronel-Brizio ◽  
M. E. Rodríguez-Achach

2000 ◽  
Vol 14 (02) ◽  
pp. 53-57 ◽  
Author(s):  
MIRCEA ANDRECUT

Conway's celebrated "game of life" cellular automaton possesses computational universality. The Fourier analysis reported here shows that the power spectra of the "game of life" exhibit 1/f noise. The obtained result suggests a connection between 1/f noise and computational universality.


Sign in / Sign up

Export Citation Format

Share Document