Game of Life cellular automata /

Saved in:

Bibliographic Details
Imprint:	London : Springer, c2010.
Description:	1 online resource (xix, 579 p.)
Language:	English
Subject:	Cellular automata. Cellular automata.
Format:	E-Resource Book
URL for this record:	http://pi.lib.uchicago.edu/1001/cat/bib/8893258

Hidden Bibliographic Details
Other authors / contributors:	Adamatzky, Andrew.
ISBN:	9781849962179 1849962170
Notes:	Includes index. Description based on print version record.
Summary:	In the late 1960s, British mathematician John Conway invented a virtual mathematical machine that operates on a two-dimensional array of square cell. Each cell takes two states, live and dead. The cells' states are updated simultaneously and in discrete time. A dead cell comes to life if it has exactly three live neighbours. A live cell remains alive if two or three of its neighbours are alive, otherwise the cell dies. Conway's Game of Life became the most programmed solitary game and the most known cellular automaton. The book brings together results of forty years of study into computational.
Other form:	Print version: Game of Life cellular automata. London : Springer, c2010 9781849962162 1849962162

Table of Contents:

Preface; Contents; Contributors; Introduction to Cellular Automata and Conway's Game of Life; A Brief Background; The Original Glider Gun; Other GoL Rules in the Square Grid; Why Treat All Neighbors the Same?; References; Historical; Conway's Game of Life: Early Personal Recollections; Conway's Life; Life's Still Lifes; A Zoo of Life Forms; Classical Topics; Growth and Decay in Life-Like Cellular Automata; The B36/S125 "2x2" Life-Like Cellular Automaton; Object Synthesis in Conway's Game of Life and Other Cellular Automata; Gliders and Glider Guns Discovery in Cellular Automata.

Similar Items