Overview
- Editors:
-
-
Andrew Adamatzky
-
Unconventional Computing Centre, University of the West of England, Bristol, UK
- Covers both theory and applications of cellular automata in science and engineering
- Presents the theory of cellular automata in a highly structured way
- Written by world leading authorities
- Lavishly illustrated to elucidate ideas and concepts
- Offers unique coverage of this expanding field
Access this book
Other ways to access
Table of contents (35 entries)
-
-
-
-
-
-
-
-
-
-
-
-
- Tullio Ceccherini-Silberstein, Michel Coornaert
Pages 221-238
-
- Gianluca Tempesti, Daniel Mange, André Stauffer
Pages 239-259
-
-
-
-
-
- Enrico Formenti, Petr Kůrka
Pages 323-335
-
-
- Julien Cervelle, Alberto Dennunzio, Enrico Formenti
Pages 357-371
About this book
This volume of the Encyclopedia of Complexity and Systems Science, Second Edition, provides an authoritative introduction and overview of the latest research in cellular automata (CA) models of physical systems, emergent phenomena, computational universality, chaos, growth phenomena, phase transitions, self-organised criticality, reaction-diffusion systems, self-replications, parallel computation, and more. Fundamental topics of algorithmic complexity, algebraic groups, language theory, evolving CA, ergodic theory, synchronisation, tiling problems and undecidability and topological dynamics of CA are addressed. Cellular automata are regular uniform networks of locally-connected finite-state machines, and represent discrete systems with non-trivial behavior, including waves, patterns and travelling localisations. CA are ubiquitous: they are mathematical models of computation and computer models of natural systems. Classes of CA presented in this book include additive CA, automatain hyperbolic spaces and non-compact spaces, CA in triangular, pentagonal and hexagonal tessellations, automata with memory, quantum and reversible automata, structurally-dynamic CA, and asynchronous automata. Topics added to the second edition include: asynchronous cellular automata, stochastic cellular automata as models of reaction-diffusion processes, cellular automata hardware implementation, cellular automata basins of attraction, orbits of Bernoulli measures in cellular automata, and graphs related to reversibility and complexity in cellular. This state-of-the-art reference is unique in bringing together unequalled expertise of interdisciplinary studies at the edge of mathematics, computer science, and physics.
Reviews
“The volume is an important collection of high-quality works and an excellent reference for researchers in fields related to cellular automata as well as for newcomers to the subject. It is an important addition to the scientific library of any academic institution.” (Silvio Capobianco, zbMATH 1484.68001, 2022)
Editors and Affiliations
-
Unconventional Computing Centre, University of the West of England, Bristol, UK
Andrew Adamatzky
About the editor
Andrew Adamatzky is a Professor in the department of Computer Science and Creative Technologies and Director of the Unconventional Computing Centre, University of the West of England. He has published extensively in theory of computation, cellular automata and mathematical machines, parallel computing, living technologies, organic electronics, and bio-inspired computing. He has authored several books, including Identification of Cellular Automata, Computing in Nonlinear Media, Reaction Diffusion Computers, Dynamics of Crowded Minds, Physarum Machines and edited over 25 collections of chapters. He is founding editor-in-chief of the Journal of Cellular Automata and Journal of Unconventional Computing and editor-in-chief of the International Journal of Parallel, Emergent and Distributed Systems, and Parallel Processing Letters.
