Cellular Automata: A Volume in the Encyclopedia of Complexity and Systems Science, Second Edition

1. Auflage 2018
ISBN: 978-1-4939-8701-6
Verlag: Springer

Buch, Englisch, 760 Seiten, Buch mit Online-Zugang, Format (B × H): 155 mm x 235 mm

Reihe: Encyclopedia of Complexity and Systems Science Series

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, automata in 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.

Zielgruppe

Research

Autoren/Hrsg.

Adamatzky, Andrew

Fachgebiete

• Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker
• Naturwissenschaften Physik Angewandte Physik Statistische Physik, Dynamische Systeme
• Technische Wissenschaften Technik Allgemein Mathematik für Ingenieure
• Mathematik | Informatik Mathematik Mathematik Allgemein Diskrete Mathematik, Kombinatorik
• Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten

Inhaltsverzeichnis

Additive Cellular Automata.- Algorithmic Complexity and Cellular Automata.- Asymptotic Behaviour and a Formalization of Wolfram's Classes.- Asynchronous Cellular Automata.- Basins of Attraction of Cellular Automata and Discrete Dynamical Networks.- Cellular Automata and Groups.- Cellular Automata and Language Theory.- Cellular Automata as Models of Parallel Computation.- Cellular Automata Hardware Implementation.- Cellular Automata in Hyperbolic Spaces.- Cellular Automata in Triangular, Pentagonal and Hexagonal Tessellations.- Cellular Automata Modeling of Physical Systems.- Cellular Automata with Memory.- Classification of Cellular Automata.- Emergent Phenomena in Cellular Automata.- Universality of Cellular Automata.- Chaotic Behavior of Cellular Automata.- Dynamics of Cellular Automata in Non-compact Spaces.- Ergodic Theory of Cellular Automata.- Evolving Cellular Automata.- Firing Squad Synchronization Problem in Cellular Automata.- Gliders in Cellular Automata.- Graphs Related to Reversibility and Complexity in Cellular Automata.- Growth Phenomena in Cellular Automata.- Identification of Cellular Automata.- Introduction to Mathematical Basis of Cellular Automata.- Orbits of Bernoulli Measures in Cellular Automata.- Phase Transitions in Cellular Automata.- Quantum Cellular Automata.- Reversible Cellular Automata.- Self-Organized Criticality and Cellular Automata.- Self-Replication and Cellular Automata.- Stochastic Cellular Automata as models of Reaction-Diffusion processes.- Structurally Dynamic Cellular Automata.- Tiling Problem and Undecidability in Cellular Automata.- Topological Dynamics of Cellular Automata.

Über Autor(innen)

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.