Overview
- Simple to understand examples of cellular automata dynamics
- Abundance of illustrations, working examples, and codes
- Efficient techniques for evaluating space-time dynamics of discrete non-linear systems
- References to online interacting demonstrations
- Overview of exciting concepts at the edge of mathematics, computer science, engineering and physics
- Includes supplementary material: sn.pub/extras
Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
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, mathematical, physical and engineering aspects of The Game of Life cellular automata. Selected topics include phenomenology and statistical behaviour; space-time dynamics on Penrose tilling and hyperbolic spaces; generation of music; algebraic properties; modelling of financial markets; semi-quantum extensions; predicting emergence; dual-graph based analysis; fuzzy, limit behaviour and threshold scaling; evolving cell-state transition rules; localization dynamics in quasi-chemical analogues of GoL; self-organisation towards criticality; asynochrous implementations.
The volume is unique because it gives a comprehensive presentation of the theoretical and experimental foundations, cutting-edge computation techniques and mathematical analysis of the fabulously complex, self-organized and emergent phenomena defined by incredibly simple rules.
Similar content being viewed by others
Keywords
Table of contents (27 chapters)
-
Front Matter
-
Historical
-
Front Matter
-
-
Classical Topics
-
Front Matter
-
-
Asynchronous, Continuous and Memory-Enriched Automata
-
Front Matter
-
-
Asynchronous, Continuous and Memory-Enriched Automata
Reviews
From the reviews:
“This volume’s 27 papers offer some systematic methods and rigorous theorems that exhibit the study of Conway’s game and its variations, emerging out of the realm of merely recreational mathematics. … this unique book will have great value as both a state-of-the-art summary and a collection of proposals for new directions to explore. Summing Up: Highly recommended. Upper-division undergraduates through professionals.” (D. V. Feldman, Choice, Vol. 48 (4), December, 2010)
“Andrew Adamatzky has assembled a superb collection of papers on Life that encompass work going back more than 20 years. … maintains a good balance between interconnectedness and recognition of the papers as independent contributions. … This book is a treasure trove of history, concepts, and models. It is a good starting place for a newcomer to the study of Conway’s Game of Life, an opening of vistas for the amateur hobbyist, and a serious handbook for the professional researcher.” (Anthony J. Duben, ACM Computing Reviews, February, 2011)
Editors and Affiliations
About the editor
Andrew Adamatzky is a Professor in Unconventional Computing in the Department of Computer Science, and a member of Bristol Robotics Lab. He does research in reaction-diffusion computing, cellular automata, physarum computing, massive parallel computation, applied mathematics, collective intelligence and robotics.
Bibliographic Information
Book Title: Game of Life Cellular Automata
Editors: Andrew Adamatzky
DOI: https://doi.org/10.1007/978-1-84996-217-9
Publisher: Springer London
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag London Limited 2010
Hardcover ISBN: 978-1-84996-216-2Published: 05 July 2010
Softcover ISBN: 978-1-4471-6154-7Published: 04 November 2014
eBook ISBN: 978-1-84996-217-9Published: 14 June 2010
Edition Number: 1
Number of Pages: XIX, 579
Topics: Logics and Meanings of Programs, Algorithm Analysis and Problem Complexity, Artificial Intelligence, Theory of Computation, Computation by Abstract Devices, Discrete Mathematics in Computer Science