110 downloads 4K Views 44MB Size

Empty story

Encyclopedia of Complexity and Systems Science Series Editor-in-Chief: Robert A. Meyers

Andrew Adamatzky Editor

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

Encyclopedia of Complexity and Systems Science Series Editor-in-Chief Robert A. Meyers

The Encyclopedia of Complexity and Systems Science Series of topical volumes provides an authoritative source for understanding and applying the concepts of complexity theory together with the tools and measures for analyzing complex systems in all ﬁelds of science and engineering. Many phenomena at all scales in science and engineering have the characteristics of complex systems, and can be fully understood only through the transdisciplinary perspectives, theories, and tools of self-organization, synergetics, dynamical systems, turbulence, catastrophes, instabilities, nonlinearity, stochastic processes, chaos, neural networks, cellular automata, adaptive systems, genetic algorithms, and so on. Examples of near-term problems and major unknowns that can be approached through complexity and systems science include: the structure, history, and future of the universe; the biological basis of consciousness; the integration of genomics, proteomics, and bioinformatics as systems biology; human longevity limits; the limits of computing; sustainability of human societies and life on earth; predictability, dynamics, and extent of earthquakes, hurricanes, tsunamis, and other natural disasters; the dynamics of turbulent ﬂows; lasers or ﬂuids in physics; microprocessor design; macromolecular assembly in chemistry and biophysics; brain functions in cognitive neuroscience; climate change; ecosystem management; trafﬁc management; and business cycles. All these seemingly diverse kinds of phenomena and structure formation have a number of important features and underlying structures in common. These deep structural similarities can be exploited to transfer analytical methods and understanding from one ﬁeld to another. This unique work will extend the inﬂuence of complexity and system science to a much wider audience than has been possible to date. More information about this series at https://link.springer.com/bookseries/ 15581

Andrew Adamatzky Editor

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

With 425 Figures and 20 Tables

Editor Andrew Adamatzky Unconventional Computing Centre University of the West of England Bristol, UK

ISBN 978-1-4939-8699-6 ISBN 978-1-4939-8700-9 (eBook) ISBN 978-1-4939-8701-6 (print and electronic bundle) https://doi.org/10.1007/978-1-4939-8700-9 Library of Congress Control Number: 2018947853 # Springer Science+Business Media LLC, part of Springer Nature 2018 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, speciﬁcally the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microﬁlms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a speciﬁc statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. The publisher, the authors, and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors give a warranty, express or implied, with respect to the material contained herein or for any errors or omissions that may have been made. The publisher remains neutral with regard to jurisdictional claims in published maps and institutional afﬁliations. This Springer imprint is published by the registered company Springer Science+Business Media, LLC part of Springer Nature. The registered company address is: 233 Spring Street, New York, NY 10013, U.S.A.

Series Preface

The Encyclopedia of Complexity and System Science Series is a multivolume authoritative source for understanding and applying the basic tenets of complexity and systems theory as well as the tools and measures for analyzing complex systems in science, engineering, and many areas of social, ﬁnancial, and business interactions. It is written for an audience of advanced university undergraduate and graduate students, professors, and professionals in a wide range of ﬁelds who must manage complexity on scales ranging from the atomic and molecular to the societal and global. Complex systems are systems that comprise many interacting parts with the ability to generate a new quality of collective behavior through selforganization, e.g., the spontaneous formation of temporal, spatial, or functional structures. They are therefore adaptive as they evolve and may contain self-driving feedback loops. Thus, complex systems are much more than a sum of their parts. Complex systems are often characterized as having extreme sensitivity to initial conditions as well as emergent behavior that are not readily predictable or even completely deterministic. The conclusion is that a reductionist (bottom-up) approach is often an incomplete description of a phenomenon. This recognition that the collective behavior of the whole system cannot be simply inferred from the understanding of the behavior of the individual components has led to many new concepts and sophisticated mathematical and modeling tools for application to many scientiﬁc, engineering, and societal issues that can be adequately described only in terms of complexity and complex systems. Examples of Grand Scientiﬁc Challenges which can be approached through complexity and systems science include: the structure, history, and future of the universe; the biological basis of consciousness; the true complexity of the genetic makeup and molecular functioning of humans (genetics and epigenetics) and other life forms; human longevity limits; uniﬁcation of the laws of physics; the dynamics and extent of climate change and the effects of climate change; extending the boundaries of and understanding the theoretical limits of computing; sustainability of life on the earth; workings of the interior of the earth; predictability, dynamics, and extent of earthquakes, tsunamis, and other natural disasters; dynamics of turbulent ﬂows and the motion of granular materials; the structure of atoms as expressed in the Standard Model and the formulation of the Standard Model and gravity into a Uniﬁed Theory; the structure of water; control of global infectious diseases; and also evolution and quantiﬁcation of (ultimately) human cooperative behavior in politics, v

vi

economics, business systems, and social interactions. In fact, most of these issues have identiﬁed nonlinearities and are beginning to be addressed with nonlinear techniques, e.g., human longevity limits, the Standard Model, climate change, earthquake prediction, workings of the earth’s interior, natural disaster prediction, etc. The individual complex systems mathematical and modeling tools and scientiﬁc and engineering applications that comprised the Encyclopedia of Complexity and Systems Science are being completely updated and the majority will be published as individual books edited by experts in each ﬁeld who are eminent university faculty members. The topics are as follows: Agent Based Modeling and Simulation Applications of Physics and Mathematics to Social Science Cellular Automata, Mathematical Basis of Chaos and Complexity in Astrophysics Climate Modeling, Global Warming, and Weather Prediction Complex Networks and Graph Theory Complexity and Nonlinearity in Autonomous Robotics Complexity in Computational Chemistry Complexity in Earthquakes, Tsunamis, and Volcanoes, and Forecasting and Early Warning of Their Hazards Computational and Theoretical Nanoscience Control and Dynamical Systems Data Mining and Knowledge Discovery Ecological Complexity Ergodic Theory Finance and Econometrics Fractals and Multifractals Game Theory Granular Computing Intelligent Systems Nonlinear Ordinary Differential Equations and Dynamical Systems Nonlinear Partial Differential Equations Percolation Perturbation Theory Probability and Statistics in Complex Systems Quantum Information Science Social Network Analysis Soft Computing Solitons Statistical and Nonlinear Physics Synergetics System Dynamics Systems Biology Each entry in each of the Series books was selected and peer reviews organized by one of our university-based book Editors with advice and

Series Preface

Series Preface

vii

consultation provided by our eminent Board Members and the Editor-in-Chief. This level of coordination assures that the reader can have a level of conﬁdence in the relevance and accuracy of the information far exceeding than that generally found on the World Wide Web. Accessibility is also a priority and for this reason each entry includes a glossary of important terms and a concise deﬁnition of the subject. In addition, we are pleased that the mathematical portions of our Encyclopedia have been selected by Math Reviews for indexing in MathSciNet. Also, ACM, the world’s largest educational and scientiﬁc computing society, recognized our Computational Complexity: Theory, Techniques, and Applications book, which contains content taken exclusively from the Encyclopedia of Complexity and Systems Science, with an award as one of the notable Computer Science publications. Clearly, we have achieved prominence at a level beyond our expectations, but consistent with the high quality of the content! Palm Desert, CA, USA September 2018

Robert A. Meyers Editor-in-Chief

Volume Preface

Somewhere in 1930s, while sipping coffee with brandy in Kawiarnia Szkocka in Lwów, Stanislaw Ulam posed a problem – “Suppose one has an inﬁnite regular system of lattice points in En, each capable of existing in various states S1, . . ., Sk. Each lattice point has a well deﬁned system of m neighbors, and it is assumed that the state of each point at time t + 1 is uniquely determined by the states of all its neighbors at time t. Assuming that at time t only a ﬁnite set of points are active, one wants to know how the activation will spread.”1 This is just one of the possible onset of cellular automata theory. Cellular automata are multiorigin and multifarious. They are mathematical machines, models of computation, architectures of massively parallel processors, and fast prototyping tools for studying dynamics of spatially extended nonlinear systems. As Tommaso Toffoli told me once “a magic of cellular automata is that they have low entry fees but high exit fees.” The cellular automata are very simple yet their behavior is often far from predictable, and their analyses require substantial efforts. In this unique book, we gathered a crème de la crème of the cellular automata community. Authors came from different ﬁelds of science and different walks of life. What makes the book unique is not just subjects and objects of the studies but breadths of cellular automata discoveries made in mathematics, computers, science, engineering, and physics. I am honored to the bones to have a privilege of compiling the texts authored by brilliant and brightest minds of the scientiﬁc and engineering world. Thank you, authors. Bristol, UK September 2018

Andrew Adamatzky Volume Editor

1

Ulam S. M. A. Collection of Mathematical Problems (New York: Interscience, 1960), p. 30 ix

Cellular Automata Editorial

A cellular automaton is a discrete universe with discrete time, discrete space, and discrete states. Cells of the universe are arranged into regular structures called lattices or arrays. Each cell takes a ﬁnite number of states and updates its states in a discrete time, depending on the states of its neighbors. Cellular automata are mathematical models of massively parallel computing; computational models of spatially extended nonlinear physical, biological, chemical, and social systems; and primary tools for studying large-scale complex systems. Cellular automata are ubiquitous; they are objects of theoretical study and also tools of applied modeling in science and engineering. Commonly, a cellular automaton array is a one- or two-dimensional rectangular matrix of cells. However, other topologies are also used, e.g., pentagonal tessellations (chapter “▶ Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations,” by Carter Bays) and hyperbolic spaces (chapter “▶ Cellular Automata in Hyperbolic Spaces,” by Maurice Margenstern). Structure of neighborhood, connections between cells, can also change dynamically during automaton’s evolution (chapter “▶ Structurally Dynamic Cellular Automata,” by Andrew Ilachinski). Typically, all cells of a cellular automaton update their states simultaneously, at the same time, however, there is a family of asynchronous automata where cells might not have a global clock (chapter “▶ Asynchronous Cellular Automata,” by Nazim Fates). Cell-state transitions per se can be based on quantum mechanics (chapter “▶ Quantum Cellular Automata,” by Karoline Wiesner). Talking about nonstandard celltransition rules, we must mention cellular automata with injective global functions, where every conﬁguration has exactly one preceding conﬁguration (chapter “▶ Reversible Cellular Automata,” by Kenichi Morita). Typically, a cell neighborhood is ﬁxed during cellular automaton development, and a cell updates its state depending on current states of its neighbors. But even in this very basic setup, the space-time dynamics of cellular automata are incredibly complex, as can be observed from analysis of the simplest one-dimensional automata where a transition rule applied to the sum of two states is equal to the sum of its actions on the two states separately (see chapter “▶ Additive Cellular Automata,” by Burton Voorhees). The automata dynamics becomes much richer if we allow the topology of the cell neighborhood to be updated dynamically during automaton development (see chapter “▶ Structurally Dynamic Cellular Automata,” by Andrew Ilachinski) or also allow a cell’s state to become dependent on the cells’ previous states (see chapter “▶ Cellular Automata with Memory,” by Ramón Alonso-Sanz). Insightful xi

xii

classiﬁcation of cellular automata based on their dynamics and structure of state-transition functions are provided in chapter “▶ Classiﬁcation of Cellular Automata,” by Klaus Sutner. The reader’s initial excursion into the theory of cellular automata themselves continues with decision problems of cellular automata expressed in terms of ﬁlling the plane using tiles with colored edges (chapter “▶ Tiling Problem and Undecidability in Cellular Automata,” by Jarkko Kari) and about algebraic properties of cellular automata transformations, such as group representation of the Garden of Eden theorem and matrix representation of cellular automata (chapter “▶ Cellular Automata and Groups,” by Tullio Ceccherini-Silberstein and Michel Coornaert). Self-reproducing patterns and gliders are among the most remarkable features of cellular automata. Certain cellular automata can reproduce conﬁgurations of cell-states, for example, the von Neumann universal constructor, and thus can be used in designs of self-replicating hardware (chapter “▶ SelfReplication and Cellular Automata,” by Gianluca Tempesti, Daniel Mange, and André Stauffer). Gliders are translating oscillators, or traveling patterns, of nonquiescent states, for example, gliders in Conway’s Game of Life. Gliders are fascinating in two- and three-dimensional spaces (chapter “▶ Gliders in Cellular Automata”). Much of the research in cellular automata deals with dynamics of automaton conﬁgurations in time and space. Several chapters are dedicated to analysis and prediction of the cellular automaton behavior. These include analyses of global transitions graphs (chapter “▶ Basins of Attraction of Cellular Automata and Discrete Dynamical Networks”), phase-transitions (chapter “▶ Phase Transitions in Cellular Automata”), propagated patterns (chapter “▶ Growth Phenomena in Cellular Automata”), and travelling localizations (chapter “▶ Gliders in Cellular Automata,” chapter “▶ Emergent Phenomena in Cellular Automata,” by James E. Hanson). Analytical tools for analyzing cellular automaton dynamics are discussed in (chapter “▶ Topological Dynamics of Cellular Automata,” by Petr Kůrka and chapter “▶ Dynamics of Cellular Automata in Noncompact Spaces,” by Enrico Formenti and Petr Kůrka), probabilistic approaches to CA dynamics (chapter “▶ Orbits of Bernoulli Measures in Cellular Automata,” by Henryk Fukś), chaotic dynamics (chapter “▶ Chaotic Behavior of Cellular Automata,” Julien Cervelle, Alberto Dennunzio, Enrico Formenti), and symbolic dynamics (chapter “▶ Ergodic Theory of Cellular Automata,” by Marcus Pivato). Particular attention is paid to topological dynamics, e.g., in relation to symbolic dynamics, subjectivity, and permutations (chapter “▶ Topological Dynamics of Cellular Automata”), entropy and decidability of cellular automata behavior (chapter “▶ Chaotic Behavior of Cellular Automata”), and insights into cellular automata as dynamical systems with invariant measures (chapter “▶ Ergodic Theory of Cellular Automata”). Concepts of control theory to guide dynamics of probabilistic cellular automata are overviewed in chapter “▶ Control of Cellular Automata,” by Franco Bagnoli, Samira El Yacoubi, and Raul Rechtman. Complexity underpins almost every chapter but particularly pronounced in chapter “▶ Algorithmic Complexity and Cellular Automata,” where

Cellular Automata Editorial

Cellular Automata Editorial

xiii

Kolmogorov complexity as related to cellular automata conﬁgurations have been used among other measures and chapter “▶ Graphs Related to Reversibility and Complexity in Cellular Automata,” by Juan C. Seck-Tuoh-Mora and Genaro J. Martínez, where De Bruijn graphs were applied to evaluate complexity of cell-state transition function. Authoritative review of reversible cellular automata and their computational universality is presented in chapter “▶ Reversible Cellular Automata.” Cellular automata are massive-parallel computing devices (chapter “▶ Cellular Automata as Models of Parallel Computation”) and acceptors of formal languages (chapter “▶ Cellular Automata and Language Theory”). Cellular automata can compute using traveling localizations, or propagating particles or gliders (chapter “▶ Evolving Cellular Automata,” by Martin Cenek and Melanie Mitchell, and chapter “▶ Gliders in Cellular Automata,” by Carter Bays) or by using each cell as an elementary processor, as in systolic architectures (chapter “▶ Cellular Automata Hardware Implementation,” by Georgios Sirakoulis); there are, indeed, combinations of conventional parallel computing techniques and less conventional approaches based on interaction of growing patterns and traveling localizations. Firing squad synchronization is a classical problem demonstrating computational potential of cellular automata: all cells of a one-dimensional cellular automaton are quiescent apart from one cell in the ﬁring state; we wish to design minimal cell-state transition rules enabling all other cells to assume the ﬁring state at the same time (chapter “▶ Firing Squad Synchronization Problem in Cellular Automata,” by Hiroshi Umeo). This has been further developed into solutions of density determination using cellular automata (chapter “▶ Evolving Cellular Automata”). Universality of cellular automata is another classical issue. Two kinds of universality are of most importance: computational universality, e.g., an ability to compute any computable function or implement a functionally complete logical system, and intrinsic, or simulation universality, such as an ability to simulate any cellular automaton (chapter “▶ Universality of Cellular Automata,” by Jérôme Durand-Lose). Cellular automata models of natural systems media (chapter “▶ Cellular Automata Modeling of Physical Systems,” by Bastien Chopard) such as cell differentiation, road trafﬁc, reaction-diffusion (chapter “▶ Stochastic Cellular Automata as Models of Reaction–Diffusion Processes,” by Olga Bandman), and excitable media are ideal candidates for studying all important phenomena of pattern growth (chapter “▶ Growth Phenomena in Cellular Automata,” by Janko Gravner), for studying transformation of a system’s state from one phase to another (chapter “▶ Phase Transitions in Cellular Automata,” by Nino Boccara), and for evaluating the ability of a system to be attracted to the states where boundary between the system’s phases is indistinguishable (chapter “▶ Self-Organized Criticality and Cellular Automata,” by Michael Creutz). Cellular automata models of natural phenomena can be designed, in principle, by reconstructing cell-state transition rules of cellular automata from snapshots of space-time dynamics of the system we wish to simulate (chapter “▶ Identiﬁcation of Cellular Automata,” by Andrew Adamatzky).

Contents

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Carter Bays

1

Cellular Automata in Hyperbolic Spaces . . . . . . . . . . . . . . . . . . . . . Maurice Margenstern

11

Structurally Dynamic Cellular Automata . . . . . . . . . . . . . . . . . . . . Andrew Ilachinski

29

..........................

73

Quantum Cellular Automata . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Karoline Wiesner

93

Asynchronous Cellular Automata Nazim Fatès

Reversible Cellular Automata Kenichi Morita

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 105

Additive Cellular Automata . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 129 Burton Voorhees Cellular Automata with Memory . . . . . . . . . . . . . . . . . . . . . . . . . . . 153 Ramón Alonso-Sanz Classiﬁcation of Cellular Automata . . . . . . . . . . . . . . . . . . . . . . . . . 185 Klaus Sutner Tiling Problem and Undecidability in Cellular Automata . . . . . . . 201 Jarkko Kari Cellular Automata and Groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . 221 Tullio Ceccherini-Silberstein and Michel Coornaert Self-Replication and Cellular Automata . . . . . . . . . . . . . . . . . . . . . 239 Gianluca Tempesti, Daniel Mange, and André Stauffer Gliders in Cellular Automata . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 261 Carter Bays xv

xvi

Contents

Basins of Attraction of Cellular Automata and Discrete Dynamical Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 275 Andrew Wuensche Growth Phenomena in Cellular Automata Janko Gravner

. . . . . . . . . . . . . . . . . . . 291

Emergent Phenomena in Cellular Automata . . . . . . . . . . . . . . . . . . 309 James E. Hanson Dynamics of Cellular Automata in Noncompact Spaces . . . . . . . . . 323 Enrico Formenti and Petr Kůrka Orbits of Bernoulli Measures in Cellular Automata . . . . . . . . . . . . 337 Henryk Fukś Chaotic Behavior of Cellular Automata . . . . . . . . . . . . . . . . . . . . . . 357 Julien Cervelle, Alberto Dennunzio, and Enrico Formenti Ergodic Theory of Cellular Automata . . . . . . . . . . . . . . . . . . . . . . . 373 Marcus Pivato Topological Dynamics of Cellular Automata . . . . . . . . . . . . . . . . . . 419 Petr Kůrka Control of Cellular Automata . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 445 Franco Bagnoli, Samira El Yacoubi, and Raúl Rechtman Algorithmic Complexity and Cellular Automata Julien Cervelle and Enrico Formenti

. . . . . . . . . . . . . . 459

Graphs Related to Reversibility and Complexity in Cellular Automata . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 479 Juan C. Seck-Tuoh-Mora and Genaro J. Martínez Cellular Automata as Models of Parallel Computation . . . . . . . . . 493 Thomas Worsch Cellular Automata and Language Theory . . . . . . . . . . . . . . . . . . . . 513 Martin Kutrib Evolving Cellular Automata . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 543 Martin Cenek and Melanie Mitchell Cellular Automata Hardware Implementation . . . . . . . . . . . . . . . . 555 Georgios Ch. Sirakoulis Firing Squad Synchronization Problem in Cellular Automata Hiroshi Umeo

. . . 583

Universality of Cellular Automata . . . . . . . . . . . . . . . . . . . . . . . . . . 641 Jérôme Durand-Lose Cellular Automata Modeling of Physical Systems . . . . . . . . . . . . . . 657 Bastien Chopard

Contents

xvii

Stochastic Cellular Automata as Models of Reaction–Diffusion Processes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 691 Olga Bandman Phase Transitions in Cellular Automata Nino Boccara

. . . . . . . . . . . . . . . . . . . . . 705

Self-Organized Criticality and Cellular Automata . . . . . . . . . . . . . 719 Michael Creutz Identiﬁcation of Cellular Automata . . . . . . . . . . . . . . . . . . . . . . . . . 733 Andrew Adamatzky Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 749

About the Editor-in-Chief

Dr. Robert A. Meyers President: RAMTECH Limited Manger, Chemical Process Technology, TRW Inc. Post doctoral Fellow: California Institute of Technology Ph.D. Chemistry, University of California at Los Angeles B.A. Chemistry, California State University, San Diego

Biography Dr. Meyers has worked with more than 20 Nobel laureates during his career and is the originator and serves as Editor-in-Chief of both the Springer Nature Encyclopedia of Sustainability Science and Technology and the related and supportive Springer Nature Encyclopedia of Complexity and Systems Science.

Education Postdoctoral Fellow: California Institute of Technology Ph.D. in Organic Chemistry, University of California at Los Angeles B.A. Chemistry with minor in Mathematics, California State University, San Diego Dr. Meyers holds more than 20 patents and is the author or Editor-in-Chief of 12 technical books including the Handbook of Chemical Production

xix

xx

Processes, Handbook of Synfuels Technology, and Handbook of Petroleum Reﬁning Processes now in 4th Edition, and the Handbook of Petrochemical Production Processes, now in its second edition, (McGraw-Hill) and the Handbook of Energy Technology and Economics, published by John Wiley & Sons; Coal Structure, published by Academic Press; and Coal Desulfurization as well as the Coal Handbook published by Marcel Dekker. He served as Chairman of the Advisory Board for A Guide to Nuclear Power Technology, published by John Wiley & Sons, which won the Association of American Publishers Award as the best book in technology and engineering.

About the Editor-in-Chief

About the Volume Editor

Andrew Adamatzky is Professor in Unconventional Computing at the Department of Computer Science and Director of the Unconventional Computing Laboratory, University of the West of England, Bristol. He does research in theoretical models of computation, cellular automata theory and applications, molecular computing, reaction-diffusion computing, collision-based computing, slime mold computing, massive parallel computation, applied mathematics, complexity, nature-inspired optimization, collective intelligence, bionics, computational psychology, nonlinear science, novel hardware, and future and emergent computation. He invented and developed new ﬁelds of computing – reaction-diffusion computing and slime mold computing – which are now listed as key topics of all major conferences in computer science and future and emerging technologies. His ﬁrst authored book was Identiﬁcation of Cellular Automata (Taylor & Francis, 1994). He authored seven books, most notable are Reaction-Diffusion Computing (Elsevier, 2005), Dynamics of Crow Minds (World Scientiﬁc, 2005), Physarum Machines (World Scientiﬁc, 2010), and Reaction-Diffusion Automata (Springer, 2013) and edited 22 books in computing, most notable are Collision Based Computing (Springer, 2002), Game of Life Cellular Automata (Springer, 2010), and Memristor Networks (Springer, 2014); he also produced a series of inﬂuential artworks published in the atlas Silence of Slime Mould (Luniver Press, 2014). He is founding editor-in-chief of Journal of Cellular Automata and Journal of Unconventional Computing (both published by OCP Science, USA) and editor-in-chief of Parallel, Emergent, and Distributed Systems (Taylor & Francis) and Parallel Processing Letters (World Scientiﬁc). He is co-founder of Springer Series Emergence, Complexity and Computation, which publishes elected topics in the ﬁelds of complexity, computation, and emergency, including all aspects of

xxi

xxii

reality-based computation approaches from an interdisciplinary point of view especially from applied sciences, biology, physics, or chemistry. Adamatzky is famous for his unorthodox ideas, which attracted substantial funding from UK and EU, including computing with liquid marbles, living architectures, growing computers with slime mold, learning and computation in memristor networks, artiﬁcial wet neural networks, biologically inspired transportation, collision-based computing, dynamical logical circuits in sub-excitable media, particle dynamics in cellular automata, and amorphous biological intelligence.

About the Volume Editor

Contributors

Andrew Adamatzky Unconventional Computing Centre, University of the West of England, Bristol, UK Ramón Alonso-Sanz Technical University of Madrid, ETSIAAB (Estadística, GSC), Madrid, Spain Franco Bagnoli Department of Physics and Astronomy and CSDC, University of Florence, Sesto Fiorentino, Italy Olga Bandman Supercomputer Software Department, Institute of Computational Mathematics and Mathematical Geophysics SB RAS, Novosibirsk, Russia Carter Bays Department of Computer Science and Engineering, University of South Carolina, Columbia, SC, USA Nino Boccara Department of Physics, University of Illinois, Chicago, IL, USA CE Saclay, Gif-sur-Yvette, France Tullio Ceccherini-Silberstein Dipartimento di Ingegneria, Università del Sannio, Benevento, Italy Martin Cenek Computer Science Department, Portland State University, Portland, OR, USA Julien Cervelle Laboratoire d’Informatique de l’Institut, Gaspard–Monge, Université Paris-Est, Marne la Vallée, France Bastien Chopard Computer Science Department, University of Geneva, Geneva, Switzerland Michel Coornaert Institut de Recherche Mathématique Avancée, Université Louis Pasteur et CNRS, Strasbourg, France Michael Creutz Physics Department, Brookhaven National Laboratory, Upton, NY, USA xxiii

xxiv

Alberto Dennunzio Dipartimento di Informatica, Sistemistica Comunicazione, Università degli Studi di Milano-Bicocca, Milan, Italy

Contributors

e

Jérôme Durand-Lose Laboratoire d’Informatique Fondamentale d’Orléans, Université d’Orléans, Orléans, France Samira El Yacoubi Team Project IMAGES_ESPACE-Dev, UMR 228 Espace-Dev IRD UA UM UG UR, University of Perpignan, Perpignan cedex, France Nazim Fatès LORIA UMR 7503, Inria Nancy – Grand Est, Nancy, France Enrico Formenti Laboratoire I3S – UNSA/CNRS UMR 6070, Université de Nice Sophia Antipolis, Sophia Antipolis, France Henryk Fukś Department of Mathematics and Statistics, Brock University, St. Catharines, ON, Canada Janko Gravner Mathematics Department, University of California, Davis, CA, USA James E. Hanson IBM T.J. Watson Research Center, Yorktown Heights, NY, USA Andrew Ilachinski Center for Naval Analyses, Alexandria, VA, USA Jarkko Kari Department of Mathematics, University of Turku, Turku, Finland Petr Kůrka Département d’Informatique, Université de Nice Sophia Antipolis, Nice, France Center for Theoretical Study, Academy of Sciences and Charles University, Prague, Czechia Martin Kutrib Institut für Informatik, Universität Giessen, Giessen, Germany Daniel Mange Ecole Polytechnique Fédérale de Lausanne (EPFL), Lausanne, Switzerland Maurice Margenstern Université de Lorraine, LGIPM, Département d’Informatique, Equipe GRAL, Metz, France Genaro J. Martínez Escuela Superior de Cómputo, Instituto Politécnico Nacional, México Unconventional Computing Center, University of the West of England, Bristol, UK Melanie Mitchell Computer Science Department, Portland State University, Portland, OR, USA Kenichi Morita Hiroshima University, Higashi-Hiroshima, Japan Marcus Pivato Department of Mathematics, Trent University, Peterborough, ON, Canada Raúl Rechtman Instituto de Energías Renovables, Universidad Nacional Autónoma de México, Temixco, Morelos, Mexico

Contributors

xxv

Juan C. Seck-Tuoh-Mora Instituto de Ciencias Básicas e Ingeniería, Área Académica de Ingeniería, Universidad Autónoma del Estado de Hidalgo, Hidalgo, Mexico Georgios Ch. Sirakoulis School of Engineering, Department of Electrical and Computer Engineering, Democritus University of Thrace, Xanthi, Greece André Stauffer Ecole Polytechnique Fédérale de Lausanne (EPFL), Lausanne, Switzerland Klaus Sutner Carnegie Mellon University, Pittsburgh, PA, USA Gianluca Tempesti University of York, York, UK Hiroshi Umeo University of Osaka Electro-Communication, Osaka, Japan Burton Voorhees Center for Science, Athabasca University, Athabasca, Canada Karoline Wiesner School of Mathematics, University of Bristol, Bristol, UK Thomas Worsch Lehrstuhl Informatik für Ingenieure und Naturwissenschaftler, Universität Karlsruhe, Karlsruhe, Germany Andrew Wuensche Discrete Dynamics Lab, London, UK

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations Carter Bays Department of Computer Science and Engineering, University of South Carolina, Columbia, SC, USA

Oscillator a periodic shape within a speciﬁc cellular automaton rule. Glider a translating oscillator that moves across the grid of a CA. Generation the discrete time unit which depicts the evolution of a cellular automaton. Rule determines how each individual cell within a cellular automaton evolves.

Definition of the Subject Article Outline Glossary Deﬁnition of the Subject Two Dimensional Cellular Automata in the Triangular Grid The Hexagonal Grid The Pentagonal Grid Programming Tips Future Directions Bibliography Typically, cellular automata (“CA”) are deﬁned in Cartesian space (e.g. a square grid). Here we explore characteristics of CA in triangular and other non-cartesian grids. Methods for programming CA for these non-cartesian grids are brieﬂy discussed.

Glossary Cellular automaton (CA) a structure comprising a grid with individual cells that can have two or more states; these cells evolve in discrete time units and are governed by a rule, which usually involves neighbors of each cell. Game of Life a particular cellular automaton discovered by John Conway in 1968. Neighbor a neighbor of cell “x” is typically a cell that is in close proximity to (frequently touching) cell “x”.

A tessellation or tiling is composed of a speciﬁc shape that is repeated endlessly in a plane, with no gaps or overlaps. Examples of simple tessellations are the square grid, the triangular grid (a plane completely covered by identical triangles), etc. Hereafter, we shall also use “grid” when referring to tessellations. Cellular automata (CA) can be explained most effectively with an example. Start with an inﬁnite grid of squares; each square represents a cell, which is either “alive” or “dead”. Time progresses in discrete units called “generations”; at every generation we evaluate simultaneously the fate for each cell at the next generation by examining neighboring cells (called “neighbors”) – in this case, we shall consider as neighbors any cell touching the candidate cell (eight neighbors in all). This is sometimes called the Moore neighborhood. We apply a “rule” to determine the next generation status of our candidate cell. For example, our rule might state, (a) “If our candidate cell is currently alive, then it will remain alive next generation if it touches either two or three live neighbors, otherwise it dies”, and (b) “If our candidate cell is not alive then it will come to life next generation if and only if it is touching exactly three live neighbors.” Figure 1 illustrates a simple conﬁguration to which this CA rule has been applied. Notice that this particular object repeats itself indeﬁnitely. Such an object is called an “oscillator”; this particular oscillator has a “period” of two.

# Springer-Verlag 2009 A. Adamatzky (ed.), Cellular Automata, https://doi.org/10.1007/978-1-4939-8700-9_58 Originally published in R. A. Meyers (ed.), Encyclopedia of Complexity and Systems Science, # Springer-Verlag 2009 https://doi.org/10.1007/978-0-387-30440-3_58

1

2

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations, Fig. 1 Top: Each cell in a grid has 8 “neighbors”. The cells containing “n” are neighbors of the cell containing the “X”. Any cell in the grid can be either “dead” or “alive”. Bottom: Here we have outlined a speciﬁc area of what is presumably a much larger grid. At the left we have installed an initial shape. Shaded cells are alive; all others are dead. The number within each cell gives the quantity of live neighbors for that cell. (Cells containing no numbers have zero live neighbors.) Depicted are three generations, starting with the conﬁguration at generation 1. Generations 2 then 3 show the result when we apply the following cellular automata rule: “Live cells

with exactly 2 or 3 live neighbors remain alive (otherwise they die); dead cells with exactly 3 live neighbors come to life (otherwise they remain dead)”. Let us now evaluate the transition from generation 1 to generation 2. In our diagram, cell “a” is dead. Since it does not have exactly 3 live neighbors, it remains dead. Cell “b” is alive, but it needs exactly 2 or 3 live neighbors to remain alive; since it only has 1, it dies. Cell “c” is dead; since it has exactly 3 live neighbors, it comes to life. And cell “d” has 2 live neighbors; hence it will remain alive. And so on. Notice that the form repeats every two generations. Such forms are called oscillators

Other conﬁgurations can have much larger periods, or can behave in a more chaotic fashion. Motionless patterns can be thought of as oscillators whose period is one. Needless to say, there are a huge number of rules that can be applied, and each rule will cause a distinct action. The rule given above – the most famous cellular automaton of all – speciﬁes the “Game of Life”, discovered by John Horton Conway in 1968. Game of Life (GL) rules must satisfy the following informal criteria.

1. All neighbors must be touching the candidate cell and all are treated the same. 2. There must exist at least one translating oscillator (called a “glider”). 3. Random conﬁgurations must eventually stabilize into zero or more oscillators. For a more formal description of GL rule requirements see (Bays 2005). It is important to note that CA can be represented in one, two, three or higher dimensions, but most work has been done in one or two. Furthermore, neighbors

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations

3

can be deﬁned in many ways; for example we might only consider as neighbors those cells touching the sides of a candidate cell and not the corners. Or we might expand our neighborhood to include cells within a given distance of a candidate cell. This is typically done for onedimensional CA.

Some Convenient Notation for Describing CA Rules We shall write CA rules using the following notation, E 1 , E 2 , . . . =F1 , F 2 , . . .

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations, Fig. 2 The neighborhoods for cells in the triangular grid. Note that the candidate cells can have two orientations – “E” and “O”. The neighbors are indicated by “e” and “o” respectively

where the Ei specify the number of live neighbors required to keep a living cell alive, and the Fi give the number required to bring a nonliving cell to life. The Ei and Fi will be listed in ascending order; hence if i > j then Ei > Ej etc. Thus the rule for Conway’s Game of Life is written 2, 3/3. We shall also use a convenient shorthand when appropriate: Ei–Ej denotes Ei, Ei + 1, . . ., Ei+j i etc. Thus, 2, 3, 4, 5, 6/2, 3, 4 can also be written 2–6/2–4.

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations, Fig. 3 Examples of expanding rules. The starting conﬁgurations are at the top

4

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations

Introduction Almost all CA research in two dimensions has been done using rectangular (Cartesian) coordinates, and hence typically utilizes the square grid. But there is no reason to limit ourselves to this tessellation; the number of different possible grids is almost endless. Here we shall brieﬂy investigate CA behavior in only three – triangular, hexagonal and pentagonal.

Two Dimensional Cellular Automata in the Triangular Grid

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations, Fig. 4 An example of a stable rule. The starting random conﬁguration eventually stabilizes into the shape shown at the lower right; interestingly this shape happens to be an oscillator with a period of two

Throughout this article we shall consider as neighbors only those cells that touch the candidate cell; hence for a grid composed of triangles, each cell would have 12 neighbors (Fig. 2). These non-cartesian grids for CA have been investigated from time to time; most notably by Preston (Preston and Duff 1984) and Bays (1994, 2005). Recently work relating to hexagonal CA has appeared on the internet occasionally.

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations, Fig. 5 Examples of bounded rules that churn endlessly. The total number of live cells can be employed as pseudorandom numbers that approximate a normal distribution. Many candidate rules can be used. Naturally the random like patterns eventually repeat, but with a sufﬁciently large initial shape, the period will be

quite large. The plot at the lower left gives the number of live cells at each generation. These values exhibit a normal distribution (plot “A”). Note however that there are some gaps. This is because the rule 1-8/6-8 tends to have “clumps” of living (and fairly large “holes” of non-living) cells. Hence, before using this technique for generating random numbers, the candidate rule should be carefully investigated

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations, Fig. 6 A simple glider for the GL rule 3, 5/4. It has a period of three (indicated in parentheses) after which it will have moved one cell to the right. Many gliders are not this well behaved, with much longer periods and irregular structure (see next ﬁgure)

With 12 touching neighbors instead of 8 (as in the square grid), we can write more than 16 million distinct rules, most of which are probably of only marginal interest. Many however exhibit behavior worthy of investigation. Some rules will generate a continually expanding collection of live cells – we shall call such rules “expanding” or “unstable” rules. Thus 2, 3/2; 2, 3/3, 4; 2, 3, 4/3 each produce an ever increasing area of live cells – even with extremely small starting conﬁgurations (Fig. 3). A few expanding rules “barely” expand; i.e. several generations are required and the initial live conﬁguration must be fairly large in order to observe instability. For example 2, 3, 6/4, 5 can produce unbounded growth, while 2, 3, 8/4, 5 always eventually stabilizes. The fate of conﬁgurations under 2, 3, 7/4, 5 is uncertain, but the rule appears to produce unbounded growth. Many rules will ultimately lead to a stable pattern (Fig. 4), or no live cells at all.

5

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations, Fig. 7 Some gliders exhibit rather spectacular evolution. The period 80 2, 7, 8/3 glider, swells to 60 live cells during its swaggering trip across the grid, and at the 81st generation, will have moved 12 cells to the right. The gliders move in the direction given by the arrows. It should be noted that gliders have also been found for non-GL rules but since these rules are unstable they have not been investigated

For some rules we can start with bounded forms whose innards churn endlessly forever; these rules can, for example, be used to generate random numbers (Fig. 5). Such rules differ somewhat from expanding rules in that all ﬁnite patterns are bounded and will not expand indeﬁnitely, but an inﬁnite grid of random live cells will never stabilize. Game of Life Rules in the Triangular Grid As mentioned above, the most famous GL rule is Conway’s game, which utilizes a square grid. But GL rules are not limited to squares; quite a few exist in the triangular grid. Among these are 4, 5, 6/4; 3, 4/4, 5; 4, 5/4, 5, 6; 2, 3/4, 5; 3, 4/4, 5, 6; 2/3; 2, 4/4, 6; 3, 5/4; 2, 4, 6/4, 6; 2, 7/3; 2, 7, 8/3. Further information about these and other rules can be found in (Bays 2005) and (Bays 1994) (Figs. 6, 7, 8, 9, 10 and 11).

6

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations, Fig. 8 Hundreds of oscillators exist for the GL (and other) rules in the triangular grid. A few interesting ones are illustrated here. The stationary 4, 5, 6/4 form is representative of an inﬁnite number of such objects that can be created for this rule by the careful positioning of live cells. The different oscillators at the lower right happen to share one identical shape. The oscillator at the upper right “rotates” clockwise, as does the period 12 oscillator at the bottom. Unfortunately rule 1, 7, 8/3 is not a GL rule

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations, Fig. 9 The GL rule 2, 7, 8/3 is of special interest. It is the only known GL rule besides Conway’s rule that supports a “glider gun” – a conﬁguration that spews out an endless stream of gliders. In fact, there are probably several such patterns under that rule. Here we illustrate two guns; the top one generates period 18 gliders and the bottom one creates period 80 gliders. These conﬁgurations move in the direction shown, sending a stream of gliders out behind them (see next ﬁgure)

The Hexagonal Grid The neighborhood for the hexagonal grid is only half the size of that for the triangular grid and is symmetric – each neighbor is identical in the manner of contact with the cell in question. This symmetry can be important for some applications. Unfortunately, the hexagonal grid has a limited number of possible rules – there are only about 4000, many of which are of little interest. For many years past attempts to ﬁnd a GL rule in the hexagonal grid have failed, although gliders were discovered by deﬁning rules where the spatial relationship between neighbors was a factor (Preston and Duff 1984). Recently however the GL rule 3/2 was discovered. It supports the glider shown in Fig. 12. Another glider

has also turned up; its rule is 3/2, 4, 5. Unfortunately this rule is not a GL rule, as it will very slowly exhibit unbounded growth, given a sufﬁciently large starting pattern (Fig. 13).

The Pentagonal Grid Regular pentagons cannot be formed into a grid, but by varying the angles and side lengths, we can create several tessellations from identical convex pentagons. A classiﬁcation system has been devised, wherein 14 different types of tilings have been identiﬁed (Fig. 14). Of these, 12 are topologically distinct; these twelve varieties will behave in different ways under CA rules. We have chosen to investigate one of the most pleasing, the

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations

7

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations, Fig. 12 At least two gliders have been found. The GL rule 3/2 supports a period 5 glider and the non-GL rule 3/2, 4, 5 supports a period 10 glider. Note that the 3/2 glider also works for GL rules 3, 5/2 and 3, 5, 6/2 Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations, Fig. 10 After 800 generations, the two guns will have produced the output shown. Motion is in the direction given by the arrows. The gun at the left yields period 18 gliders, one every 80 generations, and the gun at the right produces a period 80 glider every 160 generations

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations, Fig. 11 The symmetric hexagonal neighborhood. This rather “natural” grid can also be illustrated with circles (upper right) and, just as the square grid can be expanded to cubes in 3 dimensions, the hexagonal grid lends itself to “densely packed spheres” in three dimensions, where each sphere has exactly 12 touching neighbors

“Cairo tiling”, so named because of its alleged use in parts of that city. It’s appeal derives from the fact that the pentagons are both equilateral and isoseles.

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations, Fig. 13 Several interesting oscillators have been discovered for GL rule 3/2. They have been given rather whimsical names, a custom dating back to the early days of Conway’s rule. After 65 generations the “supernova” pattern leaves a period 3 “neutron star” remnant. These patterns also work under rules 3, 5/2 and 3, 5, 6/2

Under the Cairo grid, there are rules that behave in the manner already described for the triangular grid – some rules expand, some stabilize, others contain a bounded, churning mass, etc. Interestingly, a GL rule has been discovered; its glider is depicted in Fig. 15. There is

8

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations, Fig. 14 The 14 distinct convex pentagonal tilings (Bays 2005; Wolfram 2002). They are based upon certain relationships between the angles and lengths of the sides of the particular pentagon that constitutes the tiling. A sample of the pentagon for that tiling is displayed at the right of each. The tilings have been

arranged to depict the number of touching neighbors for each cell. Where more than one number is given, there are some cells with each of those neighbor counts. For example the “67b” tiling is the second tiling where some cells have 6 neighbors and others 7. The Cairo tiling is at the upper left and is topologically equivalent to 7a and 7b. Note that 7c and 7d are also topologically equivalent

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations, Fig. 15 The GL rule 2, 3/3, 4, 6 supports the period 48 glider shown. It is asymmetric, though the second half of its period is a mirror image of the ﬁrst. This characteristic is common amongst many gliders

much opportunity for discovery in this and other pentagonal grids, as very little work has been done.

9

than moving B back to A for the next iteration, we switch between the two; i.e. if array A is the array we are examining, then we copy it into array B, changing the status and neighbor counts of cells as needed. Array B then becomes array A for the next generation, etc. This trick allows us to rapidly scan over all non-changed cells. For further speed we can utilize hashing techniques and only store cells whose status is going to change. For this method, the speed of evaluation will depend only upon the number of cells that change between generations, and not the size of the grid, nor the total number of live cells. Furthermore, with a clever plotting algorithm, we can get away with re-plotting only those changed cells and not the entire grid. We can program practically any grid or tiling in rectangular (square) coordinates by using templates to locate the neighbor cells as depicted in Fig. 16. The operation of ﬁnding the correct neighbors via templates adds a very small amount of time to the overall “next generation” evaluation; hence we would expect calculations on any type of grid to execute almost as fast as on the standard square grid.

Future Directions Programming Tips We can speed up the scan of any grid by storing within each cell its current number of live neighbors along with a tag that indicates whether it is alive or not. Thus when we scan the entire grid for the next generation, we update the status of cells that have changed since last generation (by examining their new neighbor counts) and, for each cell whose status has changed, we ﬁx the neighbor counts for its neighbors; these cells are candidates for updating at the next generation iteration. This method employs two arrays – a “current” array, A, and a “next” array, B. And, rather

The triangular grid yields 12 touching neighbors and hence an ample supply of rules to investigate – many more than the 8 neighbor square grid. The hexagonal grid affords a more natural approach to CA than does the traditional 8 neighbor square grid, since neighbors all touch in the same way. Furthermore, when we expand this grid into three dimensions, we obtain a universe of dense packed spheres, which probably gives the best methodology for emulating 3D applications, as each cell has 12 touching neighbors and all touch in the same way. The fact that GL rules have been found in a pentagonal grid undoubtedly means that other such rules can probably be found in

10

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations, Fig. 16 Templates can be used to simulate any grid with rectangular coordinates. For example, if we are evaluating the neighbors for a hexagonal cell at (i, j) (see “X”) they would be found at

(i 1; j); (i 1; j + 1); (i; j + 1); etc. We can even simulate grids made up of different types of polygons. Here, we determine the polygon type by examining the subscripts of the cell in question. Of course, appropriate graphics procedures must be employed in order to view our grid

many different tessellations – pentagonal and otherwise. The ultimate conclusion is that there is room for much work in the area of non-cartesian CA.

Bays C (2005) A note on the game of life in hexagonal and pentagonal tessellations. Complex Syst 15:245–252 Preston K Jr, Duff MJB (1984) Modern cellular automata. Plenum Press, New York Sugimoto T, Ogawa T (2000) Tiling problem of convex pentagon. Forma 15:75–79 Wolfram S (2002) A new kind of science. Wolfram Media, Champaign

Bibliography Bays C (1994) Cellular automata in the triangular tessellation. Complex Syst 8:127–150

Cellular Automata in Hyperbolic Spaces Maurice Margenstern Universite´ de Lorraine, LGIPM, De´partement d’Informatique, Equipe GRAL, Metz, France

Article Outline Glossary Definition of the Subject and Its Importance Introduction The Locating Problem in Hyperbolic Tilings Implementation of Cellular Automata in Hyperbolic Spaces Complexity of Cellular Automata in Hyperbolic Spaces On Specific Problems of Cellular Automata Universality in Cellular Automata in Hyperbolic Spaces The Connection with Tiling Problems Possible Applications Future Directions Bibliography

Glossary Dodecagrid The tiling {5, 3, 4}. This tessellation lives in the hyperbolic 3D space. Its basic polyhedron is the dodecahedron constructed on regular rectangular pentagons. Fibonacci sequence Sequence of natural integers, denoted by fn and defined by the recurrent equation f nþ2 ¼ f nþ1 þ f n , for all n ℕ and by the initial values f0 = f1 = 1. Heptagrid The tiling {7, 3}, necessarily in the hyperbolic plane. Seven sides and three tiles around a vertex. It is called ternary heptagrid in several papers by the author and its coauthors also in Margenstern (2007c, 2008b). Hyperbolic geometry Geometry, discovered by Nikolaj Lobachevsky and Jànos Bolyai,

independently of each other and around 1830. This geometry satisfies the axioms of Euclidean geometry, the axiom of parallels being excepted and replaced by the following one: through a point out of a line, there are exactly two parallels to the line. In this geometry, there are also lines which never meet: they are called non-secant. They are characterized by the existence, for any couple of such lines, of a unique common perpendicular. Also, in this geometry, the sum of the interior angles of a triangle is always less than p. The difference to p defines the area of the triangle. In hyperbolic geometry, distances are absolute: there is no notion of similarity. See also Poincare´’s disk. Invariant group of a tiling Group of transformations which defines a bijection on the set of tiles. Usually, in a geometrical space, they are required to belong to the group of isometries of the space. Pentagrid The tiling {5, 4}, necessarily in the hyperbolic plane. Five sides and four tiles around a vertex. The angles are right angles. Poincare´’s disk Model of the hyperbolic plane inside the Euclidean plane. The points are those which are interior to a fixed disk D. The lines are the trace in D of diameters or circles which are orthogonal to the border of D. The model was first found by Beltrami and then by Poincare´ who also devised the half-plane model also called after his name. The half-plane model is a conformal image of the disk model. Tessellation Particular case of a finitely generated tiling. It is defined by a polygon and by its reflections in its sides and, recursively, of the images in their sides. Tiling Partition of a geometrical space; the closure of the elements of the partition is called the tiles. An important case is constituted by finitely generated tilings: there is a finite set of tiles G such that any tile is a copy of an element of G. Tiling {p, q} Tessellation based on the regular polygon with p sides and with vertex angle 2p q :

# Springer Science+Business Media LLC, part of Springer Nature 2018 A. Adamatzky (ed.), Cellular Automata, https://doi.org/10.1007/978-1-4939-8700-9_53 Originally published in R. A. Meyers (ed.), Encyclopedia of Complexity and Systems Science, # Springer Science+Business Media New York 2015 https://doi.org/10.1007/978-3-642-27737-5_53-5

11

12

Definition of the Subject and Its Importance Cellular automata in hyperbolic spaces, in short hyperbolic cellular automata (abbreviated HCA), consists in the implementation of cellular automata in the environment of a regular tiling of a hyperbolic space. The first implementation of such an object appeared in a paper by the present author and Kenichi Morita in 1999 (see Margenstern and Morita 1999). In this first paper, a first solution to the location problem in this context was given. The paper also focused on one advantage of this implementation: it allows to solve NP problems in polynomial time. In 2000, a second paper appeared, by the present author, where a decisive solution of the location problem was given. The study of HCAs is a new domain in computer science, at the border with mathematics and physics. They involve hyperbolic geometry as well as elementary arithmetic and algebra with the connections of polynomials with matrices and also some theory of fields. They also involve the theory of formal languages in connection with their properties of elementary arithmetic. To be a melting pot of such different techniques is already something which is very interesting. But the new field has very striking properties. Their complexity classes offer a very different landscape than that of the classical theory of complexity based on the Turing machine. They also provide a bridge between the classical theory of computation and super-Turing computations. HCAs are a novel object with rich properties: they inherit the richness of the infinitely many regular tilings which live in the hyperbolic plane. We are at the beginning of the study, and still, there are a lot of surprising results. HCAs might appear as successful as their Euclidean relatives in various domains as astrophysics, nuclear physics, and computer science. For many results indicated in this entry, we quote the books Margenstern (2007c, 2008b) or Margenstern (2013b), when the results and their proofs can be found there.

Cellular Automata in Hyperbolic Spaces

Introduction Before the appearance of HCAs, there were a few papers on a possible implementation of cellular automata in abstract contexts, especially in the case of Cayley graphs (see Ro´ka 1994). However, as infinitely many tilings of the hyperbolic plane are not Cayley graphs of their invariant group, this method cannot solve the problem in full generality. The difficulty was the location of the tiles, the locating problem. The problem is already difficult in the simple case of tessellations. Note that there are infinitely many of them in the hyperbolic plane. The study appeared to be possible, thanks to a partial solution to the locating problem (see Margenstern and Morita 1999, 2001). A decisive step was done in Margenstern (2000), where the already mentioned mixing of various techniques appears. This first solution in the case of a particular tiling, the pentagrid, is dealt with in section “The Locating Problem in Hyperbolic Tilings.” A significant advance was performed at the occasion of the meetings organized in 2002 for the bicentenary of the birth of Jànos Bolyai, coinventor with Nikolaj Lobachevsky of hyperbolic geometry and also at the occasion of SCI’2002. At this conference, seven papers were presented on the topic of this entry, and they had a strong impact on the later development. This introduction should contain a paragraph on hyperbolic geometry. If the reader is not familiar with this geometry and who has some time, we recommend him/her the first chapter of Margenstern (2007c) or of Margenstern (2013b). Alternatively, the reader may look at any other book introducing to hyperbolic geometry. For a reader which is not familiar and who has no time, we recommend the following solution. First, forget everything of Euclidean geometry and try to remember the few elements given in the glossary: do not worry, the Euclidean objects will always be the first thing to come to your mind, and most often, it will be misleading. Second, never forget that in traveling over hyperbolic spaces, you are in the situation of the pilot of a plane flying with instruments only. You can see nothing in the usual sense of these words and, sorry to repeat it again, the

Cellular Automata in Hyperbolic Spaces

13

usual intuition is misleading. The best introduction is to imagine that when you venture into the hyperbolic plane, always keep with you the Ariadne thread of the way backward. Otherwise, you will definitely be lost. With this precaution, you will never regret the trip. The landscape changes very quickly and you are always fascinated by its unbelievable beauty.

Induction step: Let P be the current pentagon. If P is the leading pentagon of a quarter Q (see P0 in Fig. 1), the complement of P in Q splits into two quarters, R1 and R3 and remaining region, R3, which we call a strip. If P is the leading pentagon of a strip S (see P1 in Fig. 1), the complement of P in S splits into a quarter S 1 and again a strip, S 2.

The Locating Problem in Hyperbolic Tilings

As proved in Margenstern (2007c, 2013), the set of tiles attached to the tree generated in this way, the leading pentagons of the above algorithm, is exactly the set of pentagons contained in the quarter Q0. With Margenstern (2000, 2007c), a new ingredient is brought in: number the nodes of the tree from the root, to which we attach 1, and then level by level, from left to right on each level (see Fig. 2). As already noticed in Margenstern and Morita (1999), the number of nodes of the tree which spans the tiling of a quarter which are on the same level k is f2kþ1 , where {fk}k ℕ with f(0) = f(1) = 1. For this reason, the spanning tree

The Classical Case of the Pentagrid The method introduced in Margenstern and Morita (1999) consists in constructing a bijection between the tiling and a tree, the spanning tree of the tiling. The tree is constructed in a recursive way, defined as follows (also see Fig. 1): Initial step: P0 is the root of the tree; it is called the leading pentagon of the quarter Q0; it defines by its sides 1 and 5. Cellular Automata in Hyperbolic Spaces, Fig. 1 The pentagrid: regular pentagons with vertex angle p2

5

S2

R3

P1

4

S1

1

P0

3 R2

2

R1

14

Cellular Automata in Hyperbolic Spaces 1 1 2

5

13

14

15

3

4

1

1

1

0

0

0

0

1

6

7

8

9

11

10

12

1

1

1

1

1

1

1

1

0

0

0

0

0

0

0

0

0

0

1

0

0

0

1

1

0

1

0

0

0

1

0

0

0

1

0

0

1

26 27

28 29

30

16

17

18 19

20 21 22

23 24

25

31 32

33

1

1

1

1

1

1

1

1

1

1

1

1

1

1

1

1

1

1

1

1

1

0

0

0

0

0

0

0

0

0

0

0

0

0

0

0

0

0

0

0

0

0

0

0

0

0

0

1

1

1

0

0

0

0

0

0

0

0

1

1

1

1

1

0

0

0

1

1

0

0

0

0

0

0

0

0

1

1

1

0

0

0

0

0

0

0

1

0

0

0

0

1

0

0

0

1

1

0

0

0

0

0

0

1

1

0

1

0

0

1

0

1

0

0

0

1

0

0

0

0

1

0

0

1

0

0

0

1

0

0

1

0

1

0

0

1

0

0

1

Cellular Automata in Hyperbolic Spaces, Fig. 2 The Fibonacci tree

of the pentagrid is called the standard Fibonacci tree, illustrated by Fig. 2. Note that on level k, the first node is numbered f2k and the last one f2kþ21 : The above splitting induces a particular structure on the standard Fibonacci tree. Define white nodes as nodes which have three sons and black nodes as nodes which have two sons. Black and white are the two possible values of the status of a node. Then, there is a rule to define the status of the sons of a node. We can write them as follows, in self-explained notations: W ! BWW B ! BW: As initially performed in Margenstern (2000), let us represent the numbers attached to the nodes of the Fibonacci tree in the numeration basis defined by the Fibonacci sequence itself, starting from f1. The representation is not unique. Choose the

longest representation with respect to the lexicographic order and call it the coordinate of the node to which the corresponding number is attached. First, we have that the set of coordinates is a regular language, which is a corollary of a wellknown theorem (see Fraenkel 1985). Now we have a more interesting property, which was first noticed in Margenstern (2000) and which we call the preferred son property. Let ak. . .a0 be the coordinate of a node n of the standard Fibonacci tree, with a0 as the lightest digit of the representation. Denote it by [n]. The property says that for each node n of the standard Fibonacci tree, there is exactly one son of n whose coordinate is [n]00. This son is called preferred. Moreover, there is a rule to find out the preferred son from the status of a node: in a black node, the preferred son is the black son; in a white node, the preferred son is the middle one.

Cellular Automata in Hyperbolic Spaces

Generalization: The Splitting Method The generalization was first announced in Margenstern (2002a). It was then presented in Margenstern (2002b), with a new visit to Poincare´’s theorem, at the occasion of the second century of the birth of Jànos Bolyai. The method defines a basis of splitting and then the notion of a combinatoric tiling. Two important consequences can be derived from these very definitions to which we turn now. Let S0, . . ., Sk be finitely many parts of some geometric metric space X which are supposed to be closed, with nonempty interior, unbounded and simply connected. Consider also finitely many closed simply connected bounded sets P1, . . ., Ph with h k. Say that the Sis and P‘s constitute a basis of splitting if and only if: (i) X splits into finitely many copies of S0 (ii) Any Si splits into one copy of some P‘, the leading tile of Si, and finitely many copies of Sjs where copy means an isometric image and where, in the condition (ii), the copies may be of different Sjs, Si possibly included. As usual, it is assumed that the interiors of the copies of P‘ and of the copies of the Sjs are pairwise disjoint. The set S0 is called the head of the basis and the P‘s are called the generating tiles, and the Sis are called the regions of the splitting. On the example of the pentagrid, a basis of splitting is given by a quarter Q and a strip S . When there is a basis of a splitting, we then define: Say that a tiling of X is combinatoric if X has a basis of splitting and if the spanning tree of the splitting yields exactly the restriction of the tiling to the head S0 of the basis.

In Margenstern and Morita (1999) and Margenstern (2007c), the pentagrid is proved combinatoric. A lot of other tilings of the hyperbolic plane are combinatoric. In particular, all the tilings {p, q}, with q 4, possess this property. It is also the case for the tilings {p, 3}, with p 7 which live in the hyperbolic plane (see

15

Margenstern 2007c, 2013). In higher dimension, the following tilings were proved combinatoric: the 3D tiling {5, 3, 4}, the dodecagrid (see Margenstern and Skordev (2003b) and Margenstern (2007c)), and the 4D tiling {5, 3, 3, 4}, based on the 120-cell (see Margenstern 2004, 2007c). Once a tiling is combinatoric, from the definition of its basis of splitting, we can derive a square matrix M called the matrix of the splitting (see Margenstern 2002a, 2007c). Its lines indicate, for each column, the number of copies of Sjs entering in the splitting of Si. The polynomial of the splitting is the characteristic polynomial of M, divided by the greatest power of X it contains as a factor. In our cases, this polynomial has a greatest real root. The polynomial of the splitting induces a recurrent equation which defines the sequence of the splitting with appropriate initial values. The maximal representations of numbers in the basis defined by the sequence of the splitting constitute the language of the splitting. As proved in Margenstern and Skordev (2003a) and Margenstern (2007c), the language of the splitting of the tilings {p, q} is regular when q 4 and p 4.

Implementation of Cellular Automata in Hyperbolic Spaces The implementation of HCAs is induced by the results mentioned in the previous section. But first, let us go back to the general definition of CAs. Three conditions must be fulfilled by a set of cells to be called a cellular automaton. The cells of the automaton must uniformly be distributed in the considered space. The neighborhood of each cell is defined in a uniform way. At each top of the discrete clock, all the cells update their own state according to the same function applied to the state of the cell and the sequence of states of its neighbors. To implement cellular automata, we have to satisfy these three requirements. The first two conditions are easily satisfied in a tessellation. Note that this is the standard frame

16

for CAs in the Euclidean plane and in the 3D Euclidean space. The third condition already requires that we have a system of coordinates for the tiles at our disposal. More than three centuries after Descartes’ discovery of the system of coordinates which everybody uses for the Euclidean plane, this condition is trivially fulfilled. This is not only the three-century usage. This is also the case because the mathematical structure of the group of displacements which leaves the considered tessellations of the Euclidean plane globally invariant is a very simple structure. The situation is very different in the case of hyperbolic spaces. Before Margenstern (2000), there was no convenient, at least fast, procedure to define the coordinates of the tiles in a way which is in connection with the geometrical properties of the tiling. Now, the splitting method gives such a solution. First, it effectively exhibits a tree which generates the tiling. As Gromov pointed out (Gromov 1981), hyperbolic spaces are characterized by a tree structure. Second, it provides fast algorithms to handle these coordinates. By fast, we mean that the basic algorithms we need are linear in time with respect to the coordinate of the initial point. Note that nobody really matters with the fact that addition of vectors in Euclidean coordinates is linear, while multiplication of coordinates by a scalar is not. Here, we have no addition, no multiplication, and no nice formula. We have algorithms only, but they turn out to work in the best time. The result of these considerations is that the directions, north, south, east, and west, which play a so nice role in the Euclidean case no more exist. In fact, we have infinitely many directions, each of which defines an essential direction in the space: if you follow other directions, you will never go to the area covered by this one. Of course, an infinite amount of information is ruled out in computer science. And so, we replace this basic indetermination of the direction by the direction of the father. Of course, we are led to a root and a central cell, but nobody complains about using an origin in the Euclidean case. Moreover, as shown in Margenstern (2006a,

Cellular Automata in Hyperbolic Spaces

2007c), it is also possible in the case of tessellations of the hyperbolic plane to get rid of the origin. We just mention this point, here, and refer the interested reader to the quoted papers for a closer study. Once again, we illustrate how we proceed by the case of the pentagrid. It is repeated in the case of the heptagrid (see Margenstern 2006a, 2007a) and in the case of the dodecagrid (see Margenstern 2006b). For the implementation, we first fix a basis of splitting and the representation of the tiling. As indicated in Margenstern (2000, 2007c), there are a lot of choices with the same basis of splitting. Moreover, in the case of the pentagrid and of the heptagrid in which the standard Fibonacci tree is also a spanning tree, we have the choice between using the Fibonacci sequence, as we did in section “The Locating Problem in Hyperbolic Tilings,” and using the basis derived from the polynomial of the splitting. The difference is that the Fibonacci pﬃﬃ sequence is defined by the golden mean 1þ2 5 , while the sequence of the splitting pisﬃﬃ defined by the square of the golden mean, 3þ2 5 Let us go on with the Fibonacci sequence, as is it used in the majority of papers. The preferred son property allows us to compute very easily the coordinates of the neighbors of a cell n from [n]: the computation is linear in time with respect to the length of [n] (see Margenstern 2003, 2007c). Similarly, the path from a cell n to the root of its tree can be computed in a linear time with respect to the length of [n] (again see Margenstern 2003, 2007c). As a simple example, if m is defined by ½n ¼ ½ma1 a0 , where a 0 is the lowest digit of [n], the father of n has m þ a1 as its number. What we indicated up to now fixes the coordinates for a cell whose supporting tile is in a given quarter. We can consider the central cell as the root of a tree whose sub-trees are exactly the five initial quarters which lie around the central pentagon. Now, it is enough to number the five sub-trees attached to these quarters in order to completely define the coordinates of a cell. The central pentagon has 0 as a unique coordinate. All other cells are defined by two numbers: (a, n). The

Cellular Automata in Hyperbolic Spaces

first number, a is in {1. . .5} and defines the quarter. The second number, v, defines the tile in the indicated quarter. Together with its coordinate, a cell is associated with other data: the status of its supporting tile and the indication of which side is shared with its father. On one hand, note that the coordinate is a hardware feature: it is never known by the cell and it cannot be – it has not a bounded size. Note that this is the same for CAs in Euclidean spaces. On the other hand, the status of the supporting node can be known by the cell. As shown in Margenstern (2003), one can define rules for a cellular automaton to dispatch this information. As it is a finite information which can be provided by the hardware, we may assume that the cell knows it.

Complexity of Cellular Automata in Hyperbolic Spaces Now, we are ready to give the results about the complexity classes of HCAs. SAT and NP-Complete Problems In Margenstern and Morita (1999), HCAs are proved to be able to solve SAT in polynomial time. Historically, the possibility to solve NP-complete problems in the hyperbolic plane was first announced in Morgenstein and Kreinovich (1995). Although the authors of Margenstern and Morita (1999) were not aware of paper (Morgenstein and Kreinovich 1995), the latter paper does not involve cellular automata and does not provide a precise description of how SAT can be solved in the new frame. On the contrary, Margenstern and Morita (1999) describe a HCA which is able to solve the problem. In Margenstern and Morita (1999), the computation is estimated as quadratic. In fact it can be proved to be linear in the size of the input. The solution for SAT is easy: it makes use of a Fibonacci tree, in which only two nodes are selected among the sons of a node. Each level represents the possible assignment of true and false values to the variable indexed by this level. The computation of all possible assignments until the level n, where n is the number of

17

variables, is triggered at initial time. Once it is reached, the information comes back to the root from the leaves of the tree, i.e., the nodes which are on the level n of the tree: each node computes the OR on the values of its left-hand side and right-hand side sons. Accordingly, the root gives true if and only if there is a branch from it to a leaf along which the value is always true. From this, applying classical tools of the theory of complexity, we obtain that any NP-complete problem can be solved in polynomial time by an appropriate cellular automaton of the hyperbolic plane. P = NP in the Hyperbolic Plane From what we have seen previously, we have that the classical class NP is contained in the class of HCAs which work in polynomial time, denote it by Ph. Now, it is also possible to define NPh for HCAs, taking the classical definition of nondeterministic computations in polynomial time. As shown in Iwamoto et al. (2002), it turns out that Ph = NPh. The key point is that the computation of a nondeterministic Turing machine in time O(t(n)), with t(n) n, can be computed by a deterministic HCA in time O(t2(n)). From this theorem, the following surprising result can easily be derived (see Iwamoto et al. 2002): Ph ¼ NPh ¼ PSPACE, where PSPACE is the classical class of functions computed in polynomial space by a Turing machine. Of course, in these results, a basic ingredient is the possibility, given by the hyperbolic plane, to occupy a working space of exponential area within a polynomial time. The above process for solving SAT is a basic example of such a possibility. Other Parts of the Complexity Hierarchy of HCAs In fact, if we look at the hierarchy of complexity classes for HCAs, we get a landscape which is very different from the classical situation.

18

We have the following situation, described in Iwamoto and Margenstern (2003): DLOGh ¼ NLOGh ¼ Ph ¼ NPh ¼ PSPACE ⊈PSPACEh ¼ EXPTIMEh ¼ NEXPTIMEh ¼ EXPSPACE: We can notice that compared to the Euclidean analogs, the hyperbolic hierarchy seems to be very flat. As, by construction, Ph ⊈EXPTIMEh ; there are indeed two classes on which the hierarchy concentrates. We also have NPh ⊈APh ; unless PSPACE ¼ NEXPTIME, where APh denotes the class of alternate HCAs. As with classical machines, an alternate HCA is defined on the set of configurations of a nondeterministic HCA. In the tree of these configurations, certain nodes are called existential; others are called universal. At an existential node, the node is accepting if and only if it has at least one accepting child. At a universal node, the node is accepting if and only if all its children are accepting. The result about APh indicates a similar situation with the Euclidean classes where P⊈AP, unless P ¼ PSPACE: Accordingly, we may expect that alternating HCAs should be more powerful than HCAs, either deterministic or nondeterministic.

On Specific Problems of Cellular Automata Characterization of a HCA For classical cellular automata, i.e., for cellular automata in a Euclidean space, there is a wellknown characterization of cellular automata in terms of operations on the space of configurations. Consider the most studied case of the square grid in the Euclidean plane. The grid is most often identified with ℤ2 so that if Q is the set of states of a 2 cellular automaton, C = Qℤ is the set of all possible configurations for a cellular automaton on ℤ2 with states in Q A cellular automaton A on ℤ2 with states in Q defines an operator on C called the global function of A denoted by F A . A famous theorem (see Hedlund 1969), says that if A is a

Cellular Automata in Hyperbolic Spaces

cellular automaton A with states in Q on ℤ2, F A is a continuous operator on C, fitted with the product topology, which also commutes with the shifts on ℤ2. The remarkable property is that the converse is true. However, if we take a continuous operator F on C which commutes with shifts, the proof of the theorem does not allow us to obtain an effective process that would provide a cellular automaton A such that F A = F. The problem is that there is no algorithm which would compute the radius of the neighborhoods of A from F. In Margenstern (2008d) we proved that a similar characterization exists for hyperbolic cellular automata on the pentagrid or the heptagrid, provided we consider rotation invariant cellular automata. The characterization holds for rotation invariant cellular automata on all tilings of the hyperbolic plane or of the hyperbolic 3D space whose tiling is algorithmically spanned by a tree. Synchronization of a HCA Although no paper is especially devoted to this problem, we mention it because it has an analog to the standard problem of the firing squad in one-dimensional CAs, and we shall use it in the next section. In fact, as mentioned more or less explicitly in papers devoted to HCA (see Iwamoto and Margenstern (2003) and Margenstern (2008a)), for instance, it is very easy to synchronize a disk or a sector inside a disk, defined by a tree rooted at the center of the disk. The idea is simply to simulate any classical algorithm of synchronization of a one-dimensional CA on each branch of the tree for each radius of the disk. The synchronization is linear in the radius of the disk or the height of the tree. Communications Between HCAs Another problem, more specific to HCAs, is the communication between HCAs, possibly distant ones. Two papers study the problem in different settings (see Margenstern 2006a, 2007a). In Margenstern (2006a) the question is: how to establish a contact between two cells of a HCA, possibly distant ones? The paper provides a solution based on a new system of coordinates in which there is no more an origin. The new system

Cellular Automata in Hyperbolic Spaces

is based on the possibility to represent the hyperbolic plane as a union of growing quarters. We fix such a sequence in an appropriate way. Each term of the sequence is a Fibonacci tree, indexed by an integer n, and it contains all the trees indexed by m when m n. Inside a given Fibonacci tree, we use the standard system of coordinates, indicated in section “The Locating Problem in Hyperbolic Tilings.” In the construction, the roots of the mentioned trees belong to a line d. It is not difficult to see that sending signals on d makes it possible for the cell to establish a contact in a linear time with respect to their mutual distance. In Margenstern (2007a), another problem is considered. This time all cells may dispatch messages, and each cell forwards the messages it receives and to which it does not want to reply. Accordingly, the same cell may be an emitter of messages, a receiver of messages, and a relay in the message system. The idea is to use the tree property to be in bijection with the tiling as follows: each emitting cell considers that it is the center of the hyperbolic plane, and the message is accompanied by an address which is updated by the relays and which is the address in the tree whose root is the sender of the message. This allows any receiver willing to answer the message to send it to the right emitter. Again, the complexity of the computation is linear in the mutual distance of a sender and a receiver. Also see subsection “Communications in a Network.”

Universality in Cellular Automata in Hyperbolic Spaces Of course, from the existence of universal cellular automata on the line, we conclude that there are universal HCAs. This means that there are HCAs which are able to simulate any universal device, as a Turing machine, for instance. There was recently a definite progress in the study of universal HCAs. From the first result about a universal HCA in the pentagrid with 22 states (see Herrmann and Margenstern 2003), we arrive to universal HCAs with two states in the hyperbolic plane and also in the hyperbolic 3D space (see subsection “Weakly Universal

19

HCAs with a Small Number of States”). There was also a paper about an intrinsically universal HCA (see subsection “An Intrinsically Universal HCA”). There was also very recently two papers about strong universality of HCAs with a rather small number of states (see subsection “Strong Universal HCAs with a Small Number of States”)

Weakly Universal HCAs with a Small Number of States First, we have to notice that the just-mentioned universal HCAs with a small number of states are in fact weakly universal HCAs. The term weak refers to two conditions: – The HCA needs an infinite initial configuration. – The initial configuration is ultimately periodic. Note that these conditions are standardly used with ordinary CAs where universality with a small number of states is investigated. The second condition requires some explanation. In the context of a hyperbolic space, the notion of periodicity is not as clear as it is in the Euclidean case. Accordingly, we mean, by ultimate periodicity that at large, i.e., outside a big enough domain, the configuration can be split into finitely infinite domains in each of which it is globally invariant under a shift depending on the domain. The results accumulated in the recent years. In the hyperbolic plane, there were a weakly universal HCA with nine states in the pentagrid (see Margenstern and Song 2009) and then two universal HCAs in the heptagrid: first with six states, (Margenstern and Song 2008), and then with four states (see Margenstern 2011b). Very recently, there was a weakly universal HCA in the tiling {13, 3} of the hyperbolic plane with two states only. In the dodecagrid, after the weakly universal HCA with five states (see Margenstern 2006b), there was a weakly universal HCA with three states (see Margenstern et al. 2010a) and then with two states (see Margenstern 2013), which is the best result in this tiling.

20

The above-mentioned universal HCAs with a small number of states are obtained by a similar construction. They all simulate a railway circuit with the kind of switches, described by Stewart (1994). Figure 3 illustrates the basic element on which the whole circuit is based. It makes use of the three kinds of switches used in the model: see the caption of the figure. While in Stewart (1994) a Turing machine is simulated, in Herrmann and Margenstern (2003) and Margenstern (2006b), we simulate a register machine. It can be remarked that the smaller number of states in the dodecagrid is due to the replacement of crossings in the railway circuit by bridges, thanks to the third dimension, which is also possible in the hyperbolic case. Moreover, as a cell in the hyperbolic 3D space has 12 neighbors, there are much more combinations of states which can be used to differentiate the relevant steps of the computation. Now, the progress mentioned in the quoted results was made possible by a refinement in the implementation of the railway model. A first progress was to improve the implementation of the switches and the crossings. Note that in all these situations, there is a tile to which the ways on which the locomotive runs converge, called the center. Initially, the center was signalized by a specific color which had to change during the crossing by the locomotive. Later, this center was distinguished from the other cells of the path by its neighborhood. This allowed to reduce the initial 22 states to 9 of them only. Then, there was an improvement on the implementation of the tracks which constitute the larger part of the circuit. In the first implementations, the tracks had a specific color. Later, the cells of the tracks were signalized by a specific neighborhood. Figure 4 illustrates the idle configurations at the crossings and the switches in the circuit devised for a weakly universal cellular automaton in the heptagrid with four states (see Margenstern 2011b, 2013). In order to reach two states only, the tracks had to be revisited again: they became one way, which entailed deep changes in the switches. This was enough in the dodecagrid as there is no crossing there. For the plane, this was not

Cellular Automata in Hyperbolic Spaces W 0

1 E1

1 R 0

E0

Cellular Automata in Hyperbolic Spaces, Fig. 3 The basic element of the railway circuit. Three kinds of switches: on the ways from R to E1 and to E2, we have a fixed switch. In a passive crossing, from W to R, the locomotive is sent to R. From R, in an active passage, the locomotive goes to E1 or to E2, never to W. At W, we have a flip-flop switch. It is always crossed actively: from above W in the picture. Once crossed, the direction to which the locomotive is sent is changed. At R, we have a memory switch. It may be crossed actively or passively. The direction of the switch is given by the last passive crossings. The circuit contains one bit of information. When the locomotive arrives through R, it reads the bit: 0 if it is sent to E0, 1 if it is sent to E1. When the locomotive arrives through W, it rewrites the bit and changes it to its opposite value, thanks to the concatenation of the action of the flip-flop with that of the memory switch

enough. It was needed to revisit the implementation of crossings. In Margenstern (2013), they are replaced by roundabouts, exploiting the possibility with two states to distinguish between 0 and 1 (Fig. 5). An Intrinsically Universal HCA The intrinsically universal HCA is required to simulate any HCA in the same space. Of course, both the simulating HCA and the simulated one are required to work starting from finite configurations only. In Margenstern (2008a), two ingredients are used to achieve the simulation. One ingredient is the synchronization algorithm mentioned in section “On Specific Problems of Cellular Automata.” The second is the construction of scaled trees. The construction consists in building a new Fibonacci tree inside the tiling but with a constant distance k between two consecutive nodes on a same branch. It is not difficult to construct such a tree, which is illustrated by Fig. 6. The constant k is computed in such a way that a disk of radius k contains both an encoding of the

Cellular Automata in Hyperbolic Spaces

21

Cellular Automata in Hyperbolic Spaces, Fig. 4 Heptagrid and four states: the idle configurations at crossings and switches. From left to right: crossing, fixed switch, memory switch, and flip-flop. For the

memory switch and the flip-flop, we represented the lefthand side version only: the right-hand side ones can easily be devised from these ones

E

C

F

B

A

D

A

0

Cellular Automata in Hyperbolic Spaces, Fig. 5 Configuration at a roundabout in {13, 3}. Lefthand side: general view; right-hand side: zoom at a branching. Right-hand side picture. Arrival at a

roundabout, first branching: through E. Arrival at the second and third branching: through A. Exit through F at the third branching

initial configuration of the HCA to be simulated, say, A, and an encoding of the transition table of A. Figure 7 illustrates the mechanism of propagation of the scaled tree. Each step of the simulated HCA A is simulated by a cycle of steps of the simulating HCA U. The number of steps of U in a cycle is not constant. It may be increasing, especially if the simulated configuration is growing during its own computation. The synchronization algorithm of section “On Specific Problems of Cellular Automata” is used to delimit the stages into which a cycle is split. These stages are the reception of the current states of the neighbors of the simulated cell of A, for each simulating cell of U. When this is achieved, possibly at different times for each

simulating cell, the new state is determined, and it is installed in the appropriate region, controlled by the simulating cell. When this is performed, the cell waits until it is informed by its simulating sons that their step of computation is completed. When this is the case, the cells inform its father in the scaled tree that it finished its computation. Accordingly, when the central cell receives the message of completion from all its neighbors of the scaled tree, it knows that the computation of this step of A is finished. Then the comparison with the previous configuration is performed, thanks to a synchronization. Depending on the result of the comparison, the computation is stopped, if there was no difference, or it goes on, when a difference was noticed.

22

Cellular Automata in Hyperbolic Spaces

Cellular Automata in Hyperbolic Spaces, Fig. 6 A scaled tree by a factor 2

Cellular Automata in Hyperbolic Spaces, Fig. 7 Propagation of a scaled tree

Strong Universal HCAs with a Small Number of States The intrinsic cellular automaton of subsection “An Intrinsically Universal HCA” makes a natural transition to this subsection: that cellular automaton is strongly universal. It starts from a finite configuration, and it simulates a cellular automaton starting from a finite configuration. As mentioned in Margenstern (2008a), the number of states of such an automaton is enormous. Paper (Margenstern 2008a) does not even try to give an estimate to the number of states. In this section, we consider the possibility to devise a small strongly universal cellular automaton. A simple idea would be to implement a one-dimensional cellular automaton. This has

been performed in Margenstern (2010) for the weakly universal case. As underlined in that paper, the implementation of one dimensional into the pentagrid, the heptagrid, and the dodecagrid is easy if not almost trivial. Then, it is enough to implement the two-state weakly universal cellular automaton of Cook (2004) using the elementary cellular automaton defined by rule 110 (also see Wolfram et al. 2002). To reach strong universality, it is not that trivial: it is needed to go on an initial segment in such a way that the continuation of the segment remains a segment supported by the same line. It is also desirable that the continuation is performed at the same time as the computation itself. These constraints are satisfied in

Cellular Automata in Hyperbolic Spaces

Margenstern (2013a). Now, the problem was to find a small strongly universal cellular automaton on the line. In fact, as far as I know, such a cellular automaton does not exist. I thought that the cellular automaton with seven states constructed in Lindgren and Nordahl (1990) was such an automaton, but this is not the case for the following reason: This cellular automaton simulates a particular Turing machine which is not universal: what can only be said about it is that it has an undecidable halting problem. Note that this restriction was not known by the authors of Lindgren and Nordahl (1990) at the time of their paper, the automaton does not start its computation from a finite configuration. And so, in Margenstern (2013a), we first construct a strongly universal cellular automaton on the line with 14 states. Next, we implement this in a construction already defined in Margenstern et al. (2010b) and Margenstern (2013b). It turned out that the part of the working of the cellular automaton on the line which is performed after the halting of the simulated Turing machine can be replaced by a process which involves a single additional state. Moreover, a part of the constructing automaton can be obtained by using states of the one-dimensional cellular automaton. Eventually, we arrive at strongly universal cellular automata in the pentagrid, in the heptagrid, and in the dodecagrid, all of them with ten states (see Margenstern 2013a).

The Connection with Tiling Problems As usual, cellular automata have deep connections with tilings. This is probably the case with HCAs, although, up to now, the single connection is the possibility to implement them in the tilings, thanks to the coordinate system. However, this system itself appeared to be useful in order to investigate the properties of tilings in the hyperbolic plane and in the hyperbolic spaces of higher dimensions, namely, the dimensions 3 and 4.

23

Investigations in 3D and 4D Indeed, the splitting method could be applied to the tiling {5, 3, 4} of the hyperbolic 3D space (see Margenstern and Skordev (2003b) and Margenstern (2007c)). It turned out to be possible to use an old tool of the late nineteenth century, Schlegel diagrams, to both represent the tiles and the construction of the tiling as a process which is infinite in time. The application of the splitting method revealed an interesting property. The language of the splitting of this tiling provides us with a natural example of a language which is neither rational nor context free. As a corollary, the algorithm to compute the path from a tile to the root of its tree is cubic in time with respect to the size of the coordinate of the cell supported by the tile. The splitting method could also be applied to the tiling {5, 3, 3, 4} of the hyperbolic 4D space. It provides us with a simple system of coordinates to explore this tiling which is the natural extension of the tiling {5, 3, 4} of the hyperbolic 3D space. Note that the same process which allows to go from the pentagon with right angles to Poincare´’s dodecahedron also allows to go from that dodecahedron to the 120-cell. This process is called orthogonal completion in Margenstern (2004, 2007c). Together with an appropriate notion of interior and exterior, it allows to get a correct orientation in the hyperbolic 4D space and to correctly use the dimensional analogy with the spaces of lower dimension. The Tiling Problem The splitting method allowed the author to investigate the heptagrid rather deeply. This turned out to give him a way to solve a long pending problem: is the tiling problem decidable or not for the hyperbolic plane? This question was raised by Raphael Robinson in 1971 (see Robinson 1971), and it received a final negative answer with Margenstern (2008c) in 2008. The tiling problem asks whether there is an algorithm which, given a finite set of tiles called the prototiles, allows to say yes or no; it is possible to tile the plane with copies of the prototiles. In this setting, copies mean isometric images according the geometry of the space of the tiling. Also, it is understood

24

that if the tiles are decorated, a solution must satisfy the matching of any adjacent tiles along their common side. Robert Berger proved in 1966 (see Berger 1966) that the tiling problem is undecidable in the Euclidean plane. In Robinson (1971), Raphael Robinson significantly simplified Berger’s solution and raised the question about the status of the same problem for the hyperbolic plane. Robinson himself gave a partial answer, when the first tile is fixed, to this problem in 1978 (see Robinson 1978). A few weeks after the time when the result published in Margenstern (2008c) was announced (see Margenstern et al. 2007b), another solution of the same problem was claimed (see Kari 2007). The solution given in Margenstern (2008c) turned out to be very fruitful: the construction given in Margenstern (2008c) allows us to prove the undecidability of the periodic tiling problem (see Margenstern 2009a) and then the undecidability of the finite tiling problem (see Margenstern 2008e). Also, another important result was obtained by a refinement of the construction produced in Margenstern (2008c): the injectivity of the global function of a cellular automaton of the hyperbolic plane is also undecidable (see Margenstern 2009b). It also turned out that the classical theorems connecting the surjectivity of the global function of a cellular automaton with the injectivity and the injectivity on finite configurations are no more true for hyperbolic cellular automata (see Margenstern 2009c).

Possible Applications A few applications of the theory described in the previous sections were indicated, in particular in Margenstern (2008b). We mention three of them. Color Chooser The first one is a color chooser. It consists in a representation of the heptagrid in Poincare´’s disk, as illustrated by the left-hand side picture of Fig. 8. At each step, the user selects a neighbor v of the central cell. At the next time, v appears at the central place. The motion is repeated until the user finds out the color he/she wished.

Cellular Automata in Hyperbolic Spaces

In order to go back, an additional facility is given: a compass, in the form of a point which indicates the direction where the central cell lies when it is no more visible in the disk. If the user wants to go back to the central cell, it is enough to go to the direction of the compass as long as the central cell is no more visible in the disk. What can be seen is illustrated by the right-hand side picture of Fig. 8. A Japanese Keyboard for Cell Phones Another application deals with cell phones with a possible way to write messages in Japanese. The idea is based on the fact that the Japanese language has two syllabic alphabets, hiraganas and katakanas, for phonetic purpose. These syllabic alphabets are based on five vowels and the same series of consonants is used for each vowel. The corresponding syllabic signs are dispatched as indicated in Fig. 9. The use of the keyboard is similar to that of the color chooser. It can be noticed that any syllabic sign can be reached in at most three clicks on the keys. Communications in a Network The situation of Margenstern (2007a) was thoroughly studied in Margenstern (2012). The communication protocol described in Margenstern (2007a) was implemented in the heptagrid with an additional feature. In Margenstern (2007a), it was decided that the decision by a cell to send messages or to reply to messages it receives follows a Poisson law. Of course, the Poisson coefficients are different. In Margenstern (2012), in order to be more realistic, it was decided that a message sent by a cell cannot run forever at infinity. When it is sent, it is dispatched within a disk of radius r, where r is a randomly fixed integer again following a Poisson law. Two experiments where performed with a help of a simulation through a computer program. The difference between the experiments was the size of the expansion radius of a message and the coefficients of the Poisson laws followed by the different parameters. In Margenstern (2012), an account of both experiments is given. The experiments indicate that the model seems to be reasonable. See Margenstern (2012) for more details.

Cellular Automata in Hyperbolic Spaces

25

Cellular Automata in Hyperbolic Spaces, Fig. 8 Left-hand side: idle position of the color chooser. Middle: the user chooses to look at the blue colors. Right-hand side: the compass

Future Directions Interestingly, most problems indicated as a conclusion in the first edition of this entry received at least a partial solution in this second edition. Moreover, not indicated issues also received a solution, so that the hope written in the conclusion at that time that the method initiated by the implementation of cellular automata in hyperbolic spaces will help to improve the study of tilings in hyperbolic spaces turned out to be grounded. There are still problems, but we can say that the foundational work is almost completed. There are infinitely many tessellations in the hyperbolic plane. Each one is characterized by positive integers and no doubt that the arithmetical properties of these numbers play a key role. We just explored what can be roughly obtained for two or three couples of such numbers. Probably, much broader results can be obtained with a finer analysis of these arithmetic properties which may turn out to be useful for specific problems. As an example, it is argued in Margenstern (2008b) why, on the one hand, the heptagrid is more suited for the color chooser than the pentagrid and why, on the other hand, the pentagrid is more suited than the heptagrid for the Japanese keyboard. Let us hope that future investigations will comfort the possibilities offered by the infinitely many tessellations of the hyperbolic plane. Acknowledgment The author again thanks Andrew Adamatzky for giving him the task to write the first issue

Cellular Automata in Hyperbolic Spaces, Fig. 9 The Japanese keyboard

of this entry. He is also much in debt to Andrew Spencer for asking him this new version.

Bibliography Berger R (1966) The undecidability of the domino problem. Mem Am Math Soc 66:1–72 Chelghoum K, Margenstern M, Martin B, Pecci I (2004) Cellular automata in the hyperbolic plane: proposal for a new environment. Lect Notes Comput Sci 3305:678–687, proceedings of ACRI’2004, Amsterdam, October, 25–27, 2004

26 Cook M (2004) Universality in elementary cellular automata. Complex Syst 15(1):1–40 Fraenkel AS (1985) Systems of numerations. Am Math Mon 92:105–114 Gromov M (1981) Groups of polynomial growth and expanding maps. Publ Math l’IHES 53:53–73 Hedlund G (1969) Endomorphisms and automorphisms of shift dynamical systems. Math Syst Theory 3:320–375 Herrmann F, Margenstern M (2003) A universal cellular automaton in the hyperbolic plane. Theor Comp Sci 296:327–364 Iwamoto Ch, Margenstern M (2003) A survey on the complexity classes in hyperbolic cellular automata. Proceedings of SCI’2003, V, pp 31–35 Iwamoto Ch, Margenstern M, Morita K, Worsch Th (2002) Polynomial-time cellular automata in the hyperbolic plane accept exactly the PSPACE languages. SCI’2002. Orlando, pp 411–416 Kari J (2007) The tiling problem revisited. Lect Notes Comput Sci 4664:72–79 Lindgren K, Nordahl MG (1990) Universal computations in simple one-dimensional cellular automata. Complex Syst 4:299–318 Margenstern M (2000) New tools for cellular automata in the hyperbolic plane. J Univ Comp Sci 6(12):1226–1252 Margenstern M (2002a) A contribution of computer science to the combinatorial approach to hyperbolic geometry, SCI’2002, 14–19 July 2002. Orlando Margenstern M (2002b) Revisiting Poincare´’s theorem with the splitting method, talk at Bolyai’200, International Conference on Geometry and Topology, ClujNapoca, Romania, 1–3 October 2002 Margenstern M (2003) Implementing cellular automata on the triangular grids of the hyperbolic plane for new simulation tools, ASTC’2003. Orlando, 29 Mar- 4 Apr Margenstern M (2004) The tiling of the hyperbolic 4D space by the 120-cell is combinatoric. J Univ Comp Sci 10(9):1212–1238 Margenstern M (2006a) A new way to implement cellular automata on the penta- and heptagrids. J Cell Autom 1(1):1–24 Margenstern M (2006b) A universal cellular automaton with five states in the 3D hyperbolic space. J Cell Autom 1(4):317–351 Margenstern M (2007a) On the communication between cells of a cellular automaton on the penta- and heptagrids of the hyperbolic plane. J Cell Autom (to appear) Margenstern M (2007b) About the domino problem in the hyperbolic plane, a new solution. arXiv:cs/0701096, (Jan 2007), p 60 Margenstern M (2007c) Cellular automata in hyperbolic spaces, theory, vol 1. Old City Publishing, Philadelphia, 422p Margenstern M (2008a) A uniform and intrinsic proof that there are universal cellular automata in hyperbolic spaces. J Cell Autom 3(2):157–180

Cellular Automata in Hyperbolic Spaces Margenstern M (2008b) Cellular automata in hyperbolic spaces, volume 2, implementation and computation. Old City Publishing, Philadelphia, 360p Margenstern M (2008c) The domino problem of the hyperbolic plane is undecidable. Theor Comp Sci 407:29–84 Margenstern M (2008d) On a characterization of cellular automata in tilings of the hyperbolic plane. Int J Found Comp Sci 19(5):1235–1257 Margenstern M (2008e) The finite tiling problem is undecidable in the hyperbolic plane. Int J Found Comp Sci 19(4):971–982 Margenstern M (2009a) The periodic domino problem is undecidable in the hyperbolic plane. Lect Notes Comput Sci 5797:154–165 Margenstern M (2009b) The injectivity of the global function of a cellular automaton in the hyperbolic plane is undecidable. Fundam Inform 94(1):63–99 Margenstern M (2009c) About the garden of Eden theorems for cellular automata in the hyperbolic plane. Electron Notes Theor Comp Sci 252:93–102 Margenstern M (2010a) A weakly universal cellular automaton in the hyperbolic 3D space with three states. Discrete Mathematics and Theoretical Computer Science. Proceedings of AUTOMATA’2010, pp 91–110 Margenstern M (2010b) Towards the frontier between decidability and undecidability for hyperbolic cellular automata. Lect Notes Comput Sci 6227:120–132 Margenstern M (2010c) An upper bound on the number of states for a strongly universal hyperbolic cellular automaton on the pentagrid, JAC’2010, 15–17 Dec 2010. Turku, Finland, Proceedings, Turku Center for Computer Science 2010. ISBN 978-952-12-2503-1, 168-179 Margenstern M (2011a) A new weakly universal cellular automaton in the 3D hyperbolic space with two states. Lect Notes Comput Sci 6945:205–2017 Margenstern M (2011b) A universal cellular automaton on the heptagrid of the hyperbolic plane with four states. Theor Comp Sci 412:33–56 Margenstern M (2012) A protocol for a message system for the tiles of the heptagrid, in the hyperbolic plane. Int J Satell Commun Policy Manag 1(2–3):206–219 Margenstern M (2013a) Small universal cellular in hyperbolic spaces, a collection of jewels. Emergence, Complexity and Computation, Springer, p 320 Margenstern M (2013b) About strongly universal cellular automata. Proceedings of MCU’2013, (2013) EPTCS 128, 93–125 Margenstern M, Morita K (1999) A polynomial solution for 3-SAT in the space of cellular automata in the hyperbolic plane. J Univ Comput Syst 5:563–573 Margenstern M, Morita K (2001) NP problems are tractable in the space of cellular automata in the hyperbolic plane. Theor Comp Sci 259:99–128 Margenstern M, Skordev G (2003a) The tilings {p, q} of the hyperbolic plane are combinatoric, SCI’2003, V, pp 42–46

Cellular Automata in Hyperbolic Spaces Margenstern M, Skordev M (2003b) Tools for devising cellular automata in the hyperbolic 3D space. Fundam Inform 58(2):369–398 Margenstern M, Song Y (2008) A universal cellular automaton on the ternary heptagrid. Electron Notes Theor Comp Sci 223:167–185 Margenstern M, Song Y (2009) A new universal cellular automaton on the pentagrid. Parallel Process Lett 19(2):227–246 Morgenstein D, Kreinovich V (1995) Which algorithms are feasible and which are not depends on the geometry of space-time. Geombinatorics 4(3):80–97

27 Martin B (2005) VirHKey: a virtual hyperbolic keyboard with gesture interaction and visual feedback for mobile devices, MobileHCI’05, Sept. Salzburg Robinson RM (1971) Undecidability and nonperiodicity for tilings of the plane. Invent Math 12:177–209 Robinson RM (1978) Undecidable tiling problems in the hyperbolic plane. Invent Math 44:259–264 Ro´ka Z (1994) One-way cellular automata on Cayley graphs. Theor Comp Sci 132:259–290 Stewart I (1994) A subway named turing, mathematical recreations in scientific American. pp 90–92 Wolfram S (2002) A new kind of science. Wolfram Media

Structurally Dynamic Cellular Automata Andrew Ilachinski Center for Naval Analyses, Alexandria, VA, USA

Article Outline Glossary Deﬁnition of the Subject Introduction The Basic Model Emerging Patterns and Behaviors SDCA as Models of Computation Generalized SDCA Models Related Graph Dynamical Systems SDCA as Models of Fundamental Physics Future Directions and Speculations Bibliography

Glossary Adjacency matrix The adjacency matrix of a graph with N sites is an N N matrix [aij] with entries aij = 1 if i and j are linked, and aij = 0 otherwise. The adjacency matrix is symmetric (aij = aji) if the links in the graph are undirected. Coupler link rules Coupler rules are local rules that act on pairs of next-nearest sites of a graph at time t to decide whether they should be linked at t + 1. The decision rules fall into one of three basic classes – totalistic (T), outer-totalistic (OT) or restricted-totalistic (RT) – but can be as varied as those for conventional cellular automata. Decoupler link rules Decoupler rules are local rules that act on pairs of linked sites of a graph at time t to decide whether they should be unlinked at t + 1. As for coupler rules, the decision rules fall into one of three basic classes – totalistic (T), outer-totalistic (OT) or

restricted-totalistic (RT) – but can be as varied as those for conventional cellular automata. Degree The degree of a node (or site, i) of a graph is equal to the number of distinct nodes to which i is linked, and where the links are assumed to possess no directional information. In general graphs, the in-degree (= number of incoming links towards i) is distinguished from the out-degree (= number of outgoing links originating at i). Effective dimension A quantity used to approximate the dimensionality of a graph. It is deﬁned as the ratio between the average number of next-nearest neighbors to the average degree, both averaged over all nodes of the graph. The effective dimension equals the Euclidean dimension d, in cases where the graph is the familiar d-dimensional hypercubic lattice. Graph A graph is a ﬁnite, nonempty set of nodes (referred to as “sites” throughout this article), together with (a possibly empty) set of edges (or links). The links may be either directed (in which case the edge from a site i, say, is directed away from i toward another site j, and is considered distinct from another directed edge originating at j and pointed toward i) or undirected (in which case if a link exists between sites i and j it carries no directional information). Graph grammar Graph grammars (sometimes also referred to as graph rewriting systems) apply formal language theory to networks. Each language speciﬁes the space of “valid structures”, and the production (or “rewrite”) rules by which given graphs may be transformed into other valid graphs. Graph metric function The graph metric function deﬁnes the distance between any two nodes, i and j. It is equal to the length of the shortest path between i and j. If no path exists (such as when i and j are on two disconnected components of the same graph), the distance is assumed to be equal to 1.

# Springer-Verlag 2009 A. Adamatzky (ed.), Cellular Automata, https://doi.org/10.1007/978-1-4939-8700-9_528 Originally published in R. A. Meyers (ed.), Encyclopedia of Complexity and Systems Science, # Springer-Verlag 2009 https://doi.org/10.1007/978-0-387-30440-3_528

29

30

Graph-rewriting automata Graph-rewriting automata are generalized CA-like systems in which both (the number of) nodes and links are allo wed to change. Next-nearest neighbor Two sites i and j are next-nearest neighbors in a graph if (1) they are not directly linked (so that aij = 0; see adjacency matrix), and (2) there exists at least one other site k such that k 2 = {i, j}, and i and j are both lined to k. Random dynamics approximation The longterm behavior of structurally dynamic cellular automata may be approximated in certain cases (in which the structure and value conﬁgurations are both sufﬁciently random and uncorrelated) by a random dynamics approximation: values of sites are replaced by the probability ps of a site having value s (and is assumed to be equal for all sites), and links between sites are replaced by the probability p‘ of being linked (and also assumed to be the same for all pairs of sites). The approximation often yields qualitatively correct predictions about how the real system evolves under a speciﬁc set of rules; for example, to predict whether one expects unbounded growth or that the lattice will eventually settle onto a low periodic state or simply decay. Restricted totalistic rules Restricted totalistic rules are a generalized class of link rules (operating on pairs of sites, i and j), analogous to “outer totalistic” rules (that operate on site values) used in conventional CA. The local neighborhood around i and j is ﬁrst partitioned into three sets: (1) the two sites, i and j; (2) sites connected to either i or j, but not both; and (3) sites connected to both i and j. The restricted totalistic rule is then completely deﬁned by associating a speciﬁc action with each possible 3-tuple of site-value sums (where the individual components represent a unique sum in each of the three neighborhoods). Structurally dynamic cellular automata Structurally dynamic cellular automata are generalizations of conventional cellular automata models in which the underlying lattice structure is dynamically coupled to the local site-value conﬁgurations.

Structurally Dynamic Cellular Automata

SDCA model hierarchy The SDCA model hierarchy is a set of eight related structurally dynamic cellular automata models, deﬁned explicitly for studying their formal computational capabilities. The hierarchy is ordered (from lowest to highest level) according to their relative computational strength. For example, the SDCA model at the top of the hierarchy is capable of simulating a conventional CA with a speedup factor of two.

Definition of the Subject Structurally dynamic cellular automata (abbreviated, SDCA) are a generalized class of CA in which the topological structure of the (usually quiescent) underlying lattice is dynamically coupled to the local site value conﬁguration. The coupling is deﬁned to treat geometry and value conﬁgurations on an approximately equal footing: the lattice structure is altered locally as a function of individual site neighborhood valuestates and geometries, while the underlying local topology supports site-value evolution precisely as in conventional nearest-neighbor CA models deﬁned on random lattices. SDCA provide a dynamical framework for a CA-like analysis of the generation, transmission and interaction of topological disturbances in a lattice. Moreover, they provide a natural testbed for studying self organized geometry; by which we mean true structural evolution, and not merely space-time patterns of value conﬁgurations that may be interpreted geometrically (but are really just “bits” of information overlayed on top of an otherwise static background lattice).

Introduction SDCA were formally introduced in 1986 as part of a physics doctoral dissertation by Ilachinski (1988), and developed further by Ilachinski and Halpern (1987a, b), Halpern (1989, 1996), Halpern and Caltagirone (1990), Majercik (1994), and Alonso-Sanz and Martín (2006), Alonso-Sanz (2006, 2007); in their original

Structurally Dynamic Cellular Automata

incarnation (Ilachinski 1986), and at least two subsequent papers (Halpern and Caltagirone 1990; Rose 1993), SDCA were called topological automata. Pedagogical discussions appear in Adamatzky (1995) and Ilachinski (2001). Extensions of the basic SDCA model (all discussed in this article) include the addition of probabilistic rules, memory and reversibility. Applications include the simulation of crystal growth (Krivovichev 2004), the study of pattern formation of random cellular structures (Schliecker 1998), modeling synaptic plasticity in neural network models (Gerstner and Kistler 2002), phase transitions in chemical systems (Rose et al. 1994), chemical self-assembly (Hasslacher and Meyer 1998), and generegulatory networks (Halpern and Caltagirone 1990). Majercik (1994) hasstudied SDCA as generalized models of computation, and describes a CA-universal SDCA that can simulate any conventional CA of the same dimension. More recently, O’Sullivan (2001) and Saidani (2003, 2004) have used graph-based CA models similar to SDCA to study urban dynamics and emergent behaviors of self-reconﬁgurable robots, respectively. Tomita et al. (2002, 2005, 2006a, b, c) have introduced graph-rewriting automata in which both links and (the number of) nodes are allowed to change; and show that these systems are capable of both self-replication and Turing universality (among with many other emergent behaviors). Since SDCA provide the basic formalism for describing locally induced topological changes within arbitrary graphs, they are a potentially powerful general tool for studying complex adaptive networks, such as communication and social networks (Alonso-Sanz and Martin 2006). The concept behind SDCA has also been used as a foundation for philosophical musings about computationally emergent artiﬁciality (Mustafa 1999). More ambitious applications of SDCA encroach on fundamental physics. Because SDCA are inherently self-modifying systems – in which physical events are not just dynamically coupled to, but are an integral part of the spatiotemporal arena on which their transformations are deﬁned – they are a potentially powerful methodological and ontological tool for exploring

31

discrete pre-geometric theories of space-time (Meschini et al. 2005). Just as “value structure” solitons are ubiquitous in conventional CA models (Ilachinski 2001; Wolfram 1984), “link structure” solitons might emerge in SDCA; physical particles would, in such a scheme, be viewed asgeometrodynamic disturbances propagating within a dynamic lattice. Three SDCA-like theories of pregeometry have recently been proposed in which space-time is a self-organized emergent construct: Hillman (1995), Nowotny and Requardt (2006) and Wolfram (2002). Finally, we brieﬂy comment on ostensible overlaps between SDCA and four other related ﬁelds of study: (1) Lindenmeyer (or L-) systems, (2) graph grammars, (3) random graphs (abbreviated, RG), and (4) dynamic network analysis (abbreviated, DNA). L-systems (Prusinkiewicz and Lindenmayer 1990) are generalized CA systems in which the number of sites can grow with time, and consist of recursive rules for rewriting strings of symbols. If interpreted graphically, abstract symbol strings can be used to model growth processes of plants and evolving morphology of physical organisms. Graph grammars (Grzegorz 1997; Kniemeyer et al. 2004) apply formal language theory to networks, and consist of production rules that deﬁne the set of “valid structures” in a given graph language. The study of RG (Durrett 2006) was introduced by Erdos and Renyi in the late 1950s (Erdos and Renyi 1960), and is a mathematical framework for exploring the general topological structures of computational systems and the behavior of certain random dynamical systems. Like SDCA, RG describes evolving graphs, but the dynamics are global and random. DNA (Mendes 2004; Newman et al. 2006) is an emerging ﬁeld that fuses traditional social network theory with statistical analysis and modeling; part of its charter is to explore general properties of network generation and evolution. While, conceptually speaking, there is a prima facie relationship between SDCA and all four ﬁelds of study, the elucidation of a more precise nature of the relationship between SDCA and these other systems awaits a future study. (The relationship appears particularly strong between SDCA and a generalized L-system called the

32

Structurally Dynamic Cellular Automata

graph development system (abbreviated, GDS), introduced by Doi (1984), but not developed further since its original conception. Using incidence matrices to represent arbitrary topologies, GDS is essentially a grammar by which sub matrices of the whole matrix are rewritten to describe topological changes. SDCA also formally falls under the broader rubrics of DNA and RG; however, there is no explicit reference to SDCA in the current literature of either ﬁeld.)

The Basic Model Conventional CA are deﬁned on ﬁxed, and typically regular, lattices (one-dimensional lines, twodimensional Euclidean or hexagonal grids, etc.), the sites of which are populated with discrete-valued dynamic elements ( si {0, 1, . . ., k}, where i labels a particular site on the lattice) that evolve 0 according to local transition functions, f : si ! si . We emphasize that the dynamics of conventional CA are conﬁned to the temporal evolution of the sis. SDCA generalize conventional CA in two ways: (1) they relax the assumption that the underlying lattice is uniform, allowing the local site $ site connectivity pattern to vary throughout the lattice; and (2) they allow both the set {si} and the lattice to evolve according to local transition rules. The most obvious – also the most dramatic – conceptual change this entails over the dynamics of conventional CA, is that the meaning of “local” itself changes as a function of how the SDCA system evolves: previously far separated sites may become neighbors; and sites that are local at time t may become far separated at some later time, t0. To properly deﬁne SDCA, we ﬁrst generalize regular lattices to mathematical graphs G () possessing arbitrary topology. Assuming G has N lattice sites, and that G is (for now) an undirected graph (meaning that none of G’s links carry directional information), G is completely deﬁned by the N-by-N adjacency matrix, ‘ij: ‘ij ¼

1 0

if i and j are linked; otherwise:

Using the graph metric function,

(1)

Dij ¼ Minimum #links, l rs j fr,sg Pij , Paths,Pij

(2)

we can write a general r-neighborhood CA value-transition rule ‘f’ (which will from now on refer generically to as a s-rule) in the form stþ1 ¼f i

hn o i stj j j S G r ðiÞ ,

(3)

where S G r ðiÞ ¼ jj Dij r is the radius-r graph sphere about the site i. In words, the value of stþ1 i is some function, f, of the values stj in radius r graph sphere around the site i. With this distance measure, G becomes a discrete metric space. If G is a one-dimensional line, and r = 1, then SG r ðiÞ ¼ fi 1,i, i þ 1g ; i.e., it is equal to the conventional three site local neighborhood of elementary CA. We now formally extend a conventional CA’s dynamic arena – limited to the values sti f0,1, . . . , k 1g , i = 1,. . .,N – to one that includes the components of theunderlying lattice’s adjacency matrix:

stþ1 ‘tþ1

¼ F s ½fst g, f‘t g , ¼ F ‘ ½fst g, f‘t g

(4)

where Fs and F‘ are some functions (to be deﬁned explicitly below) that explicitly couple the changing value states and geometries. The complete system at time t is speciﬁed by the state-vector n o jGit ¼ st1 , . . . , stN ; ‘tij :

(5)

The time-evolution of |Gi proceeds according to the following transition rules: (i) s-rules of the general form given above and familiar from CA simulations and (ii) ‘-rules, which are divided into site couplers, linking previously unconnected vertices and site decouplers, which disconnect linked points. Because the topology can be altered only by either a deletion of existing links or an addition of links between pairs of vertices ‘i’ and ‘j’ with Dij = 2, the dynamics is strictly local. To be more precise, we ﬁrst restrict the general s-rule F1 to (maximally symmetric) totalistic (T) and outer-totalistic (OT) type. Since the underlying

Structurally Dynamic Cellular Automata

33

lattice is a fully dynamic object, |Gi will, in general, tend towards having a complex local geometry with an unspeciﬁed local directionality. The most general rules which can therefore be applied are those which are completely invariant under all rotation and reﬂection symmetry transformations on local neighborhoods. T(OT) s-rules are then speciﬁed by listing particular sums{a}(outer-sums{a0},{a1} corresponding to center site values ‘0’ and ‘1’ respectively) for which the value of the center sitebecomes ‘1’. Formally, ! X t t t tþ1 si ¼ ffag ‘ij sj , si , (6) j

where ffag ðx,aÞ P $T a dðx þ a,aÞ P P ¼ a a1 dðx,a1 Þ þ ð1 aÞ a0 dðx, a0 Þ $ OT, (7) P and d(x, y) is the Kronecker delta. Note that j ‘tij stj sums the values of all sites ‘j’ linked to ‘i’ at time ‘t’. The action on the state |Gi is represented by b i jsi f t fag X

t t t t t ‘ ¼ s1 ,...,stþ1 ¼ f s ,s a f g ij j i ,...,sN , i (8)

b i acting on the where we distinguish the operator f global value state from the actual local transition function f which transforms each site value. Link Rules Local geometry altering rules are constructed by direct analogy: for any two selected sites i and j we restrict attention to site values of vertices contained within a 1-sphere of either site; that is, to all k S1(i, j) = S1(i) [ S1(j). Link operators, whose action on the state is represented by: E E b ij ‘t ¼ ‘t ,...,‘tþ1 ¼ cij ,...,‘t decouplers : c 11 ij NN fbg ij

E E t ij b feijg ‘tij ¼ ‘t11 ,...,‘tþ1 couplers : o ¼ o ,...,‘ ij NN , (9) either link or unlink two sites ‘i’ and ‘j’ depending on whether the actual sum of values in S1(i, j) matches any of those given in the {b} or {e} lists, which completely deﬁne decouplers and couplers, respectively. In order to construct classes of rules analogous to the two types of s-rules deﬁned above, we partition the local neighborhood into 3 disjoint sets (see Fig. 1): S1(i, j) = Vij [ Aij [ Bij, where 8 < _ij ¼ fi,jg, Aij ¼ fkjk C 1 ðiÞ\C 1 ðjÞg,where C 1 ðiÞ ¼ S 1 ðiÞ fig, : Bij ¼ S 1 ðiÞ[S 1 ðjÞ_ij Aij :

(10)

Structurally Dynamic Cellular Automata, Fig. 1 Neighborhood partitioning. In the same way as outer sites can be considered separately for s-transitions, we may, for topology transitions, distinguish between those sites belonging to both i and j( Aij) and those

belonging to one of the two sites but not both ( Bij). In this way we obtain the analogous totalistic (T), outertotalistic (OT), and an additional type called restricted totalistic (RT)

34

Structurally Dynamic Cellular Automata

The action of link operators is then conveniently expressed as a function of the sums within the individual partitions. Deﬁning nij = si + sj, aij P P ¼ k Aij sk , and bij ¼ k Bij sk , we get decouplers, cijfbg ¼ cijfbg nij , aij , bij , where cijfbg ðx,y,zÞ

P 8 1 k dðx þ y þ z,bk Þ ‘ij > > o > : 1 P d x, b ‘ij 1,k d y, b2,k d z, b3,k k

$T $ OT $ RT,

(11) and couplers, oijfeg

• RT rules are completely speciﬁed by giving the ‘k’ 3-tuples of values (xsi + sj, y = sum in A, z = sum in B), for which the link operation between ‘i’ and ‘j’ is to be performed. For example, deﬁne ‘c’ by unlinking ‘i’ and ‘j’ for the following values of partitioned sums: (0, 0, 1), (0, 0, 2), (0, 1, 1), (1, 1, 1); we then have that (b1,1 = 0, b2,1 = 0, b3,1 = 1), (b1,2 = 0, b2,2 = 0, b3,2 = 2), (b1,3 = 0, b2,3 = 1, b3,3 = 1), and (b1,4 = 0, b2,4 = 1, b3,4 = 1).

¼ oijfeg nij , aij , bij , where

oijfeg ðx,y,zÞ

8 P $T < dDij ,2 Pk dðx þ y þ z, ek Þ ¼ dDij ,2 Pk dx, e1,k dy þ z, e2,k $ OT : $ RT: d Dij ,2 k d x, e1,k d y, e2,k d z, e3,k

(12) In the above expressions, RT stands for restricted totalistic rules which maximally subdivide the local neighborhood. The inclusion of an ‘ij in the expressions for c assures that only those sites already linked can be decoupled and the d(Dij, 2) in the equations deﬁning o are put in to make sure that only sites separated by distance = 2 may be dynamically coupled. The three type-speciﬁc sums appearing above are indexed with the following conventions: • T rules are deﬁned by the ‘k’ overall sums of values in S1(i, j) for which the particular action is to be taken. For example, deﬁne ‘c’ by unlinking ‘i’ and ‘j’ if the total sum =1 (=b1), 3 (=b2) or 5 (=b3). Equation (11) then ¼ 0 if and only if ‘nij ¼ 1 and states that ‘nþ1 ij nnij þ anij þ bnij f1,3,5g. • OT rules are speciﬁed by giving ‘k’ 2-tuples (b1,k, b2,k), and (e1,k, e2,k), where {1, k} labels the sum ‘si + sj’ and {2, k} labels the P corresponding outer sum¼ s S 1 ði,jÞfi,jg ss . For example, link ‘i’ and ‘j’ if si + sj = 0 and outer sum = {3, 4}, so that ‘o’ is deﬁned by listing the two 2-tuples (e1,10, e2,1 = 3) and (e1,2 = 0, e2,2 = 4).

Global transition operators are obtained by applying individual s- and ‘- operators to all sites and site-pairs in the graph G: 8 i Q > < Fbfag jsi ¼ i fbfag jsi, Q cfbg j‘i ¼ bi C nij cfbg j‘i, > Q :c O feg j‘i ¼ nnij obfei g j‘i,

(13)

cneed to be taken cand O where the products for C only over nearest and next nearest pairs respectively. Given the full value-topology transition rule G, deﬁned by cF c jGi ¼ G jGi , jGtþ1 i ¼ Ob C t t

(14)

the fundamental problem is to understand the generic behavior of accessible graphs-G emerging from all possible initial structures and value conﬁgurations. We emphasize that the lattice fully participates in the dynamics and that, in general, no embedding is implied – it is the abstract connectivity itself whose evolution we are attempting to trace.

An Example The application of the rather cumbersome expressions deﬁning transition rules is in practice extremely straightforward, as we demonstrate with the following example: Consider a graph G deﬁned as a (5 5) lattice with some distribution of values s = 1 at time ‘t = 1’ (see Fig. 2). We are interested in one global update of the system G jGit¼1 ! jGit¼2 with rules speciﬁed by

Structurally Dynamic Cellular Automata

35

Structurally Dynamic Cellular Automata, Fig. 2 Sample dynamic update of a (5 5) lattice from t = 1 to t = 2, obeying a T-type s-rule with s ! s0 for local sums =1,3,5 (i.e. a {1, 3, 5}), and OT-type ‘-rules: (i) link for {e1,1 = 1, e2,1 = 3} and (ii) unlink for {b1,1 = 1, b2,1 = 3} and {b1,2 = 1, b2,2 = 4}. Solid sites indicate that s = 1

8 Ffag : fagT ¼ fa8 1¼ > 1,a2 ¼ 3,a3 ¼ 5g, 9 > > > < b1,1 ¼ 1,b2,1 ¼ 3 = < , ðtopologyÞ Cfbg : fbgOT ¼ : b ¼ 1,b ¼ 4 ; > > 1,2 2,2 > > : Ofeg : fegOT ¼ e1,1 ¼ 1,e2,1 ¼ 3 : ðvalueÞ

t¼1 t¼1 t¼1 ¼ c st¼1 þ st¼1 ‘t¼2 ch c h , sb þ sd þ sg t¼1 t¼1 þst¼1 ‘ch i ; þsm ¼ cð1,3Þð1Þ ¼ 0: (17)

(15) We evolve the system by systematically sweeping through all sites, linked pairs, and next-nearest neighbors: 1. All Sites: . . . setting si = 1 only at those ‘i’ for which the sum of the values at ‘i’ and its neighbors is equal to ‘2’ at t = 1. By “neighbors” of any point ‘i’ we will always mean the set of vertices linked to ‘i’: (a, b), (h, m) and (x, y), for example, are all neighbors at t = 1. Writing out a few value-changing terms explicitly, we ﬁnd that

3. All next-nearest neighbors ‘i’ and ‘j’: . . . linking them only if the 2-tuple (a, b) = {(1, 3)}. By “next-nearest neighbor” we mean those pairs which are themselves unlinked but which share at least one other linked neighbor: (a, g), (h, r) and (w, y), for example, are all next-nearest neighbors at t = 1. For ‘c’ and ‘g’ we ﬁnd t¼1 t¼1 t¼1 t¼1 ‘t¼2 þ st¼1 cg ¼ o sc g , sb þ sd þ sf t¼1 d Dcg ,2 þ st¼1 h þ sl ¼ oð1,3Þð1Þ ¼ 1: (18)

st¼2 c

t¼1 t¼1 ¼ f st¼1 þ st¼1 b þ sc d þ sh

st¼2 b

¼ fð3Þ ¼ 1, and t¼1 t¼1 t¼1 ¼ f st¼1 þ s þ s þ s a b c g

(16)

¼ fð2Þ ¼ 0: 2. All linked pairs of sites ‘i’ and ‘j’: . . . removing those links only if the 2-tuple (a, b) {(1, 3), (1, 4), where a = si + sj and ‘b’ is the sum of values of the neighbors of ‘i’ and ‘j’ at t = 1. For the points ‘c’ and ‘h’, for example, we have (a, b) = (1, 3), so that the link ‘ch is no longer present in |Git = 2:

t¼2 Notice that although ‘t¼1 dn ¼ 0 ! ‘dn ¼ 1, it is hidden by overlap with the remaining links ‘t¼2 di ¼ 1 and ‘t¼2 in ¼ 1 . For this reason, not all link changes can always be observed directly in the following ﬁgures. Other sites and links are updated in precisely the same manner. Had the link-rules been of T-type, only one sum would have to be considered: the sum of the values of the points in question along with their neighbors’ values. Had they been, instead, of RT-type, three sums would have to be considered: the sum of the values of the sites in question, the sum of the values of their common neighbors (neighborhood A in Fig. 1) and the sum

36

Structurally Dynamic Cellular Automata

of the values of the points that are neighbors of one of the considered points, but not of the other (neighborhood B in Fig. 1). The ﬁnal state |Git = 2 emerges after the above process has been applied concurrently to all pairs, neighbors and nextnearest neighbors in |Git = 1. Comments We conclude this section by making a few important general comments: Comment 1. As deﬁned above, G consists of three operators acting simultaneously on the state |Gi. More generally, one may prescribe any of 10 possible time-orderings to the operators O,C and F. That is, specify certain intermediate state dependencies, so that, for example G1|Gi (OC)(F|Gi) would in general be expected to yield results different from, say, G2|Gi O(F(C|Gi)). While we will be solely concerned with the synchronous time ordering deﬁned above, we do not expect the qualitative results to depend critically on this choice. Comment 2. A given rule G is completely deﬁned by the set of sums {a},{b} and {e}. Alternatively, we can conveniently summarize a chosen transition rule by its vector-code !

C ¼ ðc½f, c½c, c½oÞa,b , where (P c½f ¼

P

a2

a

P

2a0 þ a1 2ð2a1 þ1Þ a0 2 8P bk > > k2 >

Andrew Adamatzky Editor

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

Encyclopedia of Complexity and Systems Science Series Editor-in-Chief Robert A. Meyers

The Encyclopedia of Complexity and Systems Science Series of topical volumes provides an authoritative source for understanding and applying the concepts of complexity theory together with the tools and measures for analyzing complex systems in all ﬁelds of science and engineering. Many phenomena at all scales in science and engineering have the characteristics of complex systems, and can be fully understood only through the transdisciplinary perspectives, theories, and tools of self-organization, synergetics, dynamical systems, turbulence, catastrophes, instabilities, nonlinearity, stochastic processes, chaos, neural networks, cellular automata, adaptive systems, genetic algorithms, and so on. Examples of near-term problems and major unknowns that can be approached through complexity and systems science include: the structure, history, and future of the universe; the biological basis of consciousness; the integration of genomics, proteomics, and bioinformatics as systems biology; human longevity limits; the limits of computing; sustainability of human societies and life on earth; predictability, dynamics, and extent of earthquakes, hurricanes, tsunamis, and other natural disasters; the dynamics of turbulent ﬂows; lasers or ﬂuids in physics; microprocessor design; macromolecular assembly in chemistry and biophysics; brain functions in cognitive neuroscience; climate change; ecosystem management; trafﬁc management; and business cycles. All these seemingly diverse kinds of phenomena and structure formation have a number of important features and underlying structures in common. These deep structural similarities can be exploited to transfer analytical methods and understanding from one ﬁeld to another. This unique work will extend the inﬂuence of complexity and system science to a much wider audience than has been possible to date. More information about this series at https://link.springer.com/bookseries/ 15581

Andrew Adamatzky Editor

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

With 425 Figures and 20 Tables

Editor Andrew Adamatzky Unconventional Computing Centre University of the West of England Bristol, UK

ISBN 978-1-4939-8699-6 ISBN 978-1-4939-8700-9 (eBook) ISBN 978-1-4939-8701-6 (print and electronic bundle) https://doi.org/10.1007/978-1-4939-8700-9 Library of Congress Control Number: 2018947853 # Springer Science+Business Media LLC, part of Springer Nature 2018 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, speciﬁcally the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microﬁlms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a speciﬁc statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. The publisher, the authors, and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors give a warranty, express or implied, with respect to the material contained herein or for any errors or omissions that may have been made. The publisher remains neutral with regard to jurisdictional claims in published maps and institutional afﬁliations. This Springer imprint is published by the registered company Springer Science+Business Media, LLC part of Springer Nature. The registered company address is: 233 Spring Street, New York, NY 10013, U.S.A.

Series Preface

The Encyclopedia of Complexity and System Science Series is a multivolume authoritative source for understanding and applying the basic tenets of complexity and systems theory as well as the tools and measures for analyzing complex systems in science, engineering, and many areas of social, ﬁnancial, and business interactions. It is written for an audience of advanced university undergraduate and graduate students, professors, and professionals in a wide range of ﬁelds who must manage complexity on scales ranging from the atomic and molecular to the societal and global. Complex systems are systems that comprise many interacting parts with the ability to generate a new quality of collective behavior through selforganization, e.g., the spontaneous formation of temporal, spatial, or functional structures. They are therefore adaptive as they evolve and may contain self-driving feedback loops. Thus, complex systems are much more than a sum of their parts. Complex systems are often characterized as having extreme sensitivity to initial conditions as well as emergent behavior that are not readily predictable or even completely deterministic. The conclusion is that a reductionist (bottom-up) approach is often an incomplete description of a phenomenon. This recognition that the collective behavior of the whole system cannot be simply inferred from the understanding of the behavior of the individual components has led to many new concepts and sophisticated mathematical and modeling tools for application to many scientiﬁc, engineering, and societal issues that can be adequately described only in terms of complexity and complex systems. Examples of Grand Scientiﬁc Challenges which can be approached through complexity and systems science include: the structure, history, and future of the universe; the biological basis of consciousness; the true complexity of the genetic makeup and molecular functioning of humans (genetics and epigenetics) and other life forms; human longevity limits; uniﬁcation of the laws of physics; the dynamics and extent of climate change and the effects of climate change; extending the boundaries of and understanding the theoretical limits of computing; sustainability of life on the earth; workings of the interior of the earth; predictability, dynamics, and extent of earthquakes, tsunamis, and other natural disasters; dynamics of turbulent ﬂows and the motion of granular materials; the structure of atoms as expressed in the Standard Model and the formulation of the Standard Model and gravity into a Uniﬁed Theory; the structure of water; control of global infectious diseases; and also evolution and quantiﬁcation of (ultimately) human cooperative behavior in politics, v

vi

economics, business systems, and social interactions. In fact, most of these issues have identiﬁed nonlinearities and are beginning to be addressed with nonlinear techniques, e.g., human longevity limits, the Standard Model, climate change, earthquake prediction, workings of the earth’s interior, natural disaster prediction, etc. The individual complex systems mathematical and modeling tools and scientiﬁc and engineering applications that comprised the Encyclopedia of Complexity and Systems Science are being completely updated and the majority will be published as individual books edited by experts in each ﬁeld who are eminent university faculty members. The topics are as follows: Agent Based Modeling and Simulation Applications of Physics and Mathematics to Social Science Cellular Automata, Mathematical Basis of Chaos and Complexity in Astrophysics Climate Modeling, Global Warming, and Weather Prediction Complex Networks and Graph Theory Complexity and Nonlinearity in Autonomous Robotics Complexity in Computational Chemistry Complexity in Earthquakes, Tsunamis, and Volcanoes, and Forecasting and Early Warning of Their Hazards Computational and Theoretical Nanoscience Control and Dynamical Systems Data Mining and Knowledge Discovery Ecological Complexity Ergodic Theory Finance and Econometrics Fractals and Multifractals Game Theory Granular Computing Intelligent Systems Nonlinear Ordinary Differential Equations and Dynamical Systems Nonlinear Partial Differential Equations Percolation Perturbation Theory Probability and Statistics in Complex Systems Quantum Information Science Social Network Analysis Soft Computing Solitons Statistical and Nonlinear Physics Synergetics System Dynamics Systems Biology Each entry in each of the Series books was selected and peer reviews organized by one of our university-based book Editors with advice and

Series Preface

Series Preface

vii

consultation provided by our eminent Board Members and the Editor-in-Chief. This level of coordination assures that the reader can have a level of conﬁdence in the relevance and accuracy of the information far exceeding than that generally found on the World Wide Web. Accessibility is also a priority and for this reason each entry includes a glossary of important terms and a concise deﬁnition of the subject. In addition, we are pleased that the mathematical portions of our Encyclopedia have been selected by Math Reviews for indexing in MathSciNet. Also, ACM, the world’s largest educational and scientiﬁc computing society, recognized our Computational Complexity: Theory, Techniques, and Applications book, which contains content taken exclusively from the Encyclopedia of Complexity and Systems Science, with an award as one of the notable Computer Science publications. Clearly, we have achieved prominence at a level beyond our expectations, but consistent with the high quality of the content! Palm Desert, CA, USA September 2018

Robert A. Meyers Editor-in-Chief

Volume Preface

Somewhere in 1930s, while sipping coffee with brandy in Kawiarnia Szkocka in Lwów, Stanislaw Ulam posed a problem – “Suppose one has an inﬁnite regular system of lattice points in En, each capable of existing in various states S1, . . ., Sk. Each lattice point has a well deﬁned system of m neighbors, and it is assumed that the state of each point at time t + 1 is uniquely determined by the states of all its neighbors at time t. Assuming that at time t only a ﬁnite set of points are active, one wants to know how the activation will spread.”1 This is just one of the possible onset of cellular automata theory. Cellular automata are multiorigin and multifarious. They are mathematical machines, models of computation, architectures of massively parallel processors, and fast prototyping tools for studying dynamics of spatially extended nonlinear systems. As Tommaso Toffoli told me once “a magic of cellular automata is that they have low entry fees but high exit fees.” The cellular automata are very simple yet their behavior is often far from predictable, and their analyses require substantial efforts. In this unique book, we gathered a crème de la crème of the cellular automata community. Authors came from different ﬁelds of science and different walks of life. What makes the book unique is not just subjects and objects of the studies but breadths of cellular automata discoveries made in mathematics, computers, science, engineering, and physics. I am honored to the bones to have a privilege of compiling the texts authored by brilliant and brightest minds of the scientiﬁc and engineering world. Thank you, authors. Bristol, UK September 2018

Andrew Adamatzky Volume Editor

1

Ulam S. M. A. Collection of Mathematical Problems (New York: Interscience, 1960), p. 30 ix

Cellular Automata Editorial

A cellular automaton is a discrete universe with discrete time, discrete space, and discrete states. Cells of the universe are arranged into regular structures called lattices or arrays. Each cell takes a ﬁnite number of states and updates its states in a discrete time, depending on the states of its neighbors. Cellular automata are mathematical models of massively parallel computing; computational models of spatially extended nonlinear physical, biological, chemical, and social systems; and primary tools for studying large-scale complex systems. Cellular automata are ubiquitous; they are objects of theoretical study and also tools of applied modeling in science and engineering. Commonly, a cellular automaton array is a one- or two-dimensional rectangular matrix of cells. However, other topologies are also used, e.g., pentagonal tessellations (chapter “▶ Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations,” by Carter Bays) and hyperbolic spaces (chapter “▶ Cellular Automata in Hyperbolic Spaces,” by Maurice Margenstern). Structure of neighborhood, connections between cells, can also change dynamically during automaton’s evolution (chapter “▶ Structurally Dynamic Cellular Automata,” by Andrew Ilachinski). Typically, all cells of a cellular automaton update their states simultaneously, at the same time, however, there is a family of asynchronous automata where cells might not have a global clock (chapter “▶ Asynchronous Cellular Automata,” by Nazim Fates). Cell-state transitions per se can be based on quantum mechanics (chapter “▶ Quantum Cellular Automata,” by Karoline Wiesner). Talking about nonstandard celltransition rules, we must mention cellular automata with injective global functions, where every conﬁguration has exactly one preceding conﬁguration (chapter “▶ Reversible Cellular Automata,” by Kenichi Morita). Typically, a cell neighborhood is ﬁxed during cellular automaton development, and a cell updates its state depending on current states of its neighbors. But even in this very basic setup, the space-time dynamics of cellular automata are incredibly complex, as can be observed from analysis of the simplest one-dimensional automata where a transition rule applied to the sum of two states is equal to the sum of its actions on the two states separately (see chapter “▶ Additive Cellular Automata,” by Burton Voorhees). The automata dynamics becomes much richer if we allow the topology of the cell neighborhood to be updated dynamically during automaton development (see chapter “▶ Structurally Dynamic Cellular Automata,” by Andrew Ilachinski) or also allow a cell’s state to become dependent on the cells’ previous states (see chapter “▶ Cellular Automata with Memory,” by Ramón Alonso-Sanz). Insightful xi

xii

classiﬁcation of cellular automata based on their dynamics and structure of state-transition functions are provided in chapter “▶ Classiﬁcation of Cellular Automata,” by Klaus Sutner. The reader’s initial excursion into the theory of cellular automata themselves continues with decision problems of cellular automata expressed in terms of ﬁlling the plane using tiles with colored edges (chapter “▶ Tiling Problem and Undecidability in Cellular Automata,” by Jarkko Kari) and about algebraic properties of cellular automata transformations, such as group representation of the Garden of Eden theorem and matrix representation of cellular automata (chapter “▶ Cellular Automata and Groups,” by Tullio Ceccherini-Silberstein and Michel Coornaert). Self-reproducing patterns and gliders are among the most remarkable features of cellular automata. Certain cellular automata can reproduce conﬁgurations of cell-states, for example, the von Neumann universal constructor, and thus can be used in designs of self-replicating hardware (chapter “▶ SelfReplication and Cellular Automata,” by Gianluca Tempesti, Daniel Mange, and André Stauffer). Gliders are translating oscillators, or traveling patterns, of nonquiescent states, for example, gliders in Conway’s Game of Life. Gliders are fascinating in two- and three-dimensional spaces (chapter “▶ Gliders in Cellular Automata”). Much of the research in cellular automata deals with dynamics of automaton conﬁgurations in time and space. Several chapters are dedicated to analysis and prediction of the cellular automaton behavior. These include analyses of global transitions graphs (chapter “▶ Basins of Attraction of Cellular Automata and Discrete Dynamical Networks”), phase-transitions (chapter “▶ Phase Transitions in Cellular Automata”), propagated patterns (chapter “▶ Growth Phenomena in Cellular Automata”), and travelling localizations (chapter “▶ Gliders in Cellular Automata,” chapter “▶ Emergent Phenomena in Cellular Automata,” by James E. Hanson). Analytical tools for analyzing cellular automaton dynamics are discussed in (chapter “▶ Topological Dynamics of Cellular Automata,” by Petr Kůrka and chapter “▶ Dynamics of Cellular Automata in Noncompact Spaces,” by Enrico Formenti and Petr Kůrka), probabilistic approaches to CA dynamics (chapter “▶ Orbits of Bernoulli Measures in Cellular Automata,” by Henryk Fukś), chaotic dynamics (chapter “▶ Chaotic Behavior of Cellular Automata,” Julien Cervelle, Alberto Dennunzio, Enrico Formenti), and symbolic dynamics (chapter “▶ Ergodic Theory of Cellular Automata,” by Marcus Pivato). Particular attention is paid to topological dynamics, e.g., in relation to symbolic dynamics, subjectivity, and permutations (chapter “▶ Topological Dynamics of Cellular Automata”), entropy and decidability of cellular automata behavior (chapter “▶ Chaotic Behavior of Cellular Automata”), and insights into cellular automata as dynamical systems with invariant measures (chapter “▶ Ergodic Theory of Cellular Automata”). Concepts of control theory to guide dynamics of probabilistic cellular automata are overviewed in chapter “▶ Control of Cellular Automata,” by Franco Bagnoli, Samira El Yacoubi, and Raul Rechtman. Complexity underpins almost every chapter but particularly pronounced in chapter “▶ Algorithmic Complexity and Cellular Automata,” where

Cellular Automata Editorial

Cellular Automata Editorial

xiii

Kolmogorov complexity as related to cellular automata conﬁgurations have been used among other measures and chapter “▶ Graphs Related to Reversibility and Complexity in Cellular Automata,” by Juan C. Seck-Tuoh-Mora and Genaro J. Martínez, where De Bruijn graphs were applied to evaluate complexity of cell-state transition function. Authoritative review of reversible cellular automata and their computational universality is presented in chapter “▶ Reversible Cellular Automata.” Cellular automata are massive-parallel computing devices (chapter “▶ Cellular Automata as Models of Parallel Computation”) and acceptors of formal languages (chapter “▶ Cellular Automata and Language Theory”). Cellular automata can compute using traveling localizations, or propagating particles or gliders (chapter “▶ Evolving Cellular Automata,” by Martin Cenek and Melanie Mitchell, and chapter “▶ Gliders in Cellular Automata,” by Carter Bays) or by using each cell as an elementary processor, as in systolic architectures (chapter “▶ Cellular Automata Hardware Implementation,” by Georgios Sirakoulis); there are, indeed, combinations of conventional parallel computing techniques and less conventional approaches based on interaction of growing patterns and traveling localizations. Firing squad synchronization is a classical problem demonstrating computational potential of cellular automata: all cells of a one-dimensional cellular automaton are quiescent apart from one cell in the ﬁring state; we wish to design minimal cell-state transition rules enabling all other cells to assume the ﬁring state at the same time (chapter “▶ Firing Squad Synchronization Problem in Cellular Automata,” by Hiroshi Umeo). This has been further developed into solutions of density determination using cellular automata (chapter “▶ Evolving Cellular Automata”). Universality of cellular automata is another classical issue. Two kinds of universality are of most importance: computational universality, e.g., an ability to compute any computable function or implement a functionally complete logical system, and intrinsic, or simulation universality, such as an ability to simulate any cellular automaton (chapter “▶ Universality of Cellular Automata,” by Jérôme Durand-Lose). Cellular automata models of natural systems media (chapter “▶ Cellular Automata Modeling of Physical Systems,” by Bastien Chopard) such as cell differentiation, road trafﬁc, reaction-diffusion (chapter “▶ Stochastic Cellular Automata as Models of Reaction–Diffusion Processes,” by Olga Bandman), and excitable media are ideal candidates for studying all important phenomena of pattern growth (chapter “▶ Growth Phenomena in Cellular Automata,” by Janko Gravner), for studying transformation of a system’s state from one phase to another (chapter “▶ Phase Transitions in Cellular Automata,” by Nino Boccara), and for evaluating the ability of a system to be attracted to the states where boundary between the system’s phases is indistinguishable (chapter “▶ Self-Organized Criticality and Cellular Automata,” by Michael Creutz). Cellular automata models of natural phenomena can be designed, in principle, by reconstructing cell-state transition rules of cellular automata from snapshots of space-time dynamics of the system we wish to simulate (chapter “▶ Identiﬁcation of Cellular Automata,” by Andrew Adamatzky).

Contents

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Carter Bays

1

Cellular Automata in Hyperbolic Spaces . . . . . . . . . . . . . . . . . . . . . Maurice Margenstern

11

Structurally Dynamic Cellular Automata . . . . . . . . . . . . . . . . . . . . Andrew Ilachinski

29

..........................

73

Quantum Cellular Automata . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Karoline Wiesner

93

Asynchronous Cellular Automata Nazim Fatès

Reversible Cellular Automata Kenichi Morita

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 105

Additive Cellular Automata . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 129 Burton Voorhees Cellular Automata with Memory . . . . . . . . . . . . . . . . . . . . . . . . . . . 153 Ramón Alonso-Sanz Classiﬁcation of Cellular Automata . . . . . . . . . . . . . . . . . . . . . . . . . 185 Klaus Sutner Tiling Problem and Undecidability in Cellular Automata . . . . . . . 201 Jarkko Kari Cellular Automata and Groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . 221 Tullio Ceccherini-Silberstein and Michel Coornaert Self-Replication and Cellular Automata . . . . . . . . . . . . . . . . . . . . . 239 Gianluca Tempesti, Daniel Mange, and André Stauffer Gliders in Cellular Automata . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 261 Carter Bays xv

xvi

Contents

Basins of Attraction of Cellular Automata and Discrete Dynamical Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 275 Andrew Wuensche Growth Phenomena in Cellular Automata Janko Gravner

. . . . . . . . . . . . . . . . . . . 291

Emergent Phenomena in Cellular Automata . . . . . . . . . . . . . . . . . . 309 James E. Hanson Dynamics of Cellular Automata in Noncompact Spaces . . . . . . . . . 323 Enrico Formenti and Petr Kůrka Orbits of Bernoulli Measures in Cellular Automata . . . . . . . . . . . . 337 Henryk Fukś Chaotic Behavior of Cellular Automata . . . . . . . . . . . . . . . . . . . . . . 357 Julien Cervelle, Alberto Dennunzio, and Enrico Formenti Ergodic Theory of Cellular Automata . . . . . . . . . . . . . . . . . . . . . . . 373 Marcus Pivato Topological Dynamics of Cellular Automata . . . . . . . . . . . . . . . . . . 419 Petr Kůrka Control of Cellular Automata . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 445 Franco Bagnoli, Samira El Yacoubi, and Raúl Rechtman Algorithmic Complexity and Cellular Automata Julien Cervelle and Enrico Formenti

. . . . . . . . . . . . . . 459

Graphs Related to Reversibility and Complexity in Cellular Automata . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 479 Juan C. Seck-Tuoh-Mora and Genaro J. Martínez Cellular Automata as Models of Parallel Computation . . . . . . . . . 493 Thomas Worsch Cellular Automata and Language Theory . . . . . . . . . . . . . . . . . . . . 513 Martin Kutrib Evolving Cellular Automata . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 543 Martin Cenek and Melanie Mitchell Cellular Automata Hardware Implementation . . . . . . . . . . . . . . . . 555 Georgios Ch. Sirakoulis Firing Squad Synchronization Problem in Cellular Automata Hiroshi Umeo

. . . 583

Universality of Cellular Automata . . . . . . . . . . . . . . . . . . . . . . . . . . 641 Jérôme Durand-Lose Cellular Automata Modeling of Physical Systems . . . . . . . . . . . . . . 657 Bastien Chopard

Contents

xvii

Stochastic Cellular Automata as Models of Reaction–Diffusion Processes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 691 Olga Bandman Phase Transitions in Cellular Automata Nino Boccara

. . . . . . . . . . . . . . . . . . . . . 705

Self-Organized Criticality and Cellular Automata . . . . . . . . . . . . . 719 Michael Creutz Identiﬁcation of Cellular Automata . . . . . . . . . . . . . . . . . . . . . . . . . 733 Andrew Adamatzky Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 749

About the Editor-in-Chief

Dr. Robert A. Meyers President: RAMTECH Limited Manger, Chemical Process Technology, TRW Inc. Post doctoral Fellow: California Institute of Technology Ph.D. Chemistry, University of California at Los Angeles B.A. Chemistry, California State University, San Diego

Biography Dr. Meyers has worked with more than 20 Nobel laureates during his career and is the originator and serves as Editor-in-Chief of both the Springer Nature Encyclopedia of Sustainability Science and Technology and the related and supportive Springer Nature Encyclopedia of Complexity and Systems Science.

Education Postdoctoral Fellow: California Institute of Technology Ph.D. in Organic Chemistry, University of California at Los Angeles B.A. Chemistry with minor in Mathematics, California State University, San Diego Dr. Meyers holds more than 20 patents and is the author or Editor-in-Chief of 12 technical books including the Handbook of Chemical Production

xix

xx

Processes, Handbook of Synfuels Technology, and Handbook of Petroleum Reﬁning Processes now in 4th Edition, and the Handbook of Petrochemical Production Processes, now in its second edition, (McGraw-Hill) and the Handbook of Energy Technology and Economics, published by John Wiley & Sons; Coal Structure, published by Academic Press; and Coal Desulfurization as well as the Coal Handbook published by Marcel Dekker. He served as Chairman of the Advisory Board for A Guide to Nuclear Power Technology, published by John Wiley & Sons, which won the Association of American Publishers Award as the best book in technology and engineering.

About the Editor-in-Chief

About the Volume Editor

Andrew Adamatzky is Professor in Unconventional Computing at the Department of Computer Science and Director of the Unconventional Computing Laboratory, University of the West of England, Bristol. He does research in theoretical models of computation, cellular automata theory and applications, molecular computing, reaction-diffusion computing, collision-based computing, slime mold computing, massive parallel computation, applied mathematics, complexity, nature-inspired optimization, collective intelligence, bionics, computational psychology, nonlinear science, novel hardware, and future and emergent computation. He invented and developed new ﬁelds of computing – reaction-diffusion computing and slime mold computing – which are now listed as key topics of all major conferences in computer science and future and emerging technologies. His ﬁrst authored book was Identiﬁcation of Cellular Automata (Taylor & Francis, 1994). He authored seven books, most notable are Reaction-Diffusion Computing (Elsevier, 2005), Dynamics of Crow Minds (World Scientiﬁc, 2005), Physarum Machines (World Scientiﬁc, 2010), and Reaction-Diffusion Automata (Springer, 2013) and edited 22 books in computing, most notable are Collision Based Computing (Springer, 2002), Game of Life Cellular Automata (Springer, 2010), and Memristor Networks (Springer, 2014); he also produced a series of inﬂuential artworks published in the atlas Silence of Slime Mould (Luniver Press, 2014). He is founding editor-in-chief of Journal of Cellular Automata and Journal of Unconventional Computing (both published by OCP Science, USA) and editor-in-chief of Parallel, Emergent, and Distributed Systems (Taylor & Francis) and Parallel Processing Letters (World Scientiﬁc). He is co-founder of Springer Series Emergence, Complexity and Computation, which publishes elected topics in the ﬁelds of complexity, computation, and emergency, including all aspects of

xxi

xxii

reality-based computation approaches from an interdisciplinary point of view especially from applied sciences, biology, physics, or chemistry. Adamatzky is famous for his unorthodox ideas, which attracted substantial funding from UK and EU, including computing with liquid marbles, living architectures, growing computers with slime mold, learning and computation in memristor networks, artiﬁcial wet neural networks, biologically inspired transportation, collision-based computing, dynamical logical circuits in sub-excitable media, particle dynamics in cellular automata, and amorphous biological intelligence.

About the Volume Editor

Contributors

Andrew Adamatzky Unconventional Computing Centre, University of the West of England, Bristol, UK Ramón Alonso-Sanz Technical University of Madrid, ETSIAAB (Estadística, GSC), Madrid, Spain Franco Bagnoli Department of Physics and Astronomy and CSDC, University of Florence, Sesto Fiorentino, Italy Olga Bandman Supercomputer Software Department, Institute of Computational Mathematics and Mathematical Geophysics SB RAS, Novosibirsk, Russia Carter Bays Department of Computer Science and Engineering, University of South Carolina, Columbia, SC, USA Nino Boccara Department of Physics, University of Illinois, Chicago, IL, USA CE Saclay, Gif-sur-Yvette, France Tullio Ceccherini-Silberstein Dipartimento di Ingegneria, Università del Sannio, Benevento, Italy Martin Cenek Computer Science Department, Portland State University, Portland, OR, USA Julien Cervelle Laboratoire d’Informatique de l’Institut, Gaspard–Monge, Université Paris-Est, Marne la Vallée, France Bastien Chopard Computer Science Department, University of Geneva, Geneva, Switzerland Michel Coornaert Institut de Recherche Mathématique Avancée, Université Louis Pasteur et CNRS, Strasbourg, France Michael Creutz Physics Department, Brookhaven National Laboratory, Upton, NY, USA xxiii

xxiv

Alberto Dennunzio Dipartimento di Informatica, Sistemistica Comunicazione, Università degli Studi di Milano-Bicocca, Milan, Italy

Contributors

e

Jérôme Durand-Lose Laboratoire d’Informatique Fondamentale d’Orléans, Université d’Orléans, Orléans, France Samira El Yacoubi Team Project IMAGES_ESPACE-Dev, UMR 228 Espace-Dev IRD UA UM UG UR, University of Perpignan, Perpignan cedex, France Nazim Fatès LORIA UMR 7503, Inria Nancy – Grand Est, Nancy, France Enrico Formenti Laboratoire I3S – UNSA/CNRS UMR 6070, Université de Nice Sophia Antipolis, Sophia Antipolis, France Henryk Fukś Department of Mathematics and Statistics, Brock University, St. Catharines, ON, Canada Janko Gravner Mathematics Department, University of California, Davis, CA, USA James E. Hanson IBM T.J. Watson Research Center, Yorktown Heights, NY, USA Andrew Ilachinski Center for Naval Analyses, Alexandria, VA, USA Jarkko Kari Department of Mathematics, University of Turku, Turku, Finland Petr Kůrka Département d’Informatique, Université de Nice Sophia Antipolis, Nice, France Center for Theoretical Study, Academy of Sciences and Charles University, Prague, Czechia Martin Kutrib Institut für Informatik, Universität Giessen, Giessen, Germany Daniel Mange Ecole Polytechnique Fédérale de Lausanne (EPFL), Lausanne, Switzerland Maurice Margenstern Université de Lorraine, LGIPM, Département d’Informatique, Equipe GRAL, Metz, France Genaro J. Martínez Escuela Superior de Cómputo, Instituto Politécnico Nacional, México Unconventional Computing Center, University of the West of England, Bristol, UK Melanie Mitchell Computer Science Department, Portland State University, Portland, OR, USA Kenichi Morita Hiroshima University, Higashi-Hiroshima, Japan Marcus Pivato Department of Mathematics, Trent University, Peterborough, ON, Canada Raúl Rechtman Instituto de Energías Renovables, Universidad Nacional Autónoma de México, Temixco, Morelos, Mexico

Contributors

xxv

Juan C. Seck-Tuoh-Mora Instituto de Ciencias Básicas e Ingeniería, Área Académica de Ingeniería, Universidad Autónoma del Estado de Hidalgo, Hidalgo, Mexico Georgios Ch. Sirakoulis School of Engineering, Department of Electrical and Computer Engineering, Democritus University of Thrace, Xanthi, Greece André Stauffer Ecole Polytechnique Fédérale de Lausanne (EPFL), Lausanne, Switzerland Klaus Sutner Carnegie Mellon University, Pittsburgh, PA, USA Gianluca Tempesti University of York, York, UK Hiroshi Umeo University of Osaka Electro-Communication, Osaka, Japan Burton Voorhees Center for Science, Athabasca University, Athabasca, Canada Karoline Wiesner School of Mathematics, University of Bristol, Bristol, UK Thomas Worsch Lehrstuhl Informatik für Ingenieure und Naturwissenschaftler, Universität Karlsruhe, Karlsruhe, Germany Andrew Wuensche Discrete Dynamics Lab, London, UK

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations Carter Bays Department of Computer Science and Engineering, University of South Carolina, Columbia, SC, USA

Oscillator a periodic shape within a speciﬁc cellular automaton rule. Glider a translating oscillator that moves across the grid of a CA. Generation the discrete time unit which depicts the evolution of a cellular automaton. Rule determines how each individual cell within a cellular automaton evolves.

Definition of the Subject Article Outline Glossary Deﬁnition of the Subject Two Dimensional Cellular Automata in the Triangular Grid The Hexagonal Grid The Pentagonal Grid Programming Tips Future Directions Bibliography Typically, cellular automata (“CA”) are deﬁned in Cartesian space (e.g. a square grid). Here we explore characteristics of CA in triangular and other non-cartesian grids. Methods for programming CA for these non-cartesian grids are brieﬂy discussed.

Glossary Cellular automaton (CA) a structure comprising a grid with individual cells that can have two or more states; these cells evolve in discrete time units and are governed by a rule, which usually involves neighbors of each cell. Game of Life a particular cellular automaton discovered by John Conway in 1968. Neighbor a neighbor of cell “x” is typically a cell that is in close proximity to (frequently touching) cell “x”.

A tessellation or tiling is composed of a speciﬁc shape that is repeated endlessly in a plane, with no gaps or overlaps. Examples of simple tessellations are the square grid, the triangular grid (a plane completely covered by identical triangles), etc. Hereafter, we shall also use “grid” when referring to tessellations. Cellular automata (CA) can be explained most effectively with an example. Start with an inﬁnite grid of squares; each square represents a cell, which is either “alive” or “dead”. Time progresses in discrete units called “generations”; at every generation we evaluate simultaneously the fate for each cell at the next generation by examining neighboring cells (called “neighbors”) – in this case, we shall consider as neighbors any cell touching the candidate cell (eight neighbors in all). This is sometimes called the Moore neighborhood. We apply a “rule” to determine the next generation status of our candidate cell. For example, our rule might state, (a) “If our candidate cell is currently alive, then it will remain alive next generation if it touches either two or three live neighbors, otherwise it dies”, and (b) “If our candidate cell is not alive then it will come to life next generation if and only if it is touching exactly three live neighbors.” Figure 1 illustrates a simple conﬁguration to which this CA rule has been applied. Notice that this particular object repeats itself indeﬁnitely. Such an object is called an “oscillator”; this particular oscillator has a “period” of two.

# Springer-Verlag 2009 A. Adamatzky (ed.), Cellular Automata, https://doi.org/10.1007/978-1-4939-8700-9_58 Originally published in R. A. Meyers (ed.), Encyclopedia of Complexity and Systems Science, # Springer-Verlag 2009 https://doi.org/10.1007/978-0-387-30440-3_58

1

2

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations, Fig. 1 Top: Each cell in a grid has 8 “neighbors”. The cells containing “n” are neighbors of the cell containing the “X”. Any cell in the grid can be either “dead” or “alive”. Bottom: Here we have outlined a speciﬁc area of what is presumably a much larger grid. At the left we have installed an initial shape. Shaded cells are alive; all others are dead. The number within each cell gives the quantity of live neighbors for that cell. (Cells containing no numbers have zero live neighbors.) Depicted are three generations, starting with the conﬁguration at generation 1. Generations 2 then 3 show the result when we apply the following cellular automata rule: “Live cells

with exactly 2 or 3 live neighbors remain alive (otherwise they die); dead cells with exactly 3 live neighbors come to life (otherwise they remain dead)”. Let us now evaluate the transition from generation 1 to generation 2. In our diagram, cell “a” is dead. Since it does not have exactly 3 live neighbors, it remains dead. Cell “b” is alive, but it needs exactly 2 or 3 live neighbors to remain alive; since it only has 1, it dies. Cell “c” is dead; since it has exactly 3 live neighbors, it comes to life. And cell “d” has 2 live neighbors; hence it will remain alive. And so on. Notice that the form repeats every two generations. Such forms are called oscillators

Other conﬁgurations can have much larger periods, or can behave in a more chaotic fashion. Motionless patterns can be thought of as oscillators whose period is one. Needless to say, there are a huge number of rules that can be applied, and each rule will cause a distinct action. The rule given above – the most famous cellular automaton of all – speciﬁes the “Game of Life”, discovered by John Horton Conway in 1968. Game of Life (GL) rules must satisfy the following informal criteria.

1. All neighbors must be touching the candidate cell and all are treated the same. 2. There must exist at least one translating oscillator (called a “glider”). 3. Random conﬁgurations must eventually stabilize into zero or more oscillators. For a more formal description of GL rule requirements see (Bays 2005). It is important to note that CA can be represented in one, two, three or higher dimensions, but most work has been done in one or two. Furthermore, neighbors

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations

3

can be deﬁned in many ways; for example we might only consider as neighbors those cells touching the sides of a candidate cell and not the corners. Or we might expand our neighborhood to include cells within a given distance of a candidate cell. This is typically done for onedimensional CA.

Some Convenient Notation for Describing CA Rules We shall write CA rules using the following notation, E 1 , E 2 , . . . =F1 , F 2 , . . .

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations, Fig. 2 The neighborhoods for cells in the triangular grid. Note that the candidate cells can have two orientations – “E” and “O”. The neighbors are indicated by “e” and “o” respectively

where the Ei specify the number of live neighbors required to keep a living cell alive, and the Fi give the number required to bring a nonliving cell to life. The Ei and Fi will be listed in ascending order; hence if i > j then Ei > Ej etc. Thus the rule for Conway’s Game of Life is written 2, 3/3. We shall also use a convenient shorthand when appropriate: Ei–Ej denotes Ei, Ei + 1, . . ., Ei+j i etc. Thus, 2, 3, 4, 5, 6/2, 3, 4 can also be written 2–6/2–4.

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations, Fig. 3 Examples of expanding rules. The starting conﬁgurations are at the top

4

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations

Introduction Almost all CA research in two dimensions has been done using rectangular (Cartesian) coordinates, and hence typically utilizes the square grid. But there is no reason to limit ourselves to this tessellation; the number of different possible grids is almost endless. Here we shall brieﬂy investigate CA behavior in only three – triangular, hexagonal and pentagonal.

Two Dimensional Cellular Automata in the Triangular Grid

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations, Fig. 4 An example of a stable rule. The starting random conﬁguration eventually stabilizes into the shape shown at the lower right; interestingly this shape happens to be an oscillator with a period of two

Throughout this article we shall consider as neighbors only those cells that touch the candidate cell; hence for a grid composed of triangles, each cell would have 12 neighbors (Fig. 2). These non-cartesian grids for CA have been investigated from time to time; most notably by Preston (Preston and Duff 1984) and Bays (1994, 2005). Recently work relating to hexagonal CA has appeared on the internet occasionally.

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations, Fig. 5 Examples of bounded rules that churn endlessly. The total number of live cells can be employed as pseudorandom numbers that approximate a normal distribution. Many candidate rules can be used. Naturally the random like patterns eventually repeat, but with a sufﬁciently large initial shape, the period will be

quite large. The plot at the lower left gives the number of live cells at each generation. These values exhibit a normal distribution (plot “A”). Note however that there are some gaps. This is because the rule 1-8/6-8 tends to have “clumps” of living (and fairly large “holes” of non-living) cells. Hence, before using this technique for generating random numbers, the candidate rule should be carefully investigated

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations, Fig. 6 A simple glider for the GL rule 3, 5/4. It has a period of three (indicated in parentheses) after which it will have moved one cell to the right. Many gliders are not this well behaved, with much longer periods and irregular structure (see next ﬁgure)

With 12 touching neighbors instead of 8 (as in the square grid), we can write more than 16 million distinct rules, most of which are probably of only marginal interest. Many however exhibit behavior worthy of investigation. Some rules will generate a continually expanding collection of live cells – we shall call such rules “expanding” or “unstable” rules. Thus 2, 3/2; 2, 3/3, 4; 2, 3, 4/3 each produce an ever increasing area of live cells – even with extremely small starting conﬁgurations (Fig. 3). A few expanding rules “barely” expand; i.e. several generations are required and the initial live conﬁguration must be fairly large in order to observe instability. For example 2, 3, 6/4, 5 can produce unbounded growth, while 2, 3, 8/4, 5 always eventually stabilizes. The fate of conﬁgurations under 2, 3, 7/4, 5 is uncertain, but the rule appears to produce unbounded growth. Many rules will ultimately lead to a stable pattern (Fig. 4), or no live cells at all.

5

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations, Fig. 7 Some gliders exhibit rather spectacular evolution. The period 80 2, 7, 8/3 glider, swells to 60 live cells during its swaggering trip across the grid, and at the 81st generation, will have moved 12 cells to the right. The gliders move in the direction given by the arrows. It should be noted that gliders have also been found for non-GL rules but since these rules are unstable they have not been investigated

For some rules we can start with bounded forms whose innards churn endlessly forever; these rules can, for example, be used to generate random numbers (Fig. 5). Such rules differ somewhat from expanding rules in that all ﬁnite patterns are bounded and will not expand indeﬁnitely, but an inﬁnite grid of random live cells will never stabilize. Game of Life Rules in the Triangular Grid As mentioned above, the most famous GL rule is Conway’s game, which utilizes a square grid. But GL rules are not limited to squares; quite a few exist in the triangular grid. Among these are 4, 5, 6/4; 3, 4/4, 5; 4, 5/4, 5, 6; 2, 3/4, 5; 3, 4/4, 5, 6; 2/3; 2, 4/4, 6; 3, 5/4; 2, 4, 6/4, 6; 2, 7/3; 2, 7, 8/3. Further information about these and other rules can be found in (Bays 2005) and (Bays 1994) (Figs. 6, 7, 8, 9, 10 and 11).

6

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations, Fig. 8 Hundreds of oscillators exist for the GL (and other) rules in the triangular grid. A few interesting ones are illustrated here. The stationary 4, 5, 6/4 form is representative of an inﬁnite number of such objects that can be created for this rule by the careful positioning of live cells. The different oscillators at the lower right happen to share one identical shape. The oscillator at the upper right “rotates” clockwise, as does the period 12 oscillator at the bottom. Unfortunately rule 1, 7, 8/3 is not a GL rule

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations, Fig. 9 The GL rule 2, 7, 8/3 is of special interest. It is the only known GL rule besides Conway’s rule that supports a “glider gun” – a conﬁguration that spews out an endless stream of gliders. In fact, there are probably several such patterns under that rule. Here we illustrate two guns; the top one generates period 18 gliders and the bottom one creates period 80 gliders. These conﬁgurations move in the direction shown, sending a stream of gliders out behind them (see next ﬁgure)

The Hexagonal Grid The neighborhood for the hexagonal grid is only half the size of that for the triangular grid and is symmetric – each neighbor is identical in the manner of contact with the cell in question. This symmetry can be important for some applications. Unfortunately, the hexagonal grid has a limited number of possible rules – there are only about 4000, many of which are of little interest. For many years past attempts to ﬁnd a GL rule in the hexagonal grid have failed, although gliders were discovered by deﬁning rules where the spatial relationship between neighbors was a factor (Preston and Duff 1984). Recently however the GL rule 3/2 was discovered. It supports the glider shown in Fig. 12. Another glider

has also turned up; its rule is 3/2, 4, 5. Unfortunately this rule is not a GL rule, as it will very slowly exhibit unbounded growth, given a sufﬁciently large starting pattern (Fig. 13).

The Pentagonal Grid Regular pentagons cannot be formed into a grid, but by varying the angles and side lengths, we can create several tessellations from identical convex pentagons. A classiﬁcation system has been devised, wherein 14 different types of tilings have been identiﬁed (Fig. 14). Of these, 12 are topologically distinct; these twelve varieties will behave in different ways under CA rules. We have chosen to investigate one of the most pleasing, the

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations

7

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations, Fig. 12 At least two gliders have been found. The GL rule 3/2 supports a period 5 glider and the non-GL rule 3/2, 4, 5 supports a period 10 glider. Note that the 3/2 glider also works for GL rules 3, 5/2 and 3, 5, 6/2 Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations, Fig. 10 After 800 generations, the two guns will have produced the output shown. Motion is in the direction given by the arrows. The gun at the left yields period 18 gliders, one every 80 generations, and the gun at the right produces a period 80 glider every 160 generations

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations, Fig. 11 The symmetric hexagonal neighborhood. This rather “natural” grid can also be illustrated with circles (upper right) and, just as the square grid can be expanded to cubes in 3 dimensions, the hexagonal grid lends itself to “densely packed spheres” in three dimensions, where each sphere has exactly 12 touching neighbors

“Cairo tiling”, so named because of its alleged use in parts of that city. It’s appeal derives from the fact that the pentagons are both equilateral and isoseles.

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations, Fig. 13 Several interesting oscillators have been discovered for GL rule 3/2. They have been given rather whimsical names, a custom dating back to the early days of Conway’s rule. After 65 generations the “supernova” pattern leaves a period 3 “neutron star” remnant. These patterns also work under rules 3, 5/2 and 3, 5, 6/2

Under the Cairo grid, there are rules that behave in the manner already described for the triangular grid – some rules expand, some stabilize, others contain a bounded, churning mass, etc. Interestingly, a GL rule has been discovered; its glider is depicted in Fig. 15. There is

8

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations, Fig. 14 The 14 distinct convex pentagonal tilings (Bays 2005; Wolfram 2002). They are based upon certain relationships between the angles and lengths of the sides of the particular pentagon that constitutes the tiling. A sample of the pentagon for that tiling is displayed at the right of each. The tilings have been

arranged to depict the number of touching neighbors for each cell. Where more than one number is given, there are some cells with each of those neighbor counts. For example the “67b” tiling is the second tiling where some cells have 6 neighbors and others 7. The Cairo tiling is at the upper left and is topologically equivalent to 7a and 7b. Note that 7c and 7d are also topologically equivalent

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations, Fig. 15 The GL rule 2, 3/3, 4, 6 supports the period 48 glider shown. It is asymmetric, though the second half of its period is a mirror image of the ﬁrst. This characteristic is common amongst many gliders

much opportunity for discovery in this and other pentagonal grids, as very little work has been done.

9

than moving B back to A for the next iteration, we switch between the two; i.e. if array A is the array we are examining, then we copy it into array B, changing the status and neighbor counts of cells as needed. Array B then becomes array A for the next generation, etc. This trick allows us to rapidly scan over all non-changed cells. For further speed we can utilize hashing techniques and only store cells whose status is going to change. For this method, the speed of evaluation will depend only upon the number of cells that change between generations, and not the size of the grid, nor the total number of live cells. Furthermore, with a clever plotting algorithm, we can get away with re-plotting only those changed cells and not the entire grid. We can program practically any grid or tiling in rectangular (square) coordinates by using templates to locate the neighbor cells as depicted in Fig. 16. The operation of ﬁnding the correct neighbors via templates adds a very small amount of time to the overall “next generation” evaluation; hence we would expect calculations on any type of grid to execute almost as fast as on the standard square grid.

Future Directions Programming Tips We can speed up the scan of any grid by storing within each cell its current number of live neighbors along with a tag that indicates whether it is alive or not. Thus when we scan the entire grid for the next generation, we update the status of cells that have changed since last generation (by examining their new neighbor counts) and, for each cell whose status has changed, we ﬁx the neighbor counts for its neighbors; these cells are candidates for updating at the next generation iteration. This method employs two arrays – a “current” array, A, and a “next” array, B. And, rather

The triangular grid yields 12 touching neighbors and hence an ample supply of rules to investigate – many more than the 8 neighbor square grid. The hexagonal grid affords a more natural approach to CA than does the traditional 8 neighbor square grid, since neighbors all touch in the same way. Furthermore, when we expand this grid into three dimensions, we obtain a universe of dense packed spheres, which probably gives the best methodology for emulating 3D applications, as each cell has 12 touching neighbors and all touch in the same way. The fact that GL rules have been found in a pentagonal grid undoubtedly means that other such rules can probably be found in

10

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations

Cellular Automata in Triangular, Pentagonal, and Hexagonal Tessellations, Fig. 16 Templates can be used to simulate any grid with rectangular coordinates. For example, if we are evaluating the neighbors for a hexagonal cell at (i, j) (see “X”) they would be found at

(i 1; j); (i 1; j + 1); (i; j + 1); etc. We can even simulate grids made up of different types of polygons. Here, we determine the polygon type by examining the subscripts of the cell in question. Of course, appropriate graphics procedures must be employed in order to view our grid

many different tessellations – pentagonal and otherwise. The ultimate conclusion is that there is room for much work in the area of non-cartesian CA.

Bays C (2005) A note on the game of life in hexagonal and pentagonal tessellations. Complex Syst 15:245–252 Preston K Jr, Duff MJB (1984) Modern cellular automata. Plenum Press, New York Sugimoto T, Ogawa T (2000) Tiling problem of convex pentagon. Forma 15:75–79 Wolfram S (2002) A new kind of science. Wolfram Media, Champaign

Bibliography Bays C (1994) Cellular automata in the triangular tessellation. Complex Syst 8:127–150

Cellular Automata in Hyperbolic Spaces Maurice Margenstern Universite´ de Lorraine, LGIPM, De´partement d’Informatique, Equipe GRAL, Metz, France

Article Outline Glossary Definition of the Subject and Its Importance Introduction The Locating Problem in Hyperbolic Tilings Implementation of Cellular Automata in Hyperbolic Spaces Complexity of Cellular Automata in Hyperbolic Spaces On Specific Problems of Cellular Automata Universality in Cellular Automata in Hyperbolic Spaces The Connection with Tiling Problems Possible Applications Future Directions Bibliography

Glossary Dodecagrid The tiling {5, 3, 4}. This tessellation lives in the hyperbolic 3D space. Its basic polyhedron is the dodecahedron constructed on regular rectangular pentagons. Fibonacci sequence Sequence of natural integers, denoted by fn and defined by the recurrent equation f nþ2 ¼ f nþ1 þ f n , for all n ℕ and by the initial values f0 = f1 = 1. Heptagrid The tiling {7, 3}, necessarily in the hyperbolic plane. Seven sides and three tiles around a vertex. It is called ternary heptagrid in several papers by the author and its coauthors also in Margenstern (2007c, 2008b). Hyperbolic geometry Geometry, discovered by Nikolaj Lobachevsky and Jànos Bolyai,

independently of each other and around 1830. This geometry satisfies the axioms of Euclidean geometry, the axiom of parallels being excepted and replaced by the following one: through a point out of a line, there are exactly two parallels to the line. In this geometry, there are also lines which never meet: they are called non-secant. They are characterized by the existence, for any couple of such lines, of a unique common perpendicular. Also, in this geometry, the sum of the interior angles of a triangle is always less than p. The difference to p defines the area of the triangle. In hyperbolic geometry, distances are absolute: there is no notion of similarity. See also Poincare´’s disk. Invariant group of a tiling Group of transformations which defines a bijection on the set of tiles. Usually, in a geometrical space, they are required to belong to the group of isometries of the space. Pentagrid The tiling {5, 4}, necessarily in the hyperbolic plane. Five sides and four tiles around a vertex. The angles are right angles. Poincare´’s disk Model of the hyperbolic plane inside the Euclidean plane. The points are those which are interior to a fixed disk D. The lines are the trace in D of diameters or circles which are orthogonal to the border of D. The model was first found by Beltrami and then by Poincare´ who also devised the half-plane model also called after his name. The half-plane model is a conformal image of the disk model. Tessellation Particular case of a finitely generated tiling. It is defined by a polygon and by its reflections in its sides and, recursively, of the images in their sides. Tiling Partition of a geometrical space; the closure of the elements of the partition is called the tiles. An important case is constituted by finitely generated tilings: there is a finite set of tiles G such that any tile is a copy of an element of G. Tiling {p, q} Tessellation based on the regular polygon with p sides and with vertex angle 2p q :

# Springer Science+Business Media LLC, part of Springer Nature 2018 A. Adamatzky (ed.), Cellular Automata, https://doi.org/10.1007/978-1-4939-8700-9_53 Originally published in R. A. Meyers (ed.), Encyclopedia of Complexity and Systems Science, # Springer Science+Business Media New York 2015 https://doi.org/10.1007/978-3-642-27737-5_53-5

11

12

Definition of the Subject and Its Importance Cellular automata in hyperbolic spaces, in short hyperbolic cellular automata (abbreviated HCA), consists in the implementation of cellular automata in the environment of a regular tiling of a hyperbolic space. The first implementation of such an object appeared in a paper by the present author and Kenichi Morita in 1999 (see Margenstern and Morita 1999). In this first paper, a first solution to the location problem in this context was given. The paper also focused on one advantage of this implementation: it allows to solve NP problems in polynomial time. In 2000, a second paper appeared, by the present author, where a decisive solution of the location problem was given. The study of HCAs is a new domain in computer science, at the border with mathematics and physics. They involve hyperbolic geometry as well as elementary arithmetic and algebra with the connections of polynomials with matrices and also some theory of fields. They also involve the theory of formal languages in connection with their properties of elementary arithmetic. To be a melting pot of such different techniques is already something which is very interesting. But the new field has very striking properties. Their complexity classes offer a very different landscape than that of the classical theory of complexity based on the Turing machine. They also provide a bridge between the classical theory of computation and super-Turing computations. HCAs are a novel object with rich properties: they inherit the richness of the infinitely many regular tilings which live in the hyperbolic plane. We are at the beginning of the study, and still, there are a lot of surprising results. HCAs might appear as successful as their Euclidean relatives in various domains as astrophysics, nuclear physics, and computer science. For many results indicated in this entry, we quote the books Margenstern (2007c, 2008b) or Margenstern (2013b), when the results and their proofs can be found there.

Cellular Automata in Hyperbolic Spaces

Introduction Before the appearance of HCAs, there were a few papers on a possible implementation of cellular automata in abstract contexts, especially in the case of Cayley graphs (see Ro´ka 1994). However, as infinitely many tilings of the hyperbolic plane are not Cayley graphs of their invariant group, this method cannot solve the problem in full generality. The difficulty was the location of the tiles, the locating problem. The problem is already difficult in the simple case of tessellations. Note that there are infinitely many of them in the hyperbolic plane. The study appeared to be possible, thanks to a partial solution to the locating problem (see Margenstern and Morita 1999, 2001). A decisive step was done in Margenstern (2000), where the already mentioned mixing of various techniques appears. This first solution in the case of a particular tiling, the pentagrid, is dealt with in section “The Locating Problem in Hyperbolic Tilings.” A significant advance was performed at the occasion of the meetings organized in 2002 for the bicentenary of the birth of Jànos Bolyai, coinventor with Nikolaj Lobachevsky of hyperbolic geometry and also at the occasion of SCI’2002. At this conference, seven papers were presented on the topic of this entry, and they had a strong impact on the later development. This introduction should contain a paragraph on hyperbolic geometry. If the reader is not familiar with this geometry and who has some time, we recommend him/her the first chapter of Margenstern (2007c) or of Margenstern (2013b). Alternatively, the reader may look at any other book introducing to hyperbolic geometry. For a reader which is not familiar and who has no time, we recommend the following solution. First, forget everything of Euclidean geometry and try to remember the few elements given in the glossary: do not worry, the Euclidean objects will always be the first thing to come to your mind, and most often, it will be misleading. Second, never forget that in traveling over hyperbolic spaces, you are in the situation of the pilot of a plane flying with instruments only. You can see nothing in the usual sense of these words and, sorry to repeat it again, the

Cellular Automata in Hyperbolic Spaces

13

usual intuition is misleading. The best introduction is to imagine that when you venture into the hyperbolic plane, always keep with you the Ariadne thread of the way backward. Otherwise, you will definitely be lost. With this precaution, you will never regret the trip. The landscape changes very quickly and you are always fascinated by its unbelievable beauty.

Induction step: Let P be the current pentagon. If P is the leading pentagon of a quarter Q (see P0 in Fig. 1), the complement of P in Q splits into two quarters, R1 and R3 and remaining region, R3, which we call a strip. If P is the leading pentagon of a strip S (see P1 in Fig. 1), the complement of P in S splits into a quarter S 1 and again a strip, S 2.

The Locating Problem in Hyperbolic Tilings

As proved in Margenstern (2007c, 2013), the set of tiles attached to the tree generated in this way, the leading pentagons of the above algorithm, is exactly the set of pentagons contained in the quarter Q0. With Margenstern (2000, 2007c), a new ingredient is brought in: number the nodes of the tree from the root, to which we attach 1, and then level by level, from left to right on each level (see Fig. 2). As already noticed in Margenstern and Morita (1999), the number of nodes of the tree which spans the tiling of a quarter which are on the same level k is f2kþ1 , where {fk}k ℕ with f(0) = f(1) = 1. For this reason, the spanning tree

The Classical Case of the Pentagrid The method introduced in Margenstern and Morita (1999) consists in constructing a bijection between the tiling and a tree, the spanning tree of the tiling. The tree is constructed in a recursive way, defined as follows (also see Fig. 1): Initial step: P0 is the root of the tree; it is called the leading pentagon of the quarter Q0; it defines by its sides 1 and 5. Cellular Automata in Hyperbolic Spaces, Fig. 1 The pentagrid: regular pentagons with vertex angle p2

5

S2

R3

P1

4

S1

1

P0

3 R2

2

R1

14

Cellular Automata in Hyperbolic Spaces 1 1 2

5

13

14

15

3

4

1

1

1

0

0

0

0

1

6

7

8

9

11

10

12

1

1

1

1

1

1

1

1

0

0

0

0

0

0

0

0

0

0

1

0

0

0

1

1

0

1

0

0

0

1

0

0

0

1

0

0

1

26 27

28 29

30

16

17

18 19

20 21 22

23 24

25

31 32

33

1

1

1

1

1

1

1

1

1

1

1

1

1

1

1

1

1

1

1

1

1

0

0

0

0

0

0

0

0

0

0

0

0

0

0

0

0

0

0

0

0

0

0

0

0

0

0

1

1

1

0

0

0

0

0

0

0

0

1

1

1

1

1

0

0

0

1

1

0

0

0

0

0

0

0

0

1

1

1

0

0

0

0

0

0

0

1

0

0

0

0

1

0

0

0

1

1

0

0

0

0

0

0

1

1

0

1

0

0

1

0

1

0

0

0

1

0

0

0

0

1

0

0

1

0

0

0

1

0

0

1

0

1

0

0

1

0

0

1

Cellular Automata in Hyperbolic Spaces, Fig. 2 The Fibonacci tree

of the pentagrid is called the standard Fibonacci tree, illustrated by Fig. 2. Note that on level k, the first node is numbered f2k and the last one f2kþ21 : The above splitting induces a particular structure on the standard Fibonacci tree. Define white nodes as nodes which have three sons and black nodes as nodes which have two sons. Black and white are the two possible values of the status of a node. Then, there is a rule to define the status of the sons of a node. We can write them as follows, in self-explained notations: W ! BWW B ! BW: As initially performed in Margenstern (2000), let us represent the numbers attached to the nodes of the Fibonacci tree in the numeration basis defined by the Fibonacci sequence itself, starting from f1. The representation is not unique. Choose the

longest representation with respect to the lexicographic order and call it the coordinate of the node to which the corresponding number is attached. First, we have that the set of coordinates is a regular language, which is a corollary of a wellknown theorem (see Fraenkel 1985). Now we have a more interesting property, which was first noticed in Margenstern (2000) and which we call the preferred son property. Let ak. . .a0 be the coordinate of a node n of the standard Fibonacci tree, with a0 as the lightest digit of the representation. Denote it by [n]. The property says that for each node n of the standard Fibonacci tree, there is exactly one son of n whose coordinate is [n]00. This son is called preferred. Moreover, there is a rule to find out the preferred son from the status of a node: in a black node, the preferred son is the black son; in a white node, the preferred son is the middle one.

Cellular Automata in Hyperbolic Spaces

Generalization: The Splitting Method The generalization was first announced in Margenstern (2002a). It was then presented in Margenstern (2002b), with a new visit to Poincare´’s theorem, at the occasion of the second century of the birth of Jànos Bolyai. The method defines a basis of splitting and then the notion of a combinatoric tiling. Two important consequences can be derived from these very definitions to which we turn now. Let S0, . . ., Sk be finitely many parts of some geometric metric space X which are supposed to be closed, with nonempty interior, unbounded and simply connected. Consider also finitely many closed simply connected bounded sets P1, . . ., Ph with h k. Say that the Sis and P‘s constitute a basis of splitting if and only if: (i) X splits into finitely many copies of S0 (ii) Any Si splits into one copy of some P‘, the leading tile of Si, and finitely many copies of Sjs where copy means an isometric image and where, in the condition (ii), the copies may be of different Sjs, Si possibly included. As usual, it is assumed that the interiors of the copies of P‘ and of the copies of the Sjs are pairwise disjoint. The set S0 is called the head of the basis and the P‘s are called the generating tiles, and the Sis are called the regions of the splitting. On the example of the pentagrid, a basis of splitting is given by a quarter Q and a strip S . When there is a basis of a splitting, we then define: Say that a tiling of X is combinatoric if X has a basis of splitting and if the spanning tree of the splitting yields exactly the restriction of the tiling to the head S0 of the basis.

In Margenstern and Morita (1999) and Margenstern (2007c), the pentagrid is proved combinatoric. A lot of other tilings of the hyperbolic plane are combinatoric. In particular, all the tilings {p, q}, with q 4, possess this property. It is also the case for the tilings {p, 3}, with p 7 which live in the hyperbolic plane (see

15

Margenstern 2007c, 2013). In higher dimension, the following tilings were proved combinatoric: the 3D tiling {5, 3, 4}, the dodecagrid (see Margenstern and Skordev (2003b) and Margenstern (2007c)), and the 4D tiling {5, 3, 3, 4}, based on the 120-cell (see Margenstern 2004, 2007c). Once a tiling is combinatoric, from the definition of its basis of splitting, we can derive a square matrix M called the matrix of the splitting (see Margenstern 2002a, 2007c). Its lines indicate, for each column, the number of copies of Sjs entering in the splitting of Si. The polynomial of the splitting is the characteristic polynomial of M, divided by the greatest power of X it contains as a factor. In our cases, this polynomial has a greatest real root. The polynomial of the splitting induces a recurrent equation which defines the sequence of the splitting with appropriate initial values. The maximal representations of numbers in the basis defined by the sequence of the splitting constitute the language of the splitting. As proved in Margenstern and Skordev (2003a) and Margenstern (2007c), the language of the splitting of the tilings {p, q} is regular when q 4 and p 4.

Implementation of Cellular Automata in Hyperbolic Spaces The implementation of HCAs is induced by the results mentioned in the previous section. But first, let us go back to the general definition of CAs. Three conditions must be fulfilled by a set of cells to be called a cellular automaton. The cells of the automaton must uniformly be distributed in the considered space. The neighborhood of each cell is defined in a uniform way. At each top of the discrete clock, all the cells update their own state according to the same function applied to the state of the cell and the sequence of states of its neighbors. To implement cellular automata, we have to satisfy these three requirements. The first two conditions are easily satisfied in a tessellation. Note that this is the standard frame

16

for CAs in the Euclidean plane and in the 3D Euclidean space. The third condition already requires that we have a system of coordinates for the tiles at our disposal. More than three centuries after Descartes’ discovery of the system of coordinates which everybody uses for the Euclidean plane, this condition is trivially fulfilled. This is not only the three-century usage. This is also the case because the mathematical structure of the group of displacements which leaves the considered tessellations of the Euclidean plane globally invariant is a very simple structure. The situation is very different in the case of hyperbolic spaces. Before Margenstern (2000), there was no convenient, at least fast, procedure to define the coordinates of the tiles in a way which is in connection with the geometrical properties of the tiling. Now, the splitting method gives such a solution. First, it effectively exhibits a tree which generates the tiling. As Gromov pointed out (Gromov 1981), hyperbolic spaces are characterized by a tree structure. Second, it provides fast algorithms to handle these coordinates. By fast, we mean that the basic algorithms we need are linear in time with respect to the coordinate of the initial point. Note that nobody really matters with the fact that addition of vectors in Euclidean coordinates is linear, while multiplication of coordinates by a scalar is not. Here, we have no addition, no multiplication, and no nice formula. We have algorithms only, but they turn out to work in the best time. The result of these considerations is that the directions, north, south, east, and west, which play a so nice role in the Euclidean case no more exist. In fact, we have infinitely many directions, each of which defines an essential direction in the space: if you follow other directions, you will never go to the area covered by this one. Of course, an infinite amount of information is ruled out in computer science. And so, we replace this basic indetermination of the direction by the direction of the father. Of course, we are led to a root and a central cell, but nobody complains about using an origin in the Euclidean case. Moreover, as shown in Margenstern (2006a,

Cellular Automata in Hyperbolic Spaces

2007c), it is also possible in the case of tessellations of the hyperbolic plane to get rid of the origin. We just mention this point, here, and refer the interested reader to the quoted papers for a closer study. Once again, we illustrate how we proceed by the case of the pentagrid. It is repeated in the case of the heptagrid (see Margenstern 2006a, 2007a) and in the case of the dodecagrid (see Margenstern 2006b). For the implementation, we first fix a basis of splitting and the representation of the tiling. As indicated in Margenstern (2000, 2007c), there are a lot of choices with the same basis of splitting. Moreover, in the case of the pentagrid and of the heptagrid in which the standard Fibonacci tree is also a spanning tree, we have the choice between using the Fibonacci sequence, as we did in section “The Locating Problem in Hyperbolic Tilings,” and using the basis derived from the polynomial of the splitting. The difference is that the Fibonacci pﬃﬃ sequence is defined by the golden mean 1þ2 5 , while the sequence of the splitting pisﬃﬃ defined by the square of the golden mean, 3þ2 5 Let us go on with the Fibonacci sequence, as is it used in the majority of papers. The preferred son property allows us to compute very easily the coordinates of the neighbors of a cell n from [n]: the computation is linear in time with respect to the length of [n] (see Margenstern 2003, 2007c). Similarly, the path from a cell n to the root of its tree can be computed in a linear time with respect to the length of [n] (again see Margenstern 2003, 2007c). As a simple example, if m is defined by ½n ¼ ½ma1 a0 , where a 0 is the lowest digit of [n], the father of n has m þ a1 as its number. What we indicated up to now fixes the coordinates for a cell whose supporting tile is in a given quarter. We can consider the central cell as the root of a tree whose sub-trees are exactly the five initial quarters which lie around the central pentagon. Now, it is enough to number the five sub-trees attached to these quarters in order to completely define the coordinates of a cell. The central pentagon has 0 as a unique coordinate. All other cells are defined by two numbers: (a, n). The

Cellular Automata in Hyperbolic Spaces

first number, a is in {1. . .5} and defines the quarter. The second number, v, defines the tile in the indicated quarter. Together with its coordinate, a cell is associated with other data: the status of its supporting tile and the indication of which side is shared with its father. On one hand, note that the coordinate is a hardware feature: it is never known by the cell and it cannot be – it has not a bounded size. Note that this is the same for CAs in Euclidean spaces. On the other hand, the status of the supporting node can be known by the cell. As shown in Margenstern (2003), one can define rules for a cellular automaton to dispatch this information. As it is a finite information which can be provided by the hardware, we may assume that the cell knows it.

Complexity of Cellular Automata in Hyperbolic Spaces Now, we are ready to give the results about the complexity classes of HCAs. SAT and NP-Complete Problems In Margenstern and Morita (1999), HCAs are proved to be able to solve SAT in polynomial time. Historically, the possibility to solve NP-complete problems in the hyperbolic plane was first announced in Morgenstein and Kreinovich (1995). Although the authors of Margenstern and Morita (1999) were not aware of paper (Morgenstein and Kreinovich 1995), the latter paper does not involve cellular automata and does not provide a precise description of how SAT can be solved in the new frame. On the contrary, Margenstern and Morita (1999) describe a HCA which is able to solve the problem. In Margenstern and Morita (1999), the computation is estimated as quadratic. In fact it can be proved to be linear in the size of the input. The solution for SAT is easy: it makes use of a Fibonacci tree, in which only two nodes are selected among the sons of a node. Each level represents the possible assignment of true and false values to the variable indexed by this level. The computation of all possible assignments until the level n, where n is the number of

17

variables, is triggered at initial time. Once it is reached, the information comes back to the root from the leaves of the tree, i.e., the nodes which are on the level n of the tree: each node computes the OR on the values of its left-hand side and right-hand side sons. Accordingly, the root gives true if and only if there is a branch from it to a leaf along which the value is always true. From this, applying classical tools of the theory of complexity, we obtain that any NP-complete problem can be solved in polynomial time by an appropriate cellular automaton of the hyperbolic plane. P = NP in the Hyperbolic Plane From what we have seen previously, we have that the classical class NP is contained in the class of HCAs which work in polynomial time, denote it by Ph. Now, it is also possible to define NPh for HCAs, taking the classical definition of nondeterministic computations in polynomial time. As shown in Iwamoto et al. (2002), it turns out that Ph = NPh. The key point is that the computation of a nondeterministic Turing machine in time O(t(n)), with t(n) n, can be computed by a deterministic HCA in time O(t2(n)). From this theorem, the following surprising result can easily be derived (see Iwamoto et al. 2002): Ph ¼ NPh ¼ PSPACE, where PSPACE is the classical class of functions computed in polynomial space by a Turing machine. Of course, in these results, a basic ingredient is the possibility, given by the hyperbolic plane, to occupy a working space of exponential area within a polynomial time. The above process for solving SAT is a basic example of such a possibility. Other Parts of the Complexity Hierarchy of HCAs In fact, if we look at the hierarchy of complexity classes for HCAs, we get a landscape which is very different from the classical situation.

18

We have the following situation, described in Iwamoto and Margenstern (2003): DLOGh ¼ NLOGh ¼ Ph ¼ NPh ¼ PSPACE ⊈PSPACEh ¼ EXPTIMEh ¼ NEXPTIMEh ¼ EXPSPACE: We can notice that compared to the Euclidean analogs, the hyperbolic hierarchy seems to be very flat. As, by construction, Ph ⊈EXPTIMEh ; there are indeed two classes on which the hierarchy concentrates. We also have NPh ⊈APh ; unless PSPACE ¼ NEXPTIME, where APh denotes the class of alternate HCAs. As with classical machines, an alternate HCA is defined on the set of configurations of a nondeterministic HCA. In the tree of these configurations, certain nodes are called existential; others are called universal. At an existential node, the node is accepting if and only if it has at least one accepting child. At a universal node, the node is accepting if and only if all its children are accepting. The result about APh indicates a similar situation with the Euclidean classes where P⊈AP, unless P ¼ PSPACE: Accordingly, we may expect that alternating HCAs should be more powerful than HCAs, either deterministic or nondeterministic.

On Specific Problems of Cellular Automata Characterization of a HCA For classical cellular automata, i.e., for cellular automata in a Euclidean space, there is a wellknown characterization of cellular automata in terms of operations on the space of configurations. Consider the most studied case of the square grid in the Euclidean plane. The grid is most often identified with ℤ2 so that if Q is the set of states of a 2 cellular automaton, C = Qℤ is the set of all possible configurations for a cellular automaton on ℤ2 with states in Q A cellular automaton A on ℤ2 with states in Q defines an operator on C called the global function of A denoted by F A . A famous theorem (see Hedlund 1969), says that if A is a

Cellular Automata in Hyperbolic Spaces

cellular automaton A with states in Q on ℤ2, F A is a continuous operator on C, fitted with the product topology, which also commutes with the shifts on ℤ2. The remarkable property is that the converse is true. However, if we take a continuous operator F on C which commutes with shifts, the proof of the theorem does not allow us to obtain an effective process that would provide a cellular automaton A such that F A = F. The problem is that there is no algorithm which would compute the radius of the neighborhoods of A from F. In Margenstern (2008d) we proved that a similar characterization exists for hyperbolic cellular automata on the pentagrid or the heptagrid, provided we consider rotation invariant cellular automata. The characterization holds for rotation invariant cellular automata on all tilings of the hyperbolic plane or of the hyperbolic 3D space whose tiling is algorithmically spanned by a tree. Synchronization of a HCA Although no paper is especially devoted to this problem, we mention it because it has an analog to the standard problem of the firing squad in one-dimensional CAs, and we shall use it in the next section. In fact, as mentioned more or less explicitly in papers devoted to HCA (see Iwamoto and Margenstern (2003) and Margenstern (2008a)), for instance, it is very easy to synchronize a disk or a sector inside a disk, defined by a tree rooted at the center of the disk. The idea is simply to simulate any classical algorithm of synchronization of a one-dimensional CA on each branch of the tree for each radius of the disk. The synchronization is linear in the radius of the disk or the height of the tree. Communications Between HCAs Another problem, more specific to HCAs, is the communication between HCAs, possibly distant ones. Two papers study the problem in different settings (see Margenstern 2006a, 2007a). In Margenstern (2006a) the question is: how to establish a contact between two cells of a HCA, possibly distant ones? The paper provides a solution based on a new system of coordinates in which there is no more an origin. The new system

Cellular Automata in Hyperbolic Spaces

is based on the possibility to represent the hyperbolic plane as a union of growing quarters. We fix such a sequence in an appropriate way. Each term of the sequence is a Fibonacci tree, indexed by an integer n, and it contains all the trees indexed by m when m n. Inside a given Fibonacci tree, we use the standard system of coordinates, indicated in section “The Locating Problem in Hyperbolic Tilings.” In the construction, the roots of the mentioned trees belong to a line d. It is not difficult to see that sending signals on d makes it possible for the cell to establish a contact in a linear time with respect to their mutual distance. In Margenstern (2007a), another problem is considered. This time all cells may dispatch messages, and each cell forwards the messages it receives and to which it does not want to reply. Accordingly, the same cell may be an emitter of messages, a receiver of messages, and a relay in the message system. The idea is to use the tree property to be in bijection with the tiling as follows: each emitting cell considers that it is the center of the hyperbolic plane, and the message is accompanied by an address which is updated by the relays and which is the address in the tree whose root is the sender of the message. This allows any receiver willing to answer the message to send it to the right emitter. Again, the complexity of the computation is linear in the mutual distance of a sender and a receiver. Also see subsection “Communications in a Network.”

Universality in Cellular Automata in Hyperbolic Spaces Of course, from the existence of universal cellular automata on the line, we conclude that there are universal HCAs. This means that there are HCAs which are able to simulate any universal device, as a Turing machine, for instance. There was recently a definite progress in the study of universal HCAs. From the first result about a universal HCA in the pentagrid with 22 states (see Herrmann and Margenstern 2003), we arrive to universal HCAs with two states in the hyperbolic plane and also in the hyperbolic 3D space (see subsection “Weakly Universal

19

HCAs with a Small Number of States”). There was also a paper about an intrinsically universal HCA (see subsection “An Intrinsically Universal HCA”). There was also very recently two papers about strong universality of HCAs with a rather small number of states (see subsection “Strong Universal HCAs with a Small Number of States”)

Weakly Universal HCAs with a Small Number of States First, we have to notice that the just-mentioned universal HCAs with a small number of states are in fact weakly universal HCAs. The term weak refers to two conditions: – The HCA needs an infinite initial configuration. – The initial configuration is ultimately periodic. Note that these conditions are standardly used with ordinary CAs where universality with a small number of states is investigated. The second condition requires some explanation. In the context of a hyperbolic space, the notion of periodicity is not as clear as it is in the Euclidean case. Accordingly, we mean, by ultimate periodicity that at large, i.e., outside a big enough domain, the configuration can be split into finitely infinite domains in each of which it is globally invariant under a shift depending on the domain. The results accumulated in the recent years. In the hyperbolic plane, there were a weakly universal HCA with nine states in the pentagrid (see Margenstern and Song 2009) and then two universal HCAs in the heptagrid: first with six states, (Margenstern and Song 2008), and then with four states (see Margenstern 2011b). Very recently, there was a weakly universal HCA in the tiling {13, 3} of the hyperbolic plane with two states only. In the dodecagrid, after the weakly universal HCA with five states (see Margenstern 2006b), there was a weakly universal HCA with three states (see Margenstern et al. 2010a) and then with two states (see Margenstern 2013), which is the best result in this tiling.

20

The above-mentioned universal HCAs with a small number of states are obtained by a similar construction. They all simulate a railway circuit with the kind of switches, described by Stewart (1994). Figure 3 illustrates the basic element on which the whole circuit is based. It makes use of the three kinds of switches used in the model: see the caption of the figure. While in Stewart (1994) a Turing machine is simulated, in Herrmann and Margenstern (2003) and Margenstern (2006b), we simulate a register machine. It can be remarked that the smaller number of states in the dodecagrid is due to the replacement of crossings in the railway circuit by bridges, thanks to the third dimension, which is also possible in the hyperbolic case. Moreover, as a cell in the hyperbolic 3D space has 12 neighbors, there are much more combinations of states which can be used to differentiate the relevant steps of the computation. Now, the progress mentioned in the quoted results was made possible by a refinement in the implementation of the railway model. A first progress was to improve the implementation of the switches and the crossings. Note that in all these situations, there is a tile to which the ways on which the locomotive runs converge, called the center. Initially, the center was signalized by a specific color which had to change during the crossing by the locomotive. Later, this center was distinguished from the other cells of the path by its neighborhood. This allowed to reduce the initial 22 states to 9 of them only. Then, there was an improvement on the implementation of the tracks which constitute the larger part of the circuit. In the first implementations, the tracks had a specific color. Later, the cells of the tracks were signalized by a specific neighborhood. Figure 4 illustrates the idle configurations at the crossings and the switches in the circuit devised for a weakly universal cellular automaton in the heptagrid with four states (see Margenstern 2011b, 2013). In order to reach two states only, the tracks had to be revisited again: they became one way, which entailed deep changes in the switches. This was enough in the dodecagrid as there is no crossing there. For the plane, this was not

Cellular Automata in Hyperbolic Spaces W 0

1 E1

1 R 0

E0

Cellular Automata in Hyperbolic Spaces, Fig. 3 The basic element of the railway circuit. Three kinds of switches: on the ways from R to E1 and to E2, we have a fixed switch. In a passive crossing, from W to R, the locomotive is sent to R. From R, in an active passage, the locomotive goes to E1 or to E2, never to W. At W, we have a flip-flop switch. It is always crossed actively: from above W in the picture. Once crossed, the direction to which the locomotive is sent is changed. At R, we have a memory switch. It may be crossed actively or passively. The direction of the switch is given by the last passive crossings. The circuit contains one bit of information. When the locomotive arrives through R, it reads the bit: 0 if it is sent to E0, 1 if it is sent to E1. When the locomotive arrives through W, it rewrites the bit and changes it to its opposite value, thanks to the concatenation of the action of the flip-flop with that of the memory switch

enough. It was needed to revisit the implementation of crossings. In Margenstern (2013), they are replaced by roundabouts, exploiting the possibility with two states to distinguish between 0 and 1 (Fig. 5). An Intrinsically Universal HCA The intrinsically universal HCA is required to simulate any HCA in the same space. Of course, both the simulating HCA and the simulated one are required to work starting from finite configurations only. In Margenstern (2008a), two ingredients are used to achieve the simulation. One ingredient is the synchronization algorithm mentioned in section “On Specific Problems of Cellular Automata.” The second is the construction of scaled trees. The construction consists in building a new Fibonacci tree inside the tiling but with a constant distance k between two consecutive nodes on a same branch. It is not difficult to construct such a tree, which is illustrated by Fig. 6. The constant k is computed in such a way that a disk of radius k contains both an encoding of the

Cellular Automata in Hyperbolic Spaces

21

Cellular Automata in Hyperbolic Spaces, Fig. 4 Heptagrid and four states: the idle configurations at crossings and switches. From left to right: crossing, fixed switch, memory switch, and flip-flop. For the

memory switch and the flip-flop, we represented the lefthand side version only: the right-hand side ones can easily be devised from these ones

E

C

F

B

A

D

A

0

Cellular Automata in Hyperbolic Spaces, Fig. 5 Configuration at a roundabout in {13, 3}. Lefthand side: general view; right-hand side: zoom at a branching. Right-hand side picture. Arrival at a

roundabout, first branching: through E. Arrival at the second and third branching: through A. Exit through F at the third branching

initial configuration of the HCA to be simulated, say, A, and an encoding of the transition table of A. Figure 7 illustrates the mechanism of propagation of the scaled tree. Each step of the simulated HCA A is simulated by a cycle of steps of the simulating HCA U. The number of steps of U in a cycle is not constant. It may be increasing, especially if the simulated configuration is growing during its own computation. The synchronization algorithm of section “On Specific Problems of Cellular Automata” is used to delimit the stages into which a cycle is split. These stages are the reception of the current states of the neighbors of the simulated cell of A, for each simulating cell of U. When this is achieved, possibly at different times for each

simulating cell, the new state is determined, and it is installed in the appropriate region, controlled by the simulating cell. When this is performed, the cell waits until it is informed by its simulating sons that their step of computation is completed. When this is the case, the cells inform its father in the scaled tree that it finished its computation. Accordingly, when the central cell receives the message of completion from all its neighbors of the scaled tree, it knows that the computation of this step of A is finished. Then the comparison with the previous configuration is performed, thanks to a synchronization. Depending on the result of the comparison, the computation is stopped, if there was no difference, or it goes on, when a difference was noticed.

22

Cellular Automata in Hyperbolic Spaces

Cellular Automata in Hyperbolic Spaces, Fig. 6 A scaled tree by a factor 2

Cellular Automata in Hyperbolic Spaces, Fig. 7 Propagation of a scaled tree

Strong Universal HCAs with a Small Number of States The intrinsic cellular automaton of subsection “An Intrinsically Universal HCA” makes a natural transition to this subsection: that cellular automaton is strongly universal. It starts from a finite configuration, and it simulates a cellular automaton starting from a finite configuration. As mentioned in Margenstern (2008a), the number of states of such an automaton is enormous. Paper (Margenstern 2008a) does not even try to give an estimate to the number of states. In this section, we consider the possibility to devise a small strongly universal cellular automaton. A simple idea would be to implement a one-dimensional cellular automaton. This has

been performed in Margenstern (2010) for the weakly universal case. As underlined in that paper, the implementation of one dimensional into the pentagrid, the heptagrid, and the dodecagrid is easy if not almost trivial. Then, it is enough to implement the two-state weakly universal cellular automaton of Cook (2004) using the elementary cellular automaton defined by rule 110 (also see Wolfram et al. 2002). To reach strong universality, it is not that trivial: it is needed to go on an initial segment in such a way that the continuation of the segment remains a segment supported by the same line. It is also desirable that the continuation is performed at the same time as the computation itself. These constraints are satisfied in

Cellular Automata in Hyperbolic Spaces

Margenstern (2013a). Now, the problem was to find a small strongly universal cellular automaton on the line. In fact, as far as I know, such a cellular automaton does not exist. I thought that the cellular automaton with seven states constructed in Lindgren and Nordahl (1990) was such an automaton, but this is not the case for the following reason: This cellular automaton simulates a particular Turing machine which is not universal: what can only be said about it is that it has an undecidable halting problem. Note that this restriction was not known by the authors of Lindgren and Nordahl (1990) at the time of their paper, the automaton does not start its computation from a finite configuration. And so, in Margenstern (2013a), we first construct a strongly universal cellular automaton on the line with 14 states. Next, we implement this in a construction already defined in Margenstern et al. (2010b) and Margenstern (2013b). It turned out that the part of the working of the cellular automaton on the line which is performed after the halting of the simulated Turing machine can be replaced by a process which involves a single additional state. Moreover, a part of the constructing automaton can be obtained by using states of the one-dimensional cellular automaton. Eventually, we arrive at strongly universal cellular automata in the pentagrid, in the heptagrid, and in the dodecagrid, all of them with ten states (see Margenstern 2013a).

The Connection with Tiling Problems As usual, cellular automata have deep connections with tilings. This is probably the case with HCAs, although, up to now, the single connection is the possibility to implement them in the tilings, thanks to the coordinate system. However, this system itself appeared to be useful in order to investigate the properties of tilings in the hyperbolic plane and in the hyperbolic spaces of higher dimensions, namely, the dimensions 3 and 4.

23

Investigations in 3D and 4D Indeed, the splitting method could be applied to the tiling {5, 3, 4} of the hyperbolic 3D space (see Margenstern and Skordev (2003b) and Margenstern (2007c)). It turned out to be possible to use an old tool of the late nineteenth century, Schlegel diagrams, to both represent the tiles and the construction of the tiling as a process which is infinite in time. The application of the splitting method revealed an interesting property. The language of the splitting of this tiling provides us with a natural example of a language which is neither rational nor context free. As a corollary, the algorithm to compute the path from a tile to the root of its tree is cubic in time with respect to the size of the coordinate of the cell supported by the tile. The splitting method could also be applied to the tiling {5, 3, 3, 4} of the hyperbolic 4D space. It provides us with a simple system of coordinates to explore this tiling which is the natural extension of the tiling {5, 3, 4} of the hyperbolic 3D space. Note that the same process which allows to go from the pentagon with right angles to Poincare´’s dodecahedron also allows to go from that dodecahedron to the 120-cell. This process is called orthogonal completion in Margenstern (2004, 2007c). Together with an appropriate notion of interior and exterior, it allows to get a correct orientation in the hyperbolic 4D space and to correctly use the dimensional analogy with the spaces of lower dimension. The Tiling Problem The splitting method allowed the author to investigate the heptagrid rather deeply. This turned out to give him a way to solve a long pending problem: is the tiling problem decidable or not for the hyperbolic plane? This question was raised by Raphael Robinson in 1971 (see Robinson 1971), and it received a final negative answer with Margenstern (2008c) in 2008. The tiling problem asks whether there is an algorithm which, given a finite set of tiles called the prototiles, allows to say yes or no; it is possible to tile the plane with copies of the prototiles. In this setting, copies mean isometric images according the geometry of the space of the tiling. Also, it is understood

24

that if the tiles are decorated, a solution must satisfy the matching of any adjacent tiles along their common side. Robert Berger proved in 1966 (see Berger 1966) that the tiling problem is undecidable in the Euclidean plane. In Robinson (1971), Raphael Robinson significantly simplified Berger’s solution and raised the question about the status of the same problem for the hyperbolic plane. Robinson himself gave a partial answer, when the first tile is fixed, to this problem in 1978 (see Robinson 1978). A few weeks after the time when the result published in Margenstern (2008c) was announced (see Margenstern et al. 2007b), another solution of the same problem was claimed (see Kari 2007). The solution given in Margenstern (2008c) turned out to be very fruitful: the construction given in Margenstern (2008c) allows us to prove the undecidability of the periodic tiling problem (see Margenstern 2009a) and then the undecidability of the finite tiling problem (see Margenstern 2008e). Also, another important result was obtained by a refinement of the construction produced in Margenstern (2008c): the injectivity of the global function of a cellular automaton of the hyperbolic plane is also undecidable (see Margenstern 2009b). It also turned out that the classical theorems connecting the surjectivity of the global function of a cellular automaton with the injectivity and the injectivity on finite configurations are no more true for hyperbolic cellular automata (see Margenstern 2009c).

Possible Applications A few applications of the theory described in the previous sections were indicated, in particular in Margenstern (2008b). We mention three of them. Color Chooser The first one is a color chooser. It consists in a representation of the heptagrid in Poincare´’s disk, as illustrated by the left-hand side picture of Fig. 8. At each step, the user selects a neighbor v of the central cell. At the next time, v appears at the central place. The motion is repeated until the user finds out the color he/she wished.

Cellular Automata in Hyperbolic Spaces

In order to go back, an additional facility is given: a compass, in the form of a point which indicates the direction where the central cell lies when it is no more visible in the disk. If the user wants to go back to the central cell, it is enough to go to the direction of the compass as long as the central cell is no more visible in the disk. What can be seen is illustrated by the right-hand side picture of Fig. 8. A Japanese Keyboard for Cell Phones Another application deals with cell phones with a possible way to write messages in Japanese. The idea is based on the fact that the Japanese language has two syllabic alphabets, hiraganas and katakanas, for phonetic purpose. These syllabic alphabets are based on five vowels and the same series of consonants is used for each vowel. The corresponding syllabic signs are dispatched as indicated in Fig. 9. The use of the keyboard is similar to that of the color chooser. It can be noticed that any syllabic sign can be reached in at most three clicks on the keys. Communications in a Network The situation of Margenstern (2007a) was thoroughly studied in Margenstern (2012). The communication protocol described in Margenstern (2007a) was implemented in the heptagrid with an additional feature. In Margenstern (2007a), it was decided that the decision by a cell to send messages or to reply to messages it receives follows a Poisson law. Of course, the Poisson coefficients are different. In Margenstern (2012), in order to be more realistic, it was decided that a message sent by a cell cannot run forever at infinity. When it is sent, it is dispatched within a disk of radius r, where r is a randomly fixed integer again following a Poisson law. Two experiments where performed with a help of a simulation through a computer program. The difference between the experiments was the size of the expansion radius of a message and the coefficients of the Poisson laws followed by the different parameters. In Margenstern (2012), an account of both experiments is given. The experiments indicate that the model seems to be reasonable. See Margenstern (2012) for more details.

Cellular Automata in Hyperbolic Spaces

25

Cellular Automata in Hyperbolic Spaces, Fig. 8 Left-hand side: idle position of the color chooser. Middle: the user chooses to look at the blue colors. Right-hand side: the compass

Future Directions Interestingly, most problems indicated as a conclusion in the first edition of this entry received at least a partial solution in this second edition. Moreover, not indicated issues also received a solution, so that the hope written in the conclusion at that time that the method initiated by the implementation of cellular automata in hyperbolic spaces will help to improve the study of tilings in hyperbolic spaces turned out to be grounded. There are still problems, but we can say that the foundational work is almost completed. There are infinitely many tessellations in the hyperbolic plane. Each one is characterized by positive integers and no doubt that the arithmetical properties of these numbers play a key role. We just explored what can be roughly obtained for two or three couples of such numbers. Probably, much broader results can be obtained with a finer analysis of these arithmetic properties which may turn out to be useful for specific problems. As an example, it is argued in Margenstern (2008b) why, on the one hand, the heptagrid is more suited for the color chooser than the pentagrid and why, on the other hand, the pentagrid is more suited than the heptagrid for the Japanese keyboard. Let us hope that future investigations will comfort the possibilities offered by the infinitely many tessellations of the hyperbolic plane. Acknowledgment The author again thanks Andrew Adamatzky for giving him the task to write the first issue

Cellular Automata in Hyperbolic Spaces, Fig. 9 The Japanese keyboard

of this entry. He is also much in debt to Andrew Spencer for asking him this new version.

Bibliography Berger R (1966) The undecidability of the domino problem. Mem Am Math Soc 66:1–72 Chelghoum K, Margenstern M, Martin B, Pecci I (2004) Cellular automata in the hyperbolic plane: proposal for a new environment. Lect Notes Comput Sci 3305:678–687, proceedings of ACRI’2004, Amsterdam, October, 25–27, 2004

26 Cook M (2004) Universality in elementary cellular automata. Complex Syst 15(1):1–40 Fraenkel AS (1985) Systems of numerations. Am Math Mon 92:105–114 Gromov M (1981) Groups of polynomial growth and expanding maps. Publ Math l’IHES 53:53–73 Hedlund G (1969) Endomorphisms and automorphisms of shift dynamical systems. Math Syst Theory 3:320–375 Herrmann F, Margenstern M (2003) A universal cellular automaton in the hyperbolic plane. Theor Comp Sci 296:327–364 Iwamoto Ch, Margenstern M (2003) A survey on the complexity classes in hyperbolic cellular automata. Proceedings of SCI’2003, V, pp 31–35 Iwamoto Ch, Margenstern M, Morita K, Worsch Th (2002) Polynomial-time cellular automata in the hyperbolic plane accept exactly the PSPACE languages. SCI’2002. Orlando, pp 411–416 Kari J (2007) The tiling problem revisited. Lect Notes Comput Sci 4664:72–79 Lindgren K, Nordahl MG (1990) Universal computations in simple one-dimensional cellular automata. Complex Syst 4:299–318 Margenstern M (2000) New tools for cellular automata in the hyperbolic plane. J Univ Comp Sci 6(12):1226–1252 Margenstern M (2002a) A contribution of computer science to the combinatorial approach to hyperbolic geometry, SCI’2002, 14–19 July 2002. Orlando Margenstern M (2002b) Revisiting Poincare´’s theorem with the splitting method, talk at Bolyai’200, International Conference on Geometry and Topology, ClujNapoca, Romania, 1–3 October 2002 Margenstern M (2003) Implementing cellular automata on the triangular grids of the hyperbolic plane for new simulation tools, ASTC’2003. Orlando, 29 Mar- 4 Apr Margenstern M (2004) The tiling of the hyperbolic 4D space by the 120-cell is combinatoric. J Univ Comp Sci 10(9):1212–1238 Margenstern M (2006a) A new way to implement cellular automata on the penta- and heptagrids. J Cell Autom 1(1):1–24 Margenstern M (2006b) A universal cellular automaton with five states in the 3D hyperbolic space. J Cell Autom 1(4):317–351 Margenstern M (2007a) On the communication between cells of a cellular automaton on the penta- and heptagrids of the hyperbolic plane. J Cell Autom (to appear) Margenstern M (2007b) About the domino problem in the hyperbolic plane, a new solution. arXiv:cs/0701096, (Jan 2007), p 60 Margenstern M (2007c) Cellular automata in hyperbolic spaces, theory, vol 1. Old City Publishing, Philadelphia, 422p Margenstern M (2008a) A uniform and intrinsic proof that there are universal cellular automata in hyperbolic spaces. J Cell Autom 3(2):157–180

Cellular Automata in Hyperbolic Spaces Margenstern M (2008b) Cellular automata in hyperbolic spaces, volume 2, implementation and computation. Old City Publishing, Philadelphia, 360p Margenstern M (2008c) The domino problem of the hyperbolic plane is undecidable. Theor Comp Sci 407:29–84 Margenstern M (2008d) On a characterization of cellular automata in tilings of the hyperbolic plane. Int J Found Comp Sci 19(5):1235–1257 Margenstern M (2008e) The finite tiling problem is undecidable in the hyperbolic plane. Int J Found Comp Sci 19(4):971–982 Margenstern M (2009a) The periodic domino problem is undecidable in the hyperbolic plane. Lect Notes Comput Sci 5797:154–165 Margenstern M (2009b) The injectivity of the global function of a cellular automaton in the hyperbolic plane is undecidable. Fundam Inform 94(1):63–99 Margenstern M (2009c) About the garden of Eden theorems for cellular automata in the hyperbolic plane. Electron Notes Theor Comp Sci 252:93–102 Margenstern M (2010a) A weakly universal cellular automaton in the hyperbolic 3D space with three states. Discrete Mathematics and Theoretical Computer Science. Proceedings of AUTOMATA’2010, pp 91–110 Margenstern M (2010b) Towards the frontier between decidability and undecidability for hyperbolic cellular automata. Lect Notes Comput Sci 6227:120–132 Margenstern M (2010c) An upper bound on the number of states for a strongly universal hyperbolic cellular automaton on the pentagrid, JAC’2010, 15–17 Dec 2010. Turku, Finland, Proceedings, Turku Center for Computer Science 2010. ISBN 978-952-12-2503-1, 168-179 Margenstern M (2011a) A new weakly universal cellular automaton in the 3D hyperbolic space with two states. Lect Notes Comput Sci 6945:205–2017 Margenstern M (2011b) A universal cellular automaton on the heptagrid of the hyperbolic plane with four states. Theor Comp Sci 412:33–56 Margenstern M (2012) A protocol for a message system for the tiles of the heptagrid, in the hyperbolic plane. Int J Satell Commun Policy Manag 1(2–3):206–219 Margenstern M (2013a) Small universal cellular in hyperbolic spaces, a collection of jewels. Emergence, Complexity and Computation, Springer, p 320 Margenstern M (2013b) About strongly universal cellular automata. Proceedings of MCU’2013, (2013) EPTCS 128, 93–125 Margenstern M, Morita K (1999) A polynomial solution for 3-SAT in the space of cellular automata in the hyperbolic plane. J Univ Comput Syst 5:563–573 Margenstern M, Morita K (2001) NP problems are tractable in the space of cellular automata in the hyperbolic plane. Theor Comp Sci 259:99–128 Margenstern M, Skordev G (2003a) The tilings {p, q} of the hyperbolic plane are combinatoric, SCI’2003, V, pp 42–46

Cellular Automata in Hyperbolic Spaces Margenstern M, Skordev M (2003b) Tools for devising cellular automata in the hyperbolic 3D space. Fundam Inform 58(2):369–398 Margenstern M, Song Y (2008) A universal cellular automaton on the ternary heptagrid. Electron Notes Theor Comp Sci 223:167–185 Margenstern M, Song Y (2009) A new universal cellular automaton on the pentagrid. Parallel Process Lett 19(2):227–246 Morgenstein D, Kreinovich V (1995) Which algorithms are feasible and which are not depends on the geometry of space-time. Geombinatorics 4(3):80–97

27 Martin B (2005) VirHKey: a virtual hyperbolic keyboard with gesture interaction and visual feedback for mobile devices, MobileHCI’05, Sept. Salzburg Robinson RM (1971) Undecidability and nonperiodicity for tilings of the plane. Invent Math 12:177–209 Robinson RM (1978) Undecidable tiling problems in the hyperbolic plane. Invent Math 44:259–264 Ro´ka Z (1994) One-way cellular automata on Cayley graphs. Theor Comp Sci 132:259–290 Stewart I (1994) A subway named turing, mathematical recreations in scientific American. pp 90–92 Wolfram S (2002) A new kind of science. Wolfram Media

Structurally Dynamic Cellular Automata Andrew Ilachinski Center for Naval Analyses, Alexandria, VA, USA

Article Outline Glossary Deﬁnition of the Subject Introduction The Basic Model Emerging Patterns and Behaviors SDCA as Models of Computation Generalized SDCA Models Related Graph Dynamical Systems SDCA as Models of Fundamental Physics Future Directions and Speculations Bibliography

Glossary Adjacency matrix The adjacency matrix of a graph with N sites is an N N matrix [aij] with entries aij = 1 if i and j are linked, and aij = 0 otherwise. The adjacency matrix is symmetric (aij = aji) if the links in the graph are undirected. Coupler link rules Coupler rules are local rules that act on pairs of next-nearest sites of a graph at time t to decide whether they should be linked at t + 1. The decision rules fall into one of three basic classes – totalistic (T), outer-totalistic (OT) or restricted-totalistic (RT) – but can be as varied as those for conventional cellular automata. Decoupler link rules Decoupler rules are local rules that act on pairs of linked sites of a graph at time t to decide whether they should be unlinked at t + 1. As for coupler rules, the decision rules fall into one of three basic classes – totalistic (T), outer-totalistic (OT) or

restricted-totalistic (RT) – but can be as varied as those for conventional cellular automata. Degree The degree of a node (or site, i) of a graph is equal to the number of distinct nodes to which i is linked, and where the links are assumed to possess no directional information. In general graphs, the in-degree (= number of incoming links towards i) is distinguished from the out-degree (= number of outgoing links originating at i). Effective dimension A quantity used to approximate the dimensionality of a graph. It is deﬁned as the ratio between the average number of next-nearest neighbors to the average degree, both averaged over all nodes of the graph. The effective dimension equals the Euclidean dimension d, in cases where the graph is the familiar d-dimensional hypercubic lattice. Graph A graph is a ﬁnite, nonempty set of nodes (referred to as “sites” throughout this article), together with (a possibly empty) set of edges (or links). The links may be either directed (in which case the edge from a site i, say, is directed away from i toward another site j, and is considered distinct from another directed edge originating at j and pointed toward i) or undirected (in which case if a link exists between sites i and j it carries no directional information). Graph grammar Graph grammars (sometimes also referred to as graph rewriting systems) apply formal language theory to networks. Each language speciﬁes the space of “valid structures”, and the production (or “rewrite”) rules by which given graphs may be transformed into other valid graphs. Graph metric function The graph metric function deﬁnes the distance between any two nodes, i and j. It is equal to the length of the shortest path between i and j. If no path exists (such as when i and j are on two disconnected components of the same graph), the distance is assumed to be equal to 1.

# Springer-Verlag 2009 A. Adamatzky (ed.), Cellular Automata, https://doi.org/10.1007/978-1-4939-8700-9_528 Originally published in R. A. Meyers (ed.), Encyclopedia of Complexity and Systems Science, # Springer-Verlag 2009 https://doi.org/10.1007/978-0-387-30440-3_528

29

30

Graph-rewriting automata Graph-rewriting automata are generalized CA-like systems in which both (the number of) nodes and links are allo wed to change. Next-nearest neighbor Two sites i and j are next-nearest neighbors in a graph if (1) they are not directly linked (so that aij = 0; see adjacency matrix), and (2) there exists at least one other site k such that k 2 = {i, j}, and i and j are both lined to k. Random dynamics approximation The longterm behavior of structurally dynamic cellular automata may be approximated in certain cases (in which the structure and value conﬁgurations are both sufﬁciently random and uncorrelated) by a random dynamics approximation: values of sites are replaced by the probability ps of a site having value s (and is assumed to be equal for all sites), and links between sites are replaced by the probability p‘ of being linked (and also assumed to be the same for all pairs of sites). The approximation often yields qualitatively correct predictions about how the real system evolves under a speciﬁc set of rules; for example, to predict whether one expects unbounded growth or that the lattice will eventually settle onto a low periodic state or simply decay. Restricted totalistic rules Restricted totalistic rules are a generalized class of link rules (operating on pairs of sites, i and j), analogous to “outer totalistic” rules (that operate on site values) used in conventional CA. The local neighborhood around i and j is ﬁrst partitioned into three sets: (1) the two sites, i and j; (2) sites connected to either i or j, but not both; and (3) sites connected to both i and j. The restricted totalistic rule is then completely deﬁned by associating a speciﬁc action with each possible 3-tuple of site-value sums (where the individual components represent a unique sum in each of the three neighborhoods). Structurally dynamic cellular automata Structurally dynamic cellular automata are generalizations of conventional cellular automata models in which the underlying lattice structure is dynamically coupled to the local site-value conﬁgurations.

Structurally Dynamic Cellular Automata

SDCA model hierarchy The SDCA model hierarchy is a set of eight related structurally dynamic cellular automata models, deﬁned explicitly for studying their formal computational capabilities. The hierarchy is ordered (from lowest to highest level) according to their relative computational strength. For example, the SDCA model at the top of the hierarchy is capable of simulating a conventional CA with a speedup factor of two.

Definition of the Subject Structurally dynamic cellular automata (abbreviated, SDCA) are a generalized class of CA in which the topological structure of the (usually quiescent) underlying lattice is dynamically coupled to the local site value conﬁguration. The coupling is deﬁned to treat geometry and value conﬁgurations on an approximately equal footing: the lattice structure is altered locally as a function of individual site neighborhood valuestates and geometries, while the underlying local topology supports site-value evolution precisely as in conventional nearest-neighbor CA models deﬁned on random lattices. SDCA provide a dynamical framework for a CA-like analysis of the generation, transmission and interaction of topological disturbances in a lattice. Moreover, they provide a natural testbed for studying self organized geometry; by which we mean true structural evolution, and not merely space-time patterns of value conﬁgurations that may be interpreted geometrically (but are really just “bits” of information overlayed on top of an otherwise static background lattice).

Introduction SDCA were formally introduced in 1986 as part of a physics doctoral dissertation by Ilachinski (1988), and developed further by Ilachinski and Halpern (1987a, b), Halpern (1989, 1996), Halpern and Caltagirone (1990), Majercik (1994), and Alonso-Sanz and Martín (2006), Alonso-Sanz (2006, 2007); in their original

Structurally Dynamic Cellular Automata

incarnation (Ilachinski 1986), and at least two subsequent papers (Halpern and Caltagirone 1990; Rose 1993), SDCA were called topological automata. Pedagogical discussions appear in Adamatzky (1995) and Ilachinski (2001). Extensions of the basic SDCA model (all discussed in this article) include the addition of probabilistic rules, memory and reversibility. Applications include the simulation of crystal growth (Krivovichev 2004), the study of pattern formation of random cellular structures (Schliecker 1998), modeling synaptic plasticity in neural network models (Gerstner and Kistler 2002), phase transitions in chemical systems (Rose et al. 1994), chemical self-assembly (Hasslacher and Meyer 1998), and generegulatory networks (Halpern and Caltagirone 1990). Majercik (1994) hasstudied SDCA as generalized models of computation, and describes a CA-universal SDCA that can simulate any conventional CA of the same dimension. More recently, O’Sullivan (2001) and Saidani (2003, 2004) have used graph-based CA models similar to SDCA to study urban dynamics and emergent behaviors of self-reconﬁgurable robots, respectively. Tomita et al. (2002, 2005, 2006a, b, c) have introduced graph-rewriting automata in which both links and (the number of) nodes are allowed to change; and show that these systems are capable of both self-replication and Turing universality (among with many other emergent behaviors). Since SDCA provide the basic formalism for describing locally induced topological changes within arbitrary graphs, they are a potentially powerful general tool for studying complex adaptive networks, such as communication and social networks (Alonso-Sanz and Martin 2006). The concept behind SDCA has also been used as a foundation for philosophical musings about computationally emergent artiﬁciality (Mustafa 1999). More ambitious applications of SDCA encroach on fundamental physics. Because SDCA are inherently self-modifying systems – in which physical events are not just dynamically coupled to, but are an integral part of the spatiotemporal arena on which their transformations are deﬁned – they are a potentially powerful methodological and ontological tool for exploring

31

discrete pre-geometric theories of space-time (Meschini et al. 2005). Just as “value structure” solitons are ubiquitous in conventional CA models (Ilachinski 2001; Wolfram 1984), “link structure” solitons might emerge in SDCA; physical particles would, in such a scheme, be viewed asgeometrodynamic disturbances propagating within a dynamic lattice. Three SDCA-like theories of pregeometry have recently been proposed in which space-time is a self-organized emergent construct: Hillman (1995), Nowotny and Requardt (2006) and Wolfram (2002). Finally, we brieﬂy comment on ostensible overlaps between SDCA and four other related ﬁelds of study: (1) Lindenmeyer (or L-) systems, (2) graph grammars, (3) random graphs (abbreviated, RG), and (4) dynamic network analysis (abbreviated, DNA). L-systems (Prusinkiewicz and Lindenmayer 1990) are generalized CA systems in which the number of sites can grow with time, and consist of recursive rules for rewriting strings of symbols. If interpreted graphically, abstract symbol strings can be used to model growth processes of plants and evolving morphology of physical organisms. Graph grammars (Grzegorz 1997; Kniemeyer et al. 2004) apply formal language theory to networks, and consist of production rules that deﬁne the set of “valid structures” in a given graph language. The study of RG (Durrett 2006) was introduced by Erdos and Renyi in the late 1950s (Erdos and Renyi 1960), and is a mathematical framework for exploring the general topological structures of computational systems and the behavior of certain random dynamical systems. Like SDCA, RG describes evolving graphs, but the dynamics are global and random. DNA (Mendes 2004; Newman et al. 2006) is an emerging ﬁeld that fuses traditional social network theory with statistical analysis and modeling; part of its charter is to explore general properties of network generation and evolution. While, conceptually speaking, there is a prima facie relationship between SDCA and all four ﬁelds of study, the elucidation of a more precise nature of the relationship between SDCA and these other systems awaits a future study. (The relationship appears particularly strong between SDCA and a generalized L-system called the

32

Structurally Dynamic Cellular Automata

graph development system (abbreviated, GDS), introduced by Doi (1984), but not developed further since its original conception. Using incidence matrices to represent arbitrary topologies, GDS is essentially a grammar by which sub matrices of the whole matrix are rewritten to describe topological changes. SDCA also formally falls under the broader rubrics of DNA and RG; however, there is no explicit reference to SDCA in the current literature of either ﬁeld.)

The Basic Model Conventional CA are deﬁned on ﬁxed, and typically regular, lattices (one-dimensional lines, twodimensional Euclidean or hexagonal grids, etc.), the sites of which are populated with discrete-valued dynamic elements ( si {0, 1, . . ., k}, where i labels a particular site on the lattice) that evolve 0 according to local transition functions, f : si ! si . We emphasize that the dynamics of conventional CA are conﬁned to the temporal evolution of the sis. SDCA generalize conventional CA in two ways: (1) they relax the assumption that the underlying lattice is uniform, allowing the local site $ site connectivity pattern to vary throughout the lattice; and (2) they allow both the set {si} and the lattice to evolve according to local transition rules. The most obvious – also the most dramatic – conceptual change this entails over the dynamics of conventional CA, is that the meaning of “local” itself changes as a function of how the SDCA system evolves: previously far separated sites may become neighbors; and sites that are local at time t may become far separated at some later time, t0. To properly deﬁne SDCA, we ﬁrst generalize regular lattices to mathematical graphs G () possessing arbitrary topology. Assuming G has N lattice sites, and that G is (for now) an undirected graph (meaning that none of G’s links carry directional information), G is completely deﬁned by the N-by-N adjacency matrix, ‘ij: ‘ij ¼

1 0

if i and j are linked; otherwise:

Using the graph metric function,

(1)

Dij ¼ Minimum #links, l rs j fr,sg Pij , Paths,Pij

(2)

we can write a general r-neighborhood CA value-transition rule ‘f’ (which will from now on refer generically to as a s-rule) in the form stþ1 ¼f i

hn o i stj j j S G r ðiÞ ,

(3)

where S G r ðiÞ ¼ jj Dij r is the radius-r graph sphere about the site i. In words, the value of stþ1 i is some function, f, of the values stj in radius r graph sphere around the site i. With this distance measure, G becomes a discrete metric space. If G is a one-dimensional line, and r = 1, then SG r ðiÞ ¼ fi 1,i, i þ 1g ; i.e., it is equal to the conventional three site local neighborhood of elementary CA. We now formally extend a conventional CA’s dynamic arena – limited to the values sti f0,1, . . . , k 1g , i = 1,. . .,N – to one that includes the components of theunderlying lattice’s adjacency matrix:

stþ1 ‘tþ1

¼ F s ½fst g, f‘t g , ¼ F ‘ ½fst g, f‘t g

(4)

where Fs and F‘ are some functions (to be deﬁned explicitly below) that explicitly couple the changing value states and geometries. The complete system at time t is speciﬁed by the state-vector n o jGit ¼ st1 , . . . , stN ; ‘tij :

(5)

The time-evolution of |Gi proceeds according to the following transition rules: (i) s-rules of the general form given above and familiar from CA simulations and (ii) ‘-rules, which are divided into site couplers, linking previously unconnected vertices and site decouplers, which disconnect linked points. Because the topology can be altered only by either a deletion of existing links or an addition of links between pairs of vertices ‘i’ and ‘j’ with Dij = 2, the dynamics is strictly local. To be more precise, we ﬁrst restrict the general s-rule F1 to (maximally symmetric) totalistic (T) and outer-totalistic (OT) type. Since the underlying

Structurally Dynamic Cellular Automata

33

lattice is a fully dynamic object, |Gi will, in general, tend towards having a complex local geometry with an unspeciﬁed local directionality. The most general rules which can therefore be applied are those which are completely invariant under all rotation and reﬂection symmetry transformations on local neighborhoods. T(OT) s-rules are then speciﬁed by listing particular sums{a}(outer-sums{a0},{a1} corresponding to center site values ‘0’ and ‘1’ respectively) for which the value of the center sitebecomes ‘1’. Formally, ! X t t t tþ1 si ¼ ffag ‘ij sj , si , (6) j

where ffag ðx,aÞ P $T a dðx þ a,aÞ P P ¼ a a1 dðx,a1 Þ þ ð1 aÞ a0 dðx, a0 Þ $ OT, (7) P and d(x, y) is the Kronecker delta. Note that j ‘tij stj sums the values of all sites ‘j’ linked to ‘i’ at time ‘t’. The action on the state |Gi is represented by b i jsi f t fag X

t t t t t ‘ ¼ s1 ,...,stþ1 ¼ f s ,s a f g ij j i ,...,sN , i (8)

b i acting on the where we distinguish the operator f global value state from the actual local transition function f which transforms each site value. Link Rules Local geometry altering rules are constructed by direct analogy: for any two selected sites i and j we restrict attention to site values of vertices contained within a 1-sphere of either site; that is, to all k S1(i, j) = S1(i) [ S1(j). Link operators, whose action on the state is represented by: E E b ij ‘t ¼ ‘t ,...,‘tþ1 ¼ cij ,...,‘t decouplers : c 11 ij NN fbg ij

E E t ij b feijg ‘tij ¼ ‘t11 ,...,‘tþ1 couplers : o ¼ o ,...,‘ ij NN , (9) either link or unlink two sites ‘i’ and ‘j’ depending on whether the actual sum of values in S1(i, j) matches any of those given in the {b} or {e} lists, which completely deﬁne decouplers and couplers, respectively. In order to construct classes of rules analogous to the two types of s-rules deﬁned above, we partition the local neighborhood into 3 disjoint sets (see Fig. 1): S1(i, j) = Vij [ Aij [ Bij, where 8 < _ij ¼ fi,jg, Aij ¼ fkjk C 1 ðiÞ\C 1 ðjÞg,where C 1 ðiÞ ¼ S 1 ðiÞ fig, : Bij ¼ S 1 ðiÞ[S 1 ðjÞ_ij Aij :

(10)

Structurally Dynamic Cellular Automata, Fig. 1 Neighborhood partitioning. In the same way as outer sites can be considered separately for s-transitions, we may, for topology transitions, distinguish between those sites belonging to both i and j( Aij) and those

belonging to one of the two sites but not both ( Bij). In this way we obtain the analogous totalistic (T), outertotalistic (OT), and an additional type called restricted totalistic (RT)

34

Structurally Dynamic Cellular Automata

The action of link operators is then conveniently expressed as a function of the sums within the individual partitions. Deﬁning nij = si + sj, aij P P ¼ k Aij sk , and bij ¼ k Bij sk , we get decouplers, cijfbg ¼ cijfbg nij , aij , bij , where cijfbg ðx,y,zÞ

P 8 1 k dðx þ y þ z,bk Þ ‘ij > > o > : 1 P d x, b ‘ij 1,k d y, b2,k d z, b3,k k

$T $ OT $ RT,

(11) and couplers, oijfeg

• RT rules are completely speciﬁed by giving the ‘k’ 3-tuples of values (xsi + sj, y = sum in A, z = sum in B), for which the link operation between ‘i’ and ‘j’ is to be performed. For example, deﬁne ‘c’ by unlinking ‘i’ and ‘j’ for the following values of partitioned sums: (0, 0, 1), (0, 0, 2), (0, 1, 1), (1, 1, 1); we then have that (b1,1 = 0, b2,1 = 0, b3,1 = 1), (b1,2 = 0, b2,2 = 0, b3,2 = 2), (b1,3 = 0, b2,3 = 1, b3,3 = 1), and (b1,4 = 0, b2,4 = 1, b3,4 = 1).

¼ oijfeg nij , aij , bij , where

oijfeg ðx,y,zÞ

8 P $T < dDij ,2 Pk dðx þ y þ z, ek Þ ¼ dDij ,2 Pk dx, e1,k dy þ z, e2,k $ OT : $ RT: d Dij ,2 k d x, e1,k d y, e2,k d z, e3,k

(12) In the above expressions, RT stands for restricted totalistic rules which maximally subdivide the local neighborhood. The inclusion of an ‘ij in the expressions for c assures that only those sites already linked can be decoupled and the d(Dij, 2) in the equations deﬁning o are put in to make sure that only sites separated by distance = 2 may be dynamically coupled. The three type-speciﬁc sums appearing above are indexed with the following conventions: • T rules are deﬁned by the ‘k’ overall sums of values in S1(i, j) for which the particular action is to be taken. For example, deﬁne ‘c’ by unlinking ‘i’ and ‘j’ if the total sum =1 (=b1), 3 (=b2) or 5 (=b3). Equation (11) then ¼ 0 if and only if ‘nij ¼ 1 and states that ‘nþ1 ij nnij þ anij þ bnij f1,3,5g. • OT rules are speciﬁed by giving ‘k’ 2-tuples (b1,k, b2,k), and (e1,k, e2,k), where {1, k} labels the sum ‘si + sj’ and {2, k} labels the P corresponding outer sum¼ s S 1 ði,jÞfi,jg ss . For example, link ‘i’ and ‘j’ if si + sj = 0 and outer sum = {3, 4}, so that ‘o’ is deﬁned by listing the two 2-tuples (e1,10, e2,1 = 3) and (e1,2 = 0, e2,2 = 4).

Global transition operators are obtained by applying individual s- and ‘- operators to all sites and site-pairs in the graph G: 8 i Q > < Fbfag jsi ¼ i fbfag jsi, Q cfbg j‘i ¼ bi C nij cfbg j‘i, > Q :c O feg j‘i ¼ nnij obfei g j‘i,

(13)

cneed to be taken cand O where the products for C only over nearest and next nearest pairs respectively. Given the full value-topology transition rule G, deﬁned by cF c jGi ¼ G jGi , jGtþ1 i ¼ Ob C t t

(14)

the fundamental problem is to understand the generic behavior of accessible graphs-G emerging from all possible initial structures and value conﬁgurations. We emphasize that the lattice fully participates in the dynamics and that, in general, no embedding is implied – it is the abstract connectivity itself whose evolution we are attempting to trace.

An Example The application of the rather cumbersome expressions deﬁning transition rules is in practice extremely straightforward, as we demonstrate with the following example: Consider a graph G deﬁned as a (5 5) lattice with some distribution of values s = 1 at time ‘t = 1’ (see Fig. 2). We are interested in one global update of the system G jGit¼1 ! jGit¼2 with rules speciﬁed by

Structurally Dynamic Cellular Automata

35

Structurally Dynamic Cellular Automata, Fig. 2 Sample dynamic update of a (5 5) lattice from t = 1 to t = 2, obeying a T-type s-rule with s ! s0 for local sums =1,3,5 (i.e. a {1, 3, 5}), and OT-type ‘-rules: (i) link for {e1,1 = 1, e2,1 = 3} and (ii) unlink for {b1,1 = 1, b2,1 = 3} and {b1,2 = 1, b2,2 = 4}. Solid sites indicate that s = 1

8 Ffag : fagT ¼ fa8 1¼ > 1,a2 ¼ 3,a3 ¼ 5g, 9 > > > < b1,1 ¼ 1,b2,1 ¼ 3 = < , ðtopologyÞ Cfbg : fbgOT ¼ : b ¼ 1,b ¼ 4 ; > > 1,2 2,2 > > : Ofeg : fegOT ¼ e1,1 ¼ 1,e2,1 ¼ 3 : ðvalueÞ

t¼1 t¼1 t¼1 ¼ c st¼1 þ st¼1 ‘t¼2 ch c h , sb þ sd þ sg t¼1 t¼1 þst¼1 ‘ch i ; þsm ¼ cð1,3Þð1Þ ¼ 0: (17)

(15) We evolve the system by systematically sweeping through all sites, linked pairs, and next-nearest neighbors: 1. All Sites: . . . setting si = 1 only at those ‘i’ for which the sum of the values at ‘i’ and its neighbors is equal to ‘2’ at t = 1. By “neighbors” of any point ‘i’ we will always mean the set of vertices linked to ‘i’: (a, b), (h, m) and (x, y), for example, are all neighbors at t = 1. Writing out a few value-changing terms explicitly, we ﬁnd that

3. All next-nearest neighbors ‘i’ and ‘j’: . . . linking them only if the 2-tuple (a, b) = {(1, 3)}. By “next-nearest neighbor” we mean those pairs which are themselves unlinked but which share at least one other linked neighbor: (a, g), (h, r) and (w, y), for example, are all next-nearest neighbors at t = 1. For ‘c’ and ‘g’ we ﬁnd t¼1 t¼1 t¼1 t¼1 ‘t¼2 þ st¼1 cg ¼ o sc g , sb þ sd þ sf t¼1 d Dcg ,2 þ st¼1 h þ sl ¼ oð1,3Þð1Þ ¼ 1: (18)

st¼2 c

t¼1 t¼1 ¼ f st¼1 þ st¼1 b þ sc d þ sh

st¼2 b

¼ fð3Þ ¼ 1, and t¼1 t¼1 t¼1 ¼ f st¼1 þ s þ s þ s a b c g

(16)

¼ fð2Þ ¼ 0: 2. All linked pairs of sites ‘i’ and ‘j’: . . . removing those links only if the 2-tuple (a, b) {(1, 3), (1, 4), where a = si + sj and ‘b’ is the sum of values of the neighbors of ‘i’ and ‘j’ at t = 1. For the points ‘c’ and ‘h’, for example, we have (a, b) = (1, 3), so that the link ‘ch is no longer present in |Git = 2:

t¼2 Notice that although ‘t¼1 dn ¼ 0 ! ‘dn ¼ 1, it is hidden by overlap with the remaining links ‘t¼2 di ¼ 1 and ‘t¼2 in ¼ 1 . For this reason, not all link changes can always be observed directly in the following ﬁgures. Other sites and links are updated in precisely the same manner. Had the link-rules been of T-type, only one sum would have to be considered: the sum of the values of the points in question along with their neighbors’ values. Had they been, instead, of RT-type, three sums would have to be considered: the sum of the values of the sites in question, the sum of the values of their common neighbors (neighborhood A in Fig. 1) and the sum

36

Structurally Dynamic Cellular Automata

of the values of the points that are neighbors of one of the considered points, but not of the other (neighborhood B in Fig. 1). The ﬁnal state |Git = 2 emerges after the above process has been applied concurrently to all pairs, neighbors and nextnearest neighbors in |Git = 1. Comments We conclude this section by making a few important general comments: Comment 1. As deﬁned above, G consists of three operators acting simultaneously on the state |Gi. More generally, one may prescribe any of 10 possible time-orderings to the operators O,C and F. That is, specify certain intermediate state dependencies, so that, for example G1|Gi (OC)(F|Gi) would in general be expected to yield results different from, say, G2|Gi O(F(C|Gi)). While we will be solely concerned with the synchronous time ordering deﬁned above, we do not expect the qualitative results to depend critically on this choice. Comment 2. A given rule G is completely deﬁned by the set of sums {a},{b} and {e}. Alternatively, we can conveniently summarize a chosen transition rule by its vector-code !

C ¼ ðc½f, c½c, c½oÞa,b , where (P c½f ¼

P

a2

a

P

2a0 þ a1 2ð2a1 þ1Þ a0 2 8P bk > > k2 >

> > P 3ðb þab Þþb : 2,k 3,k 1,k k2 P 8 ek > k2 >

> : P 3ðe2,k þbe3,k Þþe1,k k2

$T $ OT $T $ OT $ RT $T $ OT $ RT (19)

where a = max {b2,k} + 1, b = max {e2,k} + 1, and must be speciﬁed only for RT-type topology rules. The G appearing in the above example, therefore, can be summarized by

c[f] = 42, c[c] = 23(3)+1 = 1024 and c[o] = 23(4)+1 + 23(3)+1 = 9216. Note that ‘c’ and ‘O’ are chosen always to be of the same type. Comment 3. Computer simulations of these systems require that some measures be taken to prevent possible memory overﬂows, such as would happen in cases either of pure coupling, where links are continually added and none deleted, or in isolated regions of a graph where for a few sites more neighbors are added than are allowed by memory. We thus introduce working link transition rules ij c~

o~ij

0

0

cij 1

$ d i or d j > d d min $ else,

oij 0

$ d i or d j < D d max $ else,

0

(20)

0

(21)

where di = degree(i) (i.e. number of neighbors of i). In words: make a sweep of the lattice, temporarily storing the candidates to add and delete for each point. If, for any point i, the updated degree is greater than d then proceed with deleting the stored deletion-candidates, otherwise do not delete; similarly, provided that the updated degree is less than D proceed with addition. Thus, it is sufﬁcient that one of two points allow a dynamic link change between them for that change to be enacted. In the following, the complete constrained !½d,D dynamics will be quoted as C ða,bÞ . If constraints play no role in the actual evolution of speciﬁc examples, they will be left out of the deﬁnition. Comment 4. Because each dynamic update involves three separate types of processing, the number of possible rules is extraordinarily large (see Table 1). Unlike pure s-transitions, however, the fraction of the total number which yield interesting behavior (i.e. neither immediately explosive, where the number of links increases without bound, nor immediately degenerative, where an initial graph rapidly dwindles to a few isolated links) appears to be manageably smaller.

Structurally Dynamic Cellular Automata

37

Structurally Dynamic Cellular Automata, Table 1 Numbers of possible rules for each of the three types of transition rules. d= maximum allowable degree and a= maximum sum to be used from partition Aij. Example: for d = 5, we have Nf = 4096, Nc = 224 2 107 and No = 221 2 106. We thus have NT = NfNcNo 1017 possible type OT Gs Rule type T OT RT

f 2d+1 22d+2 –

c 22d 26(d1) 23(a+1)(2d1)

o 22d1 23(2d3) 23(a+1)(2d+1)

Comment 5. Although it is the intrinsic geometrical patterning whose generic behavioral properties we are trying to deduce, one may approach SDCA from an alternative point of view: maintain the emphasis on unraveling the value conﬁgurational behavior, and interpret the presence of [C, O] as background operators inducing nonlocal spatial connectivities. Whereas the systems deﬁned above are completely abstract entities, in that locality is strictly deﬁned by the link structure, the alternative scheme would be to embed the discrete networks in some speciﬁed manifold, and to study the effects of dynamically allocated nonlocal communication channels.

Emerging Patterns and Behaviors Consider patterns that emerge from simple value seeds starting from ordered two dimensional Euclidean lattices. A single non-zero site may represent a small local disturbance that then propagates outward, restructuring the lattice. With appropriately chosen Gs one can induce a rich spectrum of different time evolutions only slightly perturbed by very few concurrent link changes to ones in which the initial geometry becomes radically altered. (The graphical representation of evolving one dimensional systems, in which link additions must be shown as arcs to avoid overlap with existing links, is needlessly confusing and is not considered.) Figure 3 shows the ﬁrst ﬁve iterations of a system starting from a four neighbor lattice with a single non-zero site at its center, the link structure is given explicitly and the solid circles

represent sites with s = 1. Notice how the link additions follow the emerging corrugated boundary surface of the value conﬁguration. Remember that link additions are more than passive markers indicating particular correlations between local value conﬁgurations and structure; their presence directly inﬂuences all subsequent value development in their immediate vicinity. Figure 4 (in which site values are suppressed for clarity) shows the continued development of this system. Though boundary effects begin to appear by t = 25, thecharacteristic manner in which this particular G restructures the initial graph is clear: • There is a high degree of geometrical organization (the symmetry of the initial state is trivially preserved by the totally symmetric G). • The lattice remains connected. • The distribution of link changes made throughout the lattice remains fairly uniform i.e. there is an approximate uniformity in the probability of appearance of particular local value states which induce a structural change. • Link-lengths do not get arbitrarily large.

The last point implies that for a system embedded in the plane, communication channels remain approximately local. The global pattern emerges as a consequence of local ordering. On the other hand, Gs for which link-lengths get arbitrarily large are also easy to ﬁnd. Some other varieties of behavior are shown in Figs. 5 and 6. Figure 5a, b are representative of the class of ‘-rules that only mildly perturb the underlying lattice (and for which s states do not differ much from their conventional CA cousins). Other rules, of course, may have a stronger effect on the lattice, giving rise to associated s states bearing little or no resemblance to their conventional CA counterparts. Figure 5c shows an example of a link rule that accelerates the outward propagation of the value conﬁguration. Compare the diameter of this pattern to that in the earlier ﬁgures, both shown at equal times. The outwardly oriented links that emerge from sites along the boundary surface become conduits by which non-zero values

38

Structurally Dynamic Cellular Automata

!

Structurally Dynamic Cellular Automata, Fig. 3 First ﬁve iterations of an SDCA system starting from a 4-neighbor Euclidean lattice seeded with a single non-zero site at the center. The global transition rule G consists of T s-rule and

RT ‘-rules: C ¼ ð26,69648,32904Þ½3,3 (see text for rule deﬁnitions and code). Solid sites have s = 1

rapidly propagate. Had the underlying lattice topology been suppressed in this ﬁgure, and attention focused exclusively on the developing s state, we could have interpreted the result as showing an effective increase in information propagation speed due to non-local connectivities (see comment 5 of the previous section). Figure 5d, on the other hand, gives an example in which the link dynamics lags behind the s development. The boundary proceeds outward essentially unaffected by changes in geometry, which are themselves conﬁned to the interior parts of the lattice (at least at this early stage of this system’s development). Figure 6 shows snapshot views of a few system undergoing a slightly more complex evolution. Figure 6b, for example, shows a rule in which the outward s propagation rapidly deletes most links from the original lattice but leaves a complex (though structurally stable) geometry at the origin

of the initial disturbance. Figure 6c, on the other hand, shows a typical state of a system whose global connectivity becomes progressively more complicated. A typical evolution starting from an initial state in which all sites are randomly assigneds = 1 with probability p = 1/2 is shown in Fig. 7. Notice the rapid development of complex local connectivity patterns, the appearance of which points to a geometrical self-organization. In general, structural behaviors emerging from random s-states under typical Gs can be grouped into four basic classes (not to be confused with Wolfram’s classiﬁcation of elementary CA (Wolfram 1984)): • Class-1, in which initial graphs decay into structurally much simpler ﬁnal states: most links are destroyed, and graphs ‘tij , for sufﬁciently large t, consist essentially of a large number of small local subgraphs.

Structurally Dynamic Cellular Automata

39

Structurally Dynamic Cellular Automata, Fig. 4 Several further time frames in the structural evolution of the same system shown in the preceding ﬁgure. The values

have been suppressed for clarity. The boundaries of the original lattice do not extend beyond the region shown so that the development is strictly conﬁned to a 31 31 graph

• Class-2, whose ﬁnal states are characterized by periodic but globally connected geometries. SDCA typically arise in this class either because of a speciﬁc class-2 Fs remaining unchanged by the coupling to the lattice or class-3 Fs coupling with {C, O} in such a way as to induce a lattice structure that supports a periodic state. • Class-3, consisting of SDCA that tend to grow in size and complexity, at least as measured by two basic metrics: the average degree, hdegi (1/N) . i[|S1(i)| 1], and effective dimensionality, Deffec hNnni/hdegi, where hNnni is the average number of next-nearest neighbors. The

values of both hdegi and Deffec increase without bound for class-3 SDCA (unless an arbitrary upper constraint D is imposed on G). Because the s-density responds to the changing local neighborhood structure, it is possible that what at ﬁrst appears to be an explosive growth in fact eventually leads to a more sedate, if not static, behavior at some larger hdegi D. Fs that yield hsit constant over a range of hdegi (such as the sum modulo-2 rule; see below), when coupled with link rules that themselves become progressively less active with increasinghdegi,

40

Structurally Dynamic Cellular Automata

Structurally Dynamic Cellular Automata, Fig. 5 Snapshot views of four typical developing states starting from a single non-zero site at the center of a 4-neighbor graph. Gs are as follows: a OTc[f] = 1022 and RT coupler c[o] = 16, b = 1; bTc[f] = 22 and RT

coupler c[o] = 32, b = 2; c OT c[f] = 1022 and RT coupler c[o] = 8, b = 1; dT s- and OT ‘-rules

may induce evolutions leading to only mild changes within speciﬁc ranges of the local structural parameters. • Class-4, which is a provisional class (pending stronger evidence) that denotes a set of rules that yield open-ended s- and ‘ changes, but during which the value of Deffec remains roughly constant. Cs and Os belonging to this class effectively induce a structural equilibrium: despite the fact that large numbers of link changes continue to be made, so that the detailed structure of the evolving graph

continually changes, the average ratio of the number of next-nearest to nearest neighbors stays approximately constant over long periods of time. While there is evidence to suggest this class is real, simulations have unfortunately been run for too short a time and on graphs containing too few sites to permit making any conclusive statements regarding the veracity of this class. Nonetheless, it is tempting to speculate that, for arbitrary values of D , there exists at least one set of SDCA rules for which Deffec D (within a desired ϵ > 0) as

!

C ¼ ð682,19634061312,133120Þ½2,8

Structurally Dynamic Cellular Automata

Structurally Dynamic Cellular Automata, Fig. 6 Four more examples of states emerging from simple seeds. Figure a, b, c start from 4-neighbor graphs and d from an 8-neighbor graph ( 4-neighbor with diagonals). Gs are as !

41

!

bT s- and OT ‘-rules C ¼ ð42,589952,8192Þ½2,8; cT s- and ! ‘-rules C ¼ ð42,128,4Þ½0,10 ; dTc[f] = 682 and RT ‘-rules deﬁned explicitly by C(104),(114),(124),(103),(113),(123) and V(111),(215)

follows: aT s- and RT ‘-rules C ¼ ð42,69648,32904Þ½3,3 ;

the size of the graph N ! 1. (Pseudo class-4 behavior, of course, can always be artiﬁcially induced either by imposing severe [d, D = d] constraints, or, as must typically be done for category-3 Gs, by deliberately impeding growth with some threshold D.) Statistical Measures As evidenced by Fig. 7, it is already nontrivial to meaningfully visualize the short-time evolution of (initially) regular lattices that start with random initial value state. Visualizing the long-term dynamics of systems that start from a completely

random state is even more difﬁcult (although graph visualization algorithms may help). However, even in cases for which a direct visual inspection of the dynamics reveals little, one can always indirectly keep abreast of a given system’s properties by monitoring its core structural and behavioral measures (a more detailed account is given in Ilachinski (1988)). Site value measures include the average denP sity of sites with value s = 1, hsit ðD 1=N Þ ENi¼1 sti ; the local value correlation, C t sti stj D E ðrt Þ2 , where sti stj is averaged over all pairs

42

Structurally Dynamic Cellular Automata

Structurally Dynamic Cellular Automata, Fig. 7 Evolution of a 35 35 lattice, with randomly seeded sites. The development proceeds according to T s-

constraints are [d = 0, D = 10]. The appearance of localized substructures is evidence of a geometrical self-organization

!

and OT ‘-rules deﬁned by code C ¼ ð84,36864,2048Þ. The

i and j with ‘ij = 1; the fraction of sites whose value changes during one step of the evolution, Dt P t ð1=N Þ Ni¼1 st1 s 2 i ; where 2 is a sum i modulo-2. Geometry measures include the average degree, hdegi; the average number of next-nearest neighbors, hNnnit (1/N)i[|S2(i)| |S1(i)| 1]; and Deffec. A measure of how the actual size of local neighborhoods changes with time may be obtained by embedding graphs into the twodimensional plane and calculating the average path length at time t. Of course, global features

that describe all complex networks – such as connectivity, density, clustering, and path lengths (2,6), are applicable to SDCA as well. Link changes may be monitored by keeping track of (1) the total number of link changes (allowed under prescribednconstraintoconditions), P P ðl Þ Dt ð1=2Þ Ni¼1 Nj¼1 l tij 2 l t1 ; (2) the ij ðl Þ

ðl Þ

ðl Þ

constraint inﬂuence, f l Dt =N t , where N t is the total number of link changes that would have occurred in the absence of constraints (fl = 1 indicates that the evolution is pure, meaning it is unaffected by constraints; flsmall

Structurally Dynamic Cellular Automata

43

Structurally Dynamic Cellular Automata, Fig. 8 Time development of the effective dimensionality Deffec for each of the four categories of behavior (see text): aT type G deﬁned by !

!

C ¼ ð42,128,4Þ ; bT s- and OT ‘-rules

C ¼ ð64,9216,1024Þ

;

cT

s-

and

OT

!

C ¼ ð682,512,512Þ½0,10 ; dT s- and RT ‘-rules deﬁned ! explicitly by b fð011Þ, ð110Þ, ð121Þ, ð233Þ, ð243Þg and ! ϵ fð120Þ, ð010Þ, ð021Þ, ð224Þg

‘-rules

suggests that the imposed constraint window [d, D] has resulted in observed structures that are impure); (3) the link creation- and link deletionðl Þ ðl Þ ratios, f C N C =Dt and f D N D =Dt , where NC and ND are the numbers of link created and destroyed, respectively; (4) the activity levels, t1 t gtC N C =N t1 (where N t1 is nn and gD N D =N l l the number of links at time t 1), which give the number of dynamic alterations relative to the corresponding spaces from which the candidates

for alteration are selected; and the link evolu P(5) P n t¼0 L n o tion index, gnL 1=N t¼0 l i j l ij 2 l ij , which gives the fraction of the initial lattice remaining after n iterations. Figure 8 shows time series plots of Deffec for rules in each of the four behavioral classes deﬁned above. The initial structure in each case is 35 35 4-neighbor Euclidean lattice, so that Dt¼0 effec 2 . Figure 8a gives an example of class-1 behavior, in which a short period of initial growth is followed

44

Structurally Dynamic Cellular Automata

by a decay into mostly disconnected clusters. The ﬁnal state is characterized by hdegi < 1, and is stable. Figure 8b shows a system that starts from the same initial state as in Fig. 8a but whose G leads to a periodic geometry. Just the right number of links have been deleted to permit regions with isolated activity to emerge. Figure 8c shows class-3 behavior in which Deffec steadily increases. The apparent leveling off seen toward the end of the run is due both to a decreased overall activity level and the increasingly effect of the D = 10 constraint. The system in Fig. 8d exhibits class-4 behavior, characterized by a ongoing structural development within a relatively narrow interval of values of Deffec. Note that the structural changes here are essentially pure, and are not merely artifacts of any imposed constraints. Ilachinski (3) explores a wide range of emergent behaviors across all four classes, and examines the qualitative relationship between emergent behavior and initial s- and ‘-seeding. Phase Plots While it is of obvious interest to systematically explore every possible combination of b’s and ϵ’s that deﬁne ‘-rules, Table 1 unfortunately suggests that the resulting rule space is simply too large. Nonetheless, we can learn much even by focusing our attention on a small subset of the complete rule space, keeping F, the initial s-seeding, and all other factors constant. Speciﬁcally, consider the subset of all possible ‘-rules that consists of OT link rules consisting of a single coupler, o, L and a single decoupler, c. Moreover, let f 2 (i.e., sum modulo-2 rule), demand that only pairs of s = 0 sites be considered for a link change, and consider ‘-rules belonging to the following set: decouplers : couplers :

n

o b1,1 ¼ 0, b2,1 ¼ m , 1 m 0, ϵ 1,1 ¼ 0, ϵ 2,1 ¼ n , 1 n 0:

(22) Figure 9 summarizes the behavior of a four neighbor, 25 25 lattice with periodic boundary conditions, starting from an initial s-seed consisting of a single nonzero site. Four basic kinds of structural behaviors emerge:

1. Static state: this trivially occurs when the link rules are unable to take effect; namely, when m 7 and n 8. 2. Rapid growth: for an entire range of m and n, the average number of neighbors for each site of the lattice increases rapidly for 20–30 iterations. This number would likely continue to increase, were it not for the constraint conditions ( [0, 10]). The “ﬁnal state” is neither stable nor periodic. One sometimes also sees delayed growth in this class of behavior, in which case the link structure is initially relatively quiescent (and the behavior of the system as a whole mimics that of a conventional CA). As coupler rules are triggered by speciﬁc s states, the average degree of the lattice rapidly increases (at least until the constraint conditions take effect). 3. Spontaneous decay: when decouplers are stronger than couplers, the average degree typically decreases. If this occurs too rapidly, the structure surrounding the single nonzero valued site may become isolated from other parts of the lattice. If a few non-zero values do not leak out into the outlying regions, link changes remain conﬁned to the central subgraph, leading to either rapid stability or periodicity. 4. Initial growth, followed by periodicity: this is the least common behavior, and requires a delicate balance between coupler and decoupler rules. It is interesting to compare these results with those obtained from a random s seed. In this case, the sharp divisions between characteristic behaviors disappear, and there is a pronounced increase in the number of links for all m and n. However, the inclusion of an additional decoupler, may induce decay and periodicity. For example, consider the same initial lattice and F as used in Fig. 9, ﬁx two OT ‘-rules C(0, 5) and O(0, 1), and add the decoupler C(0, m) : {b1,1 = 0, b2,1 = m}, 1 m 9. Surveying the emergent behaviors for this range of m’s, one now ﬁnds decaying lattices for m 2. In each case, the initial graph succumbs to periodicity following a transient of between 50 and 100 iterations. The evolving lattice is

Structurally Dynamic Cellular Automata

45

Structurally Dynamic Cellular Automata, Figure 9 Phase plot that summarizes behavior of a four neighbor, 25 25 lattice with periodic boundary conditions, starting from an initial s-seed consisting of a single nonzero site. G is deﬁned by the sum modulo-2 s-rule and ‘-rules of the form: decouplers–{b1,1 = 0, b2,1 = m},

couplers–{ϵ 1,1 = 0, ϵ 2,1 = n}. Grey areas in both plots denote periodic states. White areas denote growth in the plot for link behavior, and a nonperiodic state for s-behavior. The black area that appears in the linkbevavior plot denotes decay. Numbers that appear in individual boxes denote period lengths

also more prone to break up into small disconnected subgraphs. Although, just as in conventional CA, small changes to ‘-rules can lead to large differences in emergent behavior, they generally appear to do so in a more predictable and patterned manner. Of course, particular classes of G may induce more complex phase plots; for example, isolated pockets of anomalous (and rapidly shifting) behavior may appear within larger surrounding regions undergoing otherwise mutually consistent and slowly changing dynamics. A better sense of the space of possible emergent behaviors, along with a deeper understanding of the relationship between F and ‘-rules, awaits a future study.

for describing physical processes (which is the primary reason for which SDCA0 were ﬁrst conceived). Motivated primarily by ﬁnding models of human brain function (for which one intuitively expects nonlocal neural connections to play a fundamental role in the rewiring of neural tissue), Majercik shows that suitably generalized SDCA are not only capable of universal computation, but actually represent a more efﬁcient class of computational models than conventional CA. Majercik also reports an SDCA that can solve the ﬁring squad problem in O(logt) time (i.e., exponentially faster than the O(t) in conventional CA),and a class of CA-universal SDCA models that can simulate any conventional CA with a speedup factor of two. (The ﬁring squad problem (Moore 1962) consists of ﬁnding a rule for which allsites in a CA evolve into a special state after the exactly the same number of steps.) Majercik proceeds by ﬁrst identifying ﬁve properties of SDCA0 that, while reasonable from a physical modeling standpoint, make it difﬁcult to rigorously formulate and prove theorems:

SDCA as Models of Computation The basic SDCA model, as outlined above (which we will denote as SDCA0 to avoid possible confusion with the hierarchy of related SDCA models introduced in this section), was modiﬁed and generalized by Majercik (1994) into a form more suitable for addressing its formal computational capabilities rather than as an exploratory toolkit

1. Finiteness: The requirement that SDCA0 be strictly ﬁnite, both in time and space, is obviously

46

2.

3.

4.

5.

Structurally Dynamic Cellular Automata

necessary for computer experiments, but is unnecessarily restrictive for general theorem proving. Likewise, the assumption that the sets a, b and ϵ must be ﬁnite is questioned. Bidirectionality: While SDCA0 are deﬁned with symmetric links, an obvious generalization that makes the basic model more readily applicable to neural dynamics (among other kinds of physical and biological systems) is to allow for unidirectional links. Link-rule Asymmetry: While SDCA0’s link decoupler function (Eq. (11)) contains the factor ‘ij to explicitly prevent the system from inadvertently linking two unlinked sites, SDCA0 does not include an analogous term for the coupler function (that is, a term to prevent an evolving system from inadvertently unlinking two linked sites). Inconsistency: While s-rules effectively ignore site positions, all three types of link rules assume that the various neighborhoods surroundings individual sites (Aij, Bij, and Cij {k| Dik = 1 Djk = 1}, where ‘ ’ denotes exclusive or) are all recognized as such by the dynamics. That is, the link rules effectively “ know” the positions of a site’s neighbors, while s-rules possess no such information. Small Rule Set: The class of s- and ‘-rules used by SDCA0 may be generalized to include a far broader class of transition functions.

On the basis of these observations, Majercik (1994) introduces a set of three core models todeﬁne a hierarchy of eight alternative SDCA computational systems, {SDCA(1), SDCA(2), . . ., SDCA(8)}. The three core models are (1) the relative location model (=MR), (2) the labeled links model (=ML), and (3) the symmetric links model (=MS). They differ only in the degree to which their s- and ‘-transition functions depend on speciﬁc sites. For example, MR’s transition functions depend on the state and exact relative position of each neighbor (and therefore “knows” the exact source of any state in a local neighborhood). In ML, links are labeled and the transition functions know both neighbor states and the label of the links to given neighbors, but the exact neighbor

locations remain unspeciﬁed. Finally, in MS, it is assumed that no information about the source of the neighborhood states exists, and transition functions only know the number of neighbors in a particular state. Each of the three core models may be deﬁned in two versions: an unbounded links (abbreviated, UL) version, in which the number of neighbors a given site can have is unbounded, and a bounded links (abbreviated, BL) version, in which an explicit upper limit is imposed. In addition, there is also one ﬁnite labels version of ML. Majercik imposes certain mild conditions on the local transition functions; for example, that local neighborhoods always remain strictly ﬁnite, s-rules leave quiescent neighborhoods alone, and that links between sites with quiescent neighborhood remain unaltered. Relative Location SDCA Model In the Relative Location model, the transition functions all have access to the exact relative location and state of each neighbor site. Deﬁne a neighbor of site i, ni S Zd, as a pair that speciﬁes the state (by a single label) and relative location of the neighboring site (as a d-tuple of coordinates). Let W = S Zd be the set of all possible neighbors, and F W (called the neighborhood function) be the set of all possible ﬁnite, nonempty, partial functions that map Zd to W. The local state transition function s : F ! W maps neighborhood functions to the state set of SDCA. The local link transition function l : F F {0, 1, 2} ! {0, 1} maps pairs of neighborhood functions (that deﬁne the neighborhoods of two sites, i and j and a number that speciﬁes the status of the link between i and j: value zero meaning that i and j are neither direct neighbors nor next-nearest neighbors; value one meaning that i and j are immediate neighbors; and value two meaning i and j are next-nearest neighbors) to one of two link states: zero, meaning no link between i and j, and one, meaning a link exists. Labeled Links SDCA model The Labeled Links model removes from MR’s transition functions any dependency on the exact relative location of a site’s neighbors, but allows

Structurally Dynamic Cellular Automata

the links to still be labeled so that the transitions functions can distinguish one link from another. This ability to “label” links paves the way for us to deﬁne SDCA with unidirectional links, since the labels can be used to distinguish between the input and output links to a site. Consider, for example, the UL-version of ML. Labeling the links by natural numbers, N , we deﬁne a neighbor of site i, as a pair (q, n), where q S labels the state of the neighboring site, and n N labels the link between i and its neighbor. Site i is deﬁned as the direct neighbor linked via the 0th link, and the set of all possible neighbors, W ¼ S N . As for MR, F W is the set of neighborhood functions that map Zd to W, the local state transition function s : F ! S maps neighborhood functions to states in S, and the local link transition function l : F F {0, 1, 2} ! {0, 1} maps pairs of neighborhood functions and a number to either the values zero (unlinked) or one (linked).

Symmetric Links SDCA Model The Symmetric Links model imposes the strictest constraint of all by doing away with all means by which the local transition functions may distinguish different neighborhood orientations. Consider the unbounded link version of MS. Assume the SDCA has a total of n states, and let ! S = {1, 2, . . ., n}. Let n i N n be an n-dimensional vector such that (ni)k is equal to the number of site i’s neighbors in state k. Then the local state transition function s : Nn ! S maps vectors in Nn to states in S, and the local link transition function l : Nn {0, 1, 2} ! {0, 1} maps a vector in Nn and a link status label to either the values zero (unlinked) or one (linked). MS can also be modiﬁed slightly to allow the local transition functions to retain knowledge of the state of site i: simply let s : S Nn ! S map the pair consisting of the state of site i and a vector that deﬁnes the distribution of states among i’s immediate neighbors (excluding i). The local link function likewise assumes a similar form l : S2 Nn {0, 1, 2} ! {0, 1}, where the ﬁrst component of the 3-tuple input to lambda is a pair that deﬁnes the states of the two sites to which the link function is being applied.

47

SDCA as CA Simulators What does it mean to say that one dynamical system simulates another? Heuristically, it means that, for certain initial states, one system behaves just like another (Ilachinski 2001; Wolfram 1984). Suppose we have two CA systems – CA and CA' – deﬁned by rules f and f0, and initial states ! s S 0 ! and s S, respectively. Then, loosely speaking, T iterations of CA are said to be “simulated” by nT (n 1) iterations of CA', provided there exists 0 some invertible function, f : S ! S, by which ! s ! is replaced by f s . Simulation is a transitive relationship: if system B simulates system A, and another system C simulates B, then C also simulates A. For example, a single site with a particular value in CA may be simulated by a ﬁxed block of sites in CA0. After n steps, the blocks in CA0 evolve to exactly the same ﬁnal state as the single time-step evolution of individual sites in CA. As a concrete example, consider the elementary (one-dimensional, binary valued, conventional CA) rules f18 and f90: 111 # f18: 0 f90: 0

110 # 0 1

101 # 0 0

100 # 1 1

011 # 0 1

010 # 0 0

001 # 1 1

000 # 0 0

Provided that two time steps under f18 are carried out for every time step of rule f90, it is easy to show that under the block transforms 0 ! f(0) = 00 and 1 ! f(1) = 10, the evolution of arbitrary starting conﬁgurations under f90 is reproduced – or simulated – by f18. For example, ! the global state ! s ¼ f ‘0011000’ – which evolves into f90 s ¼ f ‘0111100’ under f90 – yields the same state (after it is block-transformed) that results from two iterations of f18 applied to f90’s block-transformed initial state, f ! s ¼ ‘00001010000000’: s ¼ 00101010100000 f18 f18 f ! ¼ f f90 ! s :

(23)

Now consider the speciﬁc case of SDCA simulating a conventional CA (we follow Majercik (1994)). First, because SDCA cannot be expected

48

Structurally Dynamic Cellular Automata

to preserve the local topology of a simulated CA, it is necessary to deﬁne separate encoding (=e) and decoding (=d) functions – e : SCA ! SSDCA transforms the initial conﬁguration of the CA systems to conﬁgurations in the SDCA system being used to simulate it (where SCA and SSDCA are the conﬁgurations spaces of CA and SDCA, respectively); and d : SSDCA ! SCA effectively performs the inverse transformation. Encoding (and decoding) functions are called structurally deﬁned if they are recursive and use a ﬁnite amount of information to encode (or decode) a given conﬁguration; and are otherwise expected to transform quiescent states to quiescent states. Majercik further assumes that (1) e has access to the rule table of the conventional CA system being simulated; (2) d does not have access to the rule tables of either system; and (3) e and d must together satisfy the relation: e d = Identity(SCA). Denoting the global transition functions of the CA and SDCA systems by FCA and FSDCA, respectively, FSDCA is said to simulateFCA if there exist m 1,n 1 and structurally-deﬁned functions e : SCA ! SSDCA and d : SSDCA ! SCA, such that for any conﬁguration ! s SCA and any k 1, ! km ! Fkn : CA s ¼ d FSDCA e s

(24)

If m > n then FSDCA simulates FCA with a slowdown factor of m/n. If m < n then FSDCA simulates FCA with a speedup factor of n/m. SDCA Hierarchy of Models Majercik (1994) uses the three generalized models introduced above (MR,ML, and MR) to deﬁne a hierarchy of eight SDCA models of computation. At the top of his hierarchy (arranged from top-tobottom in roughly, but not completely, decreasing order of computational strength; see discussion that follows) are the UL and BL versions of MR: SDCA(8) and SDCA(7), respectively; followed by SDCA(6) = UL version of ML; SDCA(5) = BL version of ML; SDCA(4)= a ﬁnite labels version of ML; SDCA(3) = UL version of MS; SDCA(2) = BL version of MS; and, sitting on the lowest level (computationally speaking), is SDCA(1)= SDCA0. A little thought sufﬁces to establish certain relationships among the various classes. Give two

classes, C1 and C2, let C1sC2 denote the fact that if, given any SDCA S1 C1 there exists an SDCA S2 C2 that simulates S1. Then, for example, since any BL SDCA can be simulated by an unbounded links version of the same system, and a ﬁnite links version of ML can be simulated by a bounded links version, we know immediately that SDCA(7)s SDCA(8), SDCA(4) s SDCA(5) s SDCA(6), and SDCA(2) s SDCA(3). Similar reasoning (Majercik 1994) leads to the general relationship:

SDCAð3Þ s SDCAð8Þ s SDCAð6Þ ,and SDCAð2Þ s SDCAð7Þ s SDCAð5Þ :

(25)

Finally, since the unbounded links version of MR has all the information necessary to construct the neighborhood partitions used by SDCA0, and since SDCA(8) s SDCA(6), we see that SDCA0 s SDCA(6) and SDCA0 s SDCA(8). Majercik’s two main results, which we state without proof, are: Majercik Theorem 1: Given an arbitrary 1-dimensional conventional CA with radius r = 1, there exists an unbounded links version of MR (=SDCA(8) of the SDCA hierarchy) that can simulate it with a speedup factor of two. Majercik Theorem 2: There exists a 1-dimensional ﬁnite links version of ML (=SDCA(4)) that can simulate an arbitrary k-state 1-dimensional conventional CA with radius r = 1 with a pﬃﬃﬃﬃﬃﬃﬃﬃﬃﬃﬃﬃﬃ slowdown factor O k 2r 2rlogk . Detailed proofs of these two theorems appear in Majercik (1994) (where they are called Theorems 4.4 and 4.5, respectively). In Chap. 5 of his thesis (Majercik 1994), Majercik presents an explicit construction of a CA-universal SDCA(4) computational model, and compares it to Albert and Culik’s (1987) construction of a 1-dimensional CA-universal conventional CA that simulates any 1-dimensional, k-state, radius r CA with an O(k8r) slowdown. Although Majercik’s CA-universal SDCA uses more states than Albert and Culik’s universal CA, it is also markedly faster. The reason why the SDCA is faster is at least intuitively clear. An SDCA’s dynamic links

Structurally Dynamic Cellular Automata

effectively endow an otherwise conventional CA with a random access memory. Since SDCA can establish links between any two sites a distance d apart in O(logd) time, any site potentially has access to the state of any other site. While it may be argued that sites in conventional CA can also access the states of other cells, they cannot do so permanently. Once information is accessed once and used, the connection is lost, and must subsequently be re-established. Moreover, the links in SDCA can potentially connect sites that are arbitrarily far apart; so that, once a small number of links are dynamically created, they continue to provide long-range communication channels throughout the network. Since the propagation of information in a conventional CA is necessarily limited in being able to ﬂow one site at a time, the overall computational speed is obviously limited. However, it is worth pointing out that while the computational strength of Majercik’s CA-universal SDCA model undoubtedly derives from its ability to forge long-range communication links, the results as quoted from Majercik (1994) do not tap into what is potentially SDCA’s greatest strength; namely, the ability to adaptively create links, even as a given computation unfolds. In Majercik’s model, the links are dynamically coupled to an actual computation only insofar as they are initially ﬁxed as a function of the initial state. While the local structure certainly evolves (as it does in all SDCA systems, as the computation itself unfolds), it does so purely as a consequence of the SDCA rules, and not adaptively to the evolution. Majercik concludes his thesis by speculating on how an adaptive variant of his CA-universal SDCA may be used to explore certain aspects of evolutionary learning. (Working from a different set of assumptions, Halpern (1996, 2003) applies evolutionary programming techniques to SDCA0 to explore what happens when the structure is allowed to play an explicit dynamic role in the computation; see next section.) The question of whether there exist SDCA-universal SDCA models – that are able to simulate certain classes of the SDCA hierarchy, for example – remains open.

49

SDCA and Genetic Algorithms Genetic algorithms (abbreviated, GA) are a class of heuristic search algorithms and computational models of adaptation and evolution based on natural selection. In nature, the search for beneﬁcial adaptations to a continually changing environment (i.e., evolution) is fostered by the cumulative evolutionary knowledge that each species possesses of its forebears. This knowledge, which is encoded in the chromosomes of each member of a species, is passed on from one generation to the next by a mating process in which the chromosomes of “parents” produce “offspring” chromosomes. A comprehensive review of GA is given by Mitchell (1998). While GAs may be effectively used to search for “interesting” topological structures (but for which the structures themselves do not play any dynamic role; see, for example, Lehmann and Kaufmann (2005)), Halpern (1996) is the ﬁrst to explore a novel hybrid algorithm between GA and SDCA, in which SDCA rules are used to evolve a GA. Weinert et al. (2002) explore a related “structurally dynamic” GA model, in which links between adjacent individuals of a population are dynamically chosen according to deterministic or probabilistic rules. In this section, we follow Halpern (1996, 2003). Formally, GAs are deﬁned byn(1) o an ensemble ! ! of “candidate solution” vectors, s i : s i M P Rn , where M is the set of all possible solutions ! to a given “problem” P (the s i are usually, but not always, deﬁned as a string of binary numbers (Mitchell 1998)), and (2) a “ﬁtness function”, f ! ! s , that represents how well a given s “solves” P. The goal of the GA is to ﬁnd the global optimal ! solution, s such thatfrom thepoint of view of ! ! ! maximizing ﬁtness, f s f s f , 8 s M . Optimization proceeds through the combined processes of selection, breeding, mutation, and crossover replacement (Mitchell 1998); to which – in the hybrid SDCA $ GA algorithm, Halpern adds the new feature of self-selective neighborhood structure. It should be immediately noted that this is not an ad-hoc addition. Muhlenbein (1991) points out that if each generation of a GA searches over the entire possible solution space, the algorithm

50

may – depending on the ﬁtness function – converge prematurely to a sub-optimal solution. To reduce the likelihood of this happening, Muhlenbein introduces a spatial population structure; restricting ﬁtness and mating to neighborhoods called demes. Demes are geographically separate subpopulations in which candidate solutions evolve along disparate trajectories; though occasional mixing still occurs through the process of migration. In Halpern’s variant (1996), an otherwise conventional GA is placed within the structure of SDCA0 (i.e., the basic model deﬁned by Eqs. (11), (12), (13), and (14)). Heuristically, this allows each candidate solution to “choose a community” with which to mate, during each generation. The choice of neighborhoods thus becomes an integral component of the GA, and is determined dynamically by the evolving solutions. Halpern’s algorithm proceeds as follows (2003): (Step 1) an initially random lattice (deﬁned by adjaðt¼0Þ cency matrix l ij ) is seeded with singlechromosome candidate solutions of ﬁxed length, P one per site; (Step 2) a ﬁtness function, f i ¼ Ni¼1 dij , is deﬁned to assign a numerical measure of “optimality” to each site (N is the number of sites, and dij is the value – equal to 0 or 1 – of the jth gene of the ith chromosome; (Step 3) each site i ranks each of its nearest and next-nearest neighbors according to fi; (Step 4) each site disconnects with a fraction, fD, of its least-ﬁt neighbors, and connects with a fraction, fC, of its ﬁttest next-nearest neighbors; (Step 5) each site randomly mates with one of its nearest neighbors (i.e., the usual processes of mutation and crossover operations are applied (Mitchell 1998)); (Step 6) the least ﬁt members of the population are replaced by the offsprings from Step 5; and (Step 7) loop through steps 5–7, until some suitable “optimality” threshold (or some other convergence criterion) is satisﬁed. Halpern (1996, 2003) reports a wide range of resulting behaviors, collectively suggesting a clear relationship between the parameters deﬁning the GA optimization and lattice connectivity. Of particular interest are the dynamic conditions for which the ﬁtness-based creation and deletion of links increases the rate of growth of overall ﬁtness. The fastest convergence occurs when lattice connectivity ﬁrst increases, then decreases, then

Structurally Dynamic Cellular Automata

eventually levels off. In the ﬁrst stage, the ﬁttest possible communities are ﬁrst established; in the second stage, connections with poorer candidate solution are deleted; ﬁnally, in the third stage, the system essentially “ﬁne-tunes” its optimal solutions. Halpern (2003) ﬁnds two different evolutionary paths toward high connectivity: (1) monotonic growth over time (for low mutation rates, pm), and (2) a phase transition between low and high degrees of connectivity (for some p m ). Using SDCA$GA hybrid model parameters N = 100 and fD = fC = 0.1, p m 0:05, for which Halpern (2003) ﬁnds a sharp increase in the number of links per site between generations 350 and 450. Despite the novelty of the approach, and the promising link between optimization rates and dynamic structure established in Halpern (1996), concrete applications of the algorithm – except for Weinert et al. (2002) work on a related hybrid GA algorithm – have yet to be developed. One suggestion, from Halpern (2003), is to use the SDCA$GA hybrid model for ﬁnding “optimal” connectivity patterns in parallel computers. The search algorithm may be used to directly model how component processors are connected, and decide to keep or sever existing links, or establish new ones, adaptively as a function of local ﬁtness criteria.

Generalized SDCA Models Despite SDCA being obviously more “complex” than conventional CA (and certainly more complex to formally deﬁne, if only because one must specify both s and ‘ rules), the SDCA model nonetheless has more in common with elementary CA than with any of its brethren’s more “complicated” variants. By “elementary” CA we mean the simplest one-dimensional CA with s {0, 1} and local neighborhoods consisting only of left and right (i.e.,nearest) neighbors. Just as there are many generalizations of elementary CA – for example, increasing the state space to include s’s that take on one of N values, larger-sized neighborhoods, and memory, among many other possibilities – so too there are natural extensions of basic SDCA. In this section we discuss three generalizations: (1) rules that are reversible in

Structurally Dynamic Cellular Automata

51

time, (2) rules that retain a memory of past states, and (3) probabilistic rules. Reversible SDCA The ﬁrst generalization of the basic SDCA model, explored extensively by Alonso-Sanz (2006), is to apply the Fredkin reversible-rule construction to ‘ rules to render them reversible in time. Consider a conventionalh CA system i that is ﬁrst-order tþ1 t in time, si ¼ f sj N i , where N i is the neighborhood around site i and, generally, si Z k. The Fredkin construction converts this system into an explicitly invertible one that is secondorder in time by subtracting the value of the center site at time t 1: h i stþ1 ¼ f stj N i k st1 i i ,

(26)

where ‘k’ is subtraction modulo-k. Since Eq. (26)h can i be trivially solved for tþ1 t st1 ¼ f s N s , we see that any i k i i j pair of consecutive conﬁgurations uniquely speciﬁes the backwards trajectory of the system. Moreover, this is true for arbitrary (and, in particular, irreversible) functions f. Now, exactly the same procedure may be applied to link functions: n o 8 < l tþ1 ¼ c st , l t 2 l t1 , ij k n ij o ij : l tþ1 ¼ o st , l t 2 l t1 , ij ij ij k

(27)

where 2 is subtraction modulo-2 (since links are obviously binary valued). Following Alonso-Sanz (2006, 2007), we consider these two speciﬁc SDCA link rules (which will also be used in a later example): 8 < c sti ,stj ,l tij ¼ 0 iff l tij ¼ 1 and sti þ stj ¼ 0, : o st ,st , lt ¼ 1 iff l t ¼ 0,st > 0,st > 0,and Dij ¼ 2: i j ij i j ij

(28) Figure 10 compares the evolution of the Fredkin reversible version of these rules to their memoryless counterpart. Both evolutions start on

a two dimensional hexagonal lattice, and values evolve according to the three-state (i.e., s {0, 1, 2}), next-nearest neighborhood T beehive rule. The beehive rule is deﬁned explicitly by assigning one of three values (0, 1, or 2), to each possible 3-tuple, (N0, N1, N2), that gives the number of local sites with N0 0s, N1 1s, and N2 2s (Alonso-Sanz 2006): (0, 0, 6) ! 0, (0, 1, 5) ! 1, (0, 2, 4) ! 2, (0, 3, 3) ! 1, (0, 4, 2) ! 2, (0, 5, 1) ! 0, (0, 6, 0) ! 0, (1, 0, 5) ! 0, (1, 1, 4) ! 2, (1, 2, 3) ! 2, (1, 3, 2) ! 2, (1, 4, 1) ! 1, (1, 5, 0) ! 1, (2, 0, 4) ! 0, (2, 1, 3) ! 0, (2, 2, 2) ! 2, (2, 3, 1) ! 2, (2, 4, 0) ! 0, (3, 0, 3) ! 0, (3, 1, 2) ! 2, (3, 2, 1) ! 2, (3, 3, 0) ! 0, (4, 0, 2) ! 0, (4, 1, 1) ! 0, (4, 2, 0) ! 2, (5, 0, 1) ! 2, (5, 1, 0) ! 0, (6, 0, 0) ! 0. The top row of Fig. 10 shows the ﬁrst four steps (t = 1,2,3, and 4) in the memoryless evolution of the initial “ring” of sites that appears at t = 1. The link rules used for this run are those deﬁned in Eq. (28). Since the decoupler removes links between pairs of sites whose values are equal to zero, most of the lattice disappears after a single time step, and both value and link activity is conﬁned to a small region. After two more steps of changes, quickly n the o system n o attains a ﬁxed point: st , ‘tij ¼ st¼4 , ‘t¼4 for all t 5. ij While the frequency of states is not constrained to total six for a dynamic lattice, the beehive rule is unchanged; if the sum of frequencies at a given site exceeds six, the site value remains the same. The bottom row shows the evolution of the Fredkin reversible versions of the rules deﬁned in Eq. (28) (to simplify the visualization, links along the border sites are not shown). In contrast to the basic SDCA version, the initial lattice in this case does not decay. Since, according to Eq. (27) (which assumes that ‘t¼0 ¼ ‘t¼1 ij ij ), the initial hexagonal lattice is subtracted from the evolved structure at t = 1 (modulo-2), the original graph is effectively restored, and the outlying regions appear undisturbed. SDCA with Memory A second generalization to the basic SDCA model, introduced and studied by Alonso-Sanz

52

Structurally Dynamic Cellular Automata

Structurally Dynamic Cellular Automata, Fig. 10 Comparison between ﬁrst few time steps of a a memoryless SDCA, evolving according to link rules deﬁned in Eq. (28), and b the Fredkin reversible versions

of these rules (obtained by applying Eq. (27) to Eq. (28)). In both cases, s’s evolve according to the beehive rule deﬁned in the text. (Reproduced with permission from Alonso-Sanz (2006))

and Martín (2006) and Alonso-Sanz (2006, 2007), is to endow both s-rules and ‘-rules with memory. The rules for conventional memoryless CA and SDCA, depend only on neighborhood conﬁgurations that appear on the immediately preceding time step. Therefore, rules may be said to possess a “memory” of depth m if they depend explicitly on values (in the case of CA), or on both values and link states (in the case of SDCA), that existed on m previous time steps. We note, in passing, that since the Fredkin construction couples states at times t + 1, t and t 1, reversibility may be considered a speciﬁc form of memory that extends backwards a single step. Of course, there is no unique prescription for introducing a dependency on past values; and a variety of alternative memory mechanisms have been proposed in the literature (for example, see page 43 in Ilachinski (2001) and page 118 in Wolfram (1984)). We focus our discussion on the approach proposed by Alonso-Sanz (14), and for the moment conﬁne our attention to value rules, f : s ! s0. Alonso-Sanz’s approach is to preserve the form of the transition rule, but have it act on an effective site value that is a weighted function of its m prior values. This is done by introducing a memoryendowed value rule, fm, that – in contrast to its memoryless version, f – is not, in general, a

function of a given site’s current value, si, alone, but is instead a function of the transformed value, s ¼ Mf ðs;m,aÞ, obtained from si’s past m values: fm : s ! s0, where 0 a 1 is a numerical memory factor. The value transforming memory function, M , assumes the following speciﬁc form (to avoid confusion, note that in Eqs. (29) and (30), sxi means the value of si at timet = x, and ax means the numerical quantity a raised to the power x): 8 1 if sbit Þm > 1=2, > < sti ¼ M f sti ;m,a ¼ sti if sbit Þm ¼ 1=2, > : 0 if sbit Þm < 1=2, (29)

where

sbi

t m

P sti þ m aDt stDt i Dt¼1 Pm ¼ : 1 þ Dt¼1 aDt

(30)

At any given time, t, the depth m can never exceed t 1. Our discussion follows Alonso-Sanz (2007), and sets m(t) t 1 for all t; i.e., we assume that M f ðs;m,aÞ yields a weighted mean value of all the previous values of a given site. In practice, memory becomes active only after a certain number of initialization steps, here taken to be three; with seeded values s1i ¼ s1i and s2i ¼ s2i . Memory can be added to link rules in a similar manner. The form of the link rules (c and o)

Structurally Dynamic Cellular Automata

53

remains the same, but rather than acting on a graph that is deﬁned by its adjacency matrix, ‘tij , c and o instead act on the memory-transformed values, L ¼ Mðc,oÞ ð‘;m,aÞ: 8 > >1 < > Ltij ¼ M ðc,oÞ l tij ;m,a ¼ l tij > > > : 0

t if ^l ij > 1=2, t m if ^l ij ¼ 1=2, t m if ^l ij < 1=2, m

evolves according to the parity T s-rule (that assigns a value zero to a site if the sum of the values in its neighborhood is even, and assigns the value one if the sum is odd) and the ‘ rules deﬁned above in Eq. (28). The ﬁrst row of evolving patterns (for each a) applies memory only to values; the second applies memory only to links, and the third appliers memory to both. Figure 13 shows the reversible beehive SDCA shown in Fig. 10, but with full memory (a = 1.0).

(31)

As for memory-endowed s-rules, the memory for link rules is activated only on the third iteration step, and the system is initialized by setting L1i ¼ s1i and L2i ¼ s2i . Figures 11 and 12 show the effects of applying partial memory weighting (a = 0.6) and full memory (a = 0.6), respectively, to a SDCA that starts with a Euclidean four-neighbor lattice, and

Probabilistic SDCA Another natural extension of the basic SDCA model is to replace the set of explicit s- and/or ‘-rules with probabilities. In this way one can study the evolution of a system that undergoes random but s-dependent lattice changes. For example, this may be useful for studying genetic networks in which new links are forged (with a given probability) only if both genes are active, and existing connections are broken if both sites are inactive. Following Halpern and Caltagirone (1990), consider the parity T s-rule and the following probabilistic versions of decoupler (cp) and coupler rules (op):

Structurally Dynamic Cellular Automata, Fig. 11 Sample runs of a SDCA with memory for memory weighting a = 0.6. The SDCA is initialized as a Euclidean four-neighbor lattice, and evolves according to the parity T s-rule and the two ‘ rules deﬁned in Eq. (28).

The ﬁrst row of evolving patterns applies memory only to values; the second row applies memory only to links, and the third row shows the evolution when memory is applied to both. (Reproduced by permission from Alonso-Sanz (2007))

where P tDt Dt t l tij þ m Dt¼1 a l ij ^l P ¼ : ij Dt m 1þ m Dt¼1 a

(32)

54

Structurally Dynamic Cellular Automata

Structurally Dynamic Cellular Automata, Fig. 12 Sample runs of the same SDCA shown in Fig. 11, but with memory weighting a = 1.0. (Reproduced by permission from Alonso-Sanz (2007))

Structurally Dynamic Cellular Automata, Fig. 13 Sample runs of a reversible beehive SDCA with full memory (a = 1.0); compare to Fig. 10. (Reproduced by permission from Alonso-Sanz (2007))

8 < l tþ1 ¼ cp l tij ; sti , stj , pD , ij ðdecoupler Þ : : c 1 d st þ st ,0 dðp > rÞ, p D i j 8 t t t < l tþ1 ij ¼ op l ij ; si , sj , pD , ðcouplerÞ : : op d Dij ,2 d st þ st ,2 dðp > rÞ, C i j

(33) where PD and PC are the decoupler and coupler probabilities, respectively, and r is a random number between 0 and 1. Thus, cp unlinks two previously linked sites with probability PD if and only if the sum of their site values is zero; and op links two previously unlinked sites with probability PC if and only if they are next-nearest neighbors and the sum of their site values is two. Figure 14 shows time series plots of hsi as a function of time for three different cases: (1) PD = 0 (no decoupling at all), (2) PD = 1/2,

and (3) PD = 1 decoupler rule applied 100% of the time (consistent with non-probabilistic SDCA rules). We see that changing PD induces qualitatively different s behavior, that ranges from small ﬂuctuations around hsi 0.5 (for PD = 0), to decay to small static values (hsi = 0.05 for PD = 1/2, and hsi = 0.12 for PD = 1). Halpern and Caltagirone (1990) have studied a wide range of probabilistic SDCA, using random initial s conﬁgurations, step-function, parity, and Conway’s life s-rules, Cartesian and random initial lattice structures, and various probabilities 0 PD 1 and 0 PC 1. Some of their results are reproduced (with permission) in the behavioral phase plots shown in Fig. 15. (The step-function rule P t t is deﬁned by stþ1 ¼ 0 if and only if i j ‘ij si > 2 P t t and stþ1 ¼ 1 if and only if ‘ s 2; Conway’s i j ij i life rule assigns st + 1 = 1 to a site if and only if s(t) = 0 and the sum of values in its neighborhood at

Structurally Dynamic Cellular Automata

55

Structurally Dynamic Cellular Automata, Fig. 14 Time series of average s value, st, for the Halpern-Caltagirone rules (deﬁned in Eq. (33)) and for three values of decoupler probability: PD = 0, PD = 1/2, and PD = 1. (Reproduced with permission from Halpern and Caltagirone (1990))

time t is equal to 3 or st = 1 and the sum of values is equal to 2 or 3; otherwise st + 1 = 0.) Figure 15 shows a wide range of possible behaviors. Consider, for example, the number of links per site for the case where the lattice is updated with probabilistic ‘-rules and the s’s are all random (shown at the top left of the ﬁgure). Four distinct classes of behavior appear, with growth dominant for most values of PD and PC. Pure decoupling (or pure coupling) leads to complete decay (or growth to a stable state); a mixed state of coupling/decoupling generally yields slow growth. Periodic behavior occurs only for PD PC 1. Compare this behavior with the cases where the s-rule is either the parity value rule (shown in the middle of the top row of Fig. 15) or the step-function rule (shown at left bottom of the ﬁgure). While the parity rule also displays four similar phases (growth to stability, decay to stability, incomplete growth, and incomplete decay), decaying structures eventually reach a stable (not null) ﬁnal state. The step-function rule shows an even greater variety of possible behaviors, and appears more sensitive to small changes in link probabilities. The probabilistic SDCA system discussed in this section adds a stochastic element speciﬁcally to SDCA. Of course, there are other ways of injecting stochasticity into a CA with dynamic topology. For example, Makowiec (2004) combines the deterministic evolution of a conventional CA with an asynchronous stochastic evolution of its underlying lattice (patterned after the Barabasi and Albert (2002) model of degree distributions in small-world networks), to explore

the inﬂuence of dynamic topology on the zerotemperature limit of ferromagnetic transitions. Random Dynamics Approximation For cases in which the structure and value conﬁgurations are both sufﬁciently random and uncorrelated, a random dynamics approximation (abbreviated, RDA) may sufﬁce to qualitatively predict how the system will tend to evolve under a speciﬁc rule set; for example, to predict whether a given rule is more (or less) likely to yield unbounded growth, to eventually settle into a low periodic state, or to simply decay. The idea is to approximate the real SDCA as a mean-ﬁeld; that is, assume all local value and structural correlations are close to zero (and can thus be ignored), and replace all speciﬁc site values and local link geometries with average, or effective, values. More precisely, assuming that (1) the probability pðnsi Þ of a site ‘i’ having value s = 1 at time t = n is the same for all sites – so that pðnsi Þ ¼ pðnsÞ for all i – and ðlij Þ (2) that the probability pn of two sites ‘i’ and ‘j’ being linked at t = n is the same for all pairs of sites – ðlij Þ so that pn ¼ pðnlÞ for all i and j – the RDA evolution equations may be written formally as follows: ( ð sÞ pnþ1 ¼ F RDA pðnsÞ , pðnlÞ ; GSDCA , (34) ðl Þ pnþ1 ¼ GRDA pðnsÞ , pðnlÞ ; GSDCA , where SDCA’s rule GSDCA (deﬁned in Eq. (14)) is included, formally, to remind us that the functional forms assumed by FRDA and GRDA will be different for different GSDCAs.

56

Structurally Dynamic Cellular Automata

Structurally Dynamic Cellular Automata, Fig. 15 Behavioral phase plots summarizing the long term evolution for several different s and ‘-rules deﬁned in Eq. (33). The x and y axes for each plot depict values ( {0, .25, .5, .75, 1}) of PC and PD, respectively. There are six classes of behavior: growth, decay, stability, large

and small ﬂuctuations (around a stable lattice), and periodicity. The initial graph is a Cartesian four-neighbor lattice in each case except for the top-right plot (labeled Random connections/links) for which the initial graph is random. (Reproduced with permission from Halpern and Caltagirone (1990))

The ﬁrst function, FRDA, is the easier of the two to calculate. For any given site with degree d we simply count the total number of ways to distribute the local s-values among the d possible neighboring sites to obtain the desired sums that deﬁne a given rule. In this way we ﬁnd the average expected s density at t = n + 1, assuming all sites in the lattice have the same degree d at time t = n:

any site has exactly d neighbors. Since this means that, out of a total of N 1 possible neighbors, a given site must have exactly d links, and not be connected to any of the remaining (N 1 d) sites, we have by inspection:

ðsÞ ðsÞ pnþ1 n 8 d,p dþ1a X d þ 1 h ia > > > pðnsÞ 1 pðnsÞ $T > > a > fag > > >X h ia0 þ1 da0 < d 1 pðnsÞ pðnsÞ ¼ a0 > > > fa0 g h i > dþ1a1 X > a1 > d þ1 ðsÞ ðsÞ > > þ 1 p $ OT p > n n : a1

(36)

fa1 g

(35) X ð sÞ We then get F RDA ! pnþ1 ¼ P d; pðnlÞ d pðnsÞ d,pðnsÞ as an average over all possible degrees, where P d; pðnlÞ is the probability that

0 N 1 1h id N 1d P d; pðnlÞ ¼ @ d A pðnlÞ 1 pðnlÞ :

To calculate the second function in Eq. (34) (= GRDA), we ﬁrst deﬁne the local transition functions 8 a p ðd 1 , d 2 ,lÞ > > < ¼n Probl ¼ 1 ! l 0 ¼ 0j d ¼ d , d ¼ d , A ¼ l , i 1 j 2 ij > pbn ðd 1 , d2 ,lÞ > : ¼ Prob D ¼ 2 ! l0 ¼ 1j d i ¼ d 1 , d j ¼ d 2 , Aij ¼ l ,

(37) which give the probabilities that any two sites – i and j – will be disconnected (pan) or connected (pbn) if they have prescribed degrees di = d1 and dj = d2, and are each linked to the same l sites

Structurally Dynamic Cellular Automata

57

in the shared neighbor set, Aij (see Fig. 1). In the case of type-T s- and ‘-rules, pan and pbn are given explicitly by (OT versions of s- and ‘-rules, and RT versions of ‘-rules are deﬁned by similar, but slightly more complicated, expressions): 8 P d 1 þ d 2 l ð sÞ bk > a > pn ðd 1 ,d 2 ,lÞ ¼ k pn > > bk > > > d þd < ðsÞ 1 2 lbk , 1 pn ek P > d þ d þ 2 l 1 2 > > pbn ðd 1 ,d 2 ,lÞ ¼ k pðnsÞ > > e k > > d 1 þd 2 þ2lek : 1 pðnsÞ , (38) where bk and ek refer to the sums that appear in Eqs. (11) and (12). The total probability that any two sites will be disconnected (l = 1 ! l0 = 0) or connected (D = 2 ! l0 = 1) – Pan and Pbn , respectively – may then be obtained by summing over all possible local topologies: 8 a Pn X ðl X ¼ 1 ! l 0 ¼ 0Þ i hProb > > X > > > P1 ðd 1 , d 2 ,lÞ pan ðd 1 , d 2 ,lÞ, ¼ > < d1

d2

l

d1

d2

l

Pbn X ðDX ¼ 2 ! l 0 ¼ 1Þ i hProb > > X > > > P2 ðd 1 , d 2 ,lÞ pbn ðd 1 , d 2 ,lÞ, ¼ > : (39) where 8 P1 ðd 1 ,d 2 ,lÞ ¼ Probðsites i,j j l ij ¼ 1 have > d i ¼ d 1 , > < d ¼ d ,A ¼ l , j

2

ij

P2 ðd 1 ,d 2 ,lÞ ¼ Probðsites i,j j l ij ¼ 0 have > d i ¼ d 1 , > : d j ¼ d 2 ,Aij ¼ l :

(40) To ﬁnd P1 we need to count, from among the remaining N 2 sites, the number of ways of selecting disjoint sets S1, containing d1 1 l sites linked only to i; S2, consisting of d2 1 l sites connected only to j; and S3, with l sites linked to both i and j. But this is simply a multinomial coefﬁcient, so we can write: ðN 2Þd 1 þd 2 l2 P1 ðd 1 ,d 2 ,lÞ ¼ ðd 1 1 lÞ!ðd 2 1 lÞ!l! ðlÞ d1 þd 2 2 2ðN 1Þd 1 d2 p 1 pðlÞ , (41) where (n)k n(n 1) (n k + 1). Similarly, for P2, we need to count the number of ways of

choosing d1 l sites from i, d2 l sites from j, and l sites from both: ðN 3Þd1 þd 2 l2 P2 ðd 1 ,d 2 ,lÞ ¼ ðd 1 lÞ!ðd 2 lÞ!l! d 1 þd 2 2ðN þl3Þd 1 d2 pð l Þ 1 pð l Þ : (42) The second (link-update) function of the pair of functions in Eq. (34) is thus given by ðl Þ

GRDA ! pnþ1

¼ pðnlÞ 1 Pan þ 1 pðnlÞ PD¼2 Pan ,

(43)

where, assuming that two sites, i and j, are not themselves connected, PD=2 = probability that there exists at least one site k, such that Dik = Djk = 1, which implies that PD¼2 ¼ 1 Probðthere is no such k Þ 2 N 2 ¼ 1 1 pðnlÞ ; and P1 and P2 are deﬁned in Eqs. (41) and (42). A structural equilibrium is established when ðl Þ pnþ1 pðnlÞ, which happens when the average number of new connections is equal to the average number of link deletions: Pbn hN nn i ¼ Pan hdegi, where hdegi ¼ pðnlÞ ðN 1Þ is the average degree, and Nnn is the average number of next-nearest neighbors. For SDCA rules that naturally tend to produce graphs with minimal site value and structural correlations, the predicted ratio of RDA link creations to deletions, gc:d Pbn N nn =Pan hdegi, may be used to predict qualitatively how the graphs will evolve. Since the averagenumber of pairs of sites a distance N D = 2 apart ¼ PD¼2 ¼ hN nn i N =2, we 2 ﬁnd that: ) ( h i2 N 2 Pbn 1 pðnlÞ ðl Þ gc::d ¼ a 1 1 pn : ðl Þ Pn pn (44) gc::d is also implicitly a function of site-value density, since pðnsÞ appears in both Pan and Pbn , deﬁned in Eq. (39). Figure 16 shows a grayscale density-plot of gc::d for an OT decoupler rule:

58

Structurally Dynamic Cellular Automata

Structurally Dynamic Cellular Automata, Fig. 16 Density-plot of gc::d for an OT decoupler rule: {(0, 0), (1, 1), (1, 2), (2, 2)}; an OT coupler rule: {(1, 1)}; 0:1 pðnsÞ 0:9; and 0:1 pðnlÞ 0:9; the rectangular area highlighted in black denotes the “equilibrium boundary” that separates regions of growth and decay

{(0, 0), (1, 1), (1, 2), (2, 2)}; an OT coupler rule: {(1, 1)}; 0:1 pðnsÞ 0:9 ; and 0:1 pðnlÞ 0:9 . Areas that are close to white represent combinations of pðnsÞ , pðnlÞ for which gc::d 1, and which therefore predict “decay”; areas that are to black represent combinations of close pðnsÞ , pðnlÞ for which gc::d 1, and predict “growth”; the rectangular area highlighted in black denotes the “equilibrium boundary” that separates regions of growth and decay.

Related Graph Dynamical Systems The original SDCA model (Ilachinski 1986) represents one (albeit not entirely arbitrary) approach to dynamically coupling site values({si}) and topology ({lij}), of the normally quiescent lattice. Since this model was primarily introduced as a general tool to explore self-organized emergent geometries, s values are an integral dynamic component only because SDCA’s original rules were conceived to generalize conventional CA rules, not replace them. Moreover, SDCA’s link rules are, by design, close analogs of their conventional-CA brethren; this is the reason why SDCA’s c and o

rules assume the familiar T and OT (and related RT) forms, as deﬁned in section “The Basic Model”. Indeed, while the preceding sections of this article have introduced several generalizations – such as the addition of probabilistic rules, reversibility and memory – in each case, the basic form of the rules (as deﬁned in Eqs. (11), (12), and (13)) has remained essentially the same. However, just as for conventional CA, an almost endless variety of different kinds of rules can in principle be deﬁned; including rules that alter the geometry but are not functions of the s states. In this section, we look at two illustrative examples of SDCA-like dynamical systems: one that uses coupled s-ℓ rules, and another whose rules depend only on topology. Graph Rewriting Automata Tomita et al. (2002, 2005, 2006a, b, c) have recently introduced graph rewriting automata (abbreviated, GRA), in which both links and (the number of) sites are allowed to change. Motivated by CA models of self-reproduction, Tomita et al suggest that ﬁxed, two-dimensional lattices – used as static backdrops to most conventional models – are unnecessarily restrictive for describing

Structurally Dynamic Cellular Automata

59

Structurally Dynamic Cellular Automata, Fig. 17 Graphical representations of the actions of the GRA rules deﬁned in Eq. (45). (Reproduced from Tomita et al. (2006a) with permission)

self-reproductive processes. They cite, as an example, the inability of conventional CA to describe biological processes (such as embryonic development) that must unfold in a ﬁnite closed space; once the underlying space of the CA is deﬁned at the start, however large (and sometimes deliberately assumed inﬁnite), its size remains the same throughout the development. This not only makes it hard to model the typically growing need that developing organisms have for space, but makes it impractical even to provide some room for avoiding overlaps between the original and daughter patterns (Tomita et al. 2002). Motivated by these, and other issues related to computation, Tomita et al. (2002, 2006a) introduce GRA, which is a form of graph grammar (Grzegorz 1997). At ﬁrst glance, GRA appear superﬁcially similar to SDCA, at least in the sense that they both dynamically couple site values with topology. However, the transition rules are very different, and – in GRA’s case – two properties hold that are not true for SDCA systems: (1) all sites have exactly three neighbors at all times (which is the minimum number of neighbors that yield nontrivial graphs (Tomita et al. 2002)), and (2) multiple links are allowed to exist between any two sites. The authors claim that the 3-neighbor restriction not only does not constrain the space of emergent geometries (an observation that is echoed by Wolfram (2002); see subsection “Network Automata” below) but has the added beneﬁt of allowing the rules to be expressed in a regular form: each rule is deﬁned by a rule name and, at most, six symbols for its argument:

ðs rulesÞ : ftransitionðx,a,b,cÞ ! ðu,a,b,cÞ, ðsite rulesÞ : divisionðx,a,b,cÞ ! ðu,v,w,a,b,cÞ, fusionðx,y,z,a,b,cÞ ! ðu,a,b,cÞ, ðlink rulesÞ : commutationðx,y,a,b,c,d Þ ! ðx,y,a,b,c,d Þ, annihilationðx,y,a,b,c,d Þ ! ða,b,c,d Þ, (45) where x, y and z denote the s values of the center sites before undergoing a structural change; u, v and w denote the s values of the center sites after the structural change; and a, b, c, and d denote the states of the neighboring sites. The ordering is unimportant, so long as a given string can be obtained from another by cyclic permutation, otherwise the strings are different; i.e., (a, b, c) is both topologically and functionally equivalent to (b, c, a), but (c, b, a) is different. The action of s, value, and links is graphically illustrated in Fig. 17. By convention, the GRA algorithm is applied in two steps: (1) site rules (transition, division and fusion) are executed ﬁrst, and at all subsequent even time steps, followed by (2) link rules (commutation and annihilation), executed at odd steps. In the event that multiple rules are simultaneously applicable – such as might happen, for example, if the rules include more than one division, or fusion, for the same lefthandside argument in their expressions (in Eq. (45)) – the order

60

Structurally Dynamic Cellular Automata

Structurally Dynamic Cellular Automata, Fig. 18 Sample GRA evolution starting from the graph on the left. The rules are (see Eq. (45)): (1) division

(1, 0, 0, 2) ! (1, 1, 1, 0, 0, 2), (2) commutation(1, 2) ! (1, 2), and (3) commutation(0, 0) ! (0, 0). (Reproduced from Tomita et al. (2006a) with permission)

in which the rules are applied is determined by an a priori priority ranking. Also, since applying either commutation or annihilation rules to adjacent links yields inconsistency, whenever a local context arises in which this might happen, the application of these rules is temporarily suppressed. (This is done by sweeping through the link set twice: on the ﬁrst pass, a temporary ﬂag is set for each link that satisﬁes a rule condition; on the second pass, the link rule is applied if and only if the four neighboring links did not raise ﬂags during the ﬁrst pass.) Figure 18 shows the ﬁrst few steps in applying one division and two commutation rules to a simple initial graph. (Kohji Tomita provides several movies of GRA evolutions on his website: http:// staff.aist.go.jp/k.tomita/ga/) Tomita et al. (2002, 2005, 2006a, b, c) report a variety of emergent behaviors, including (1) arbitrary resolution (because GRA rules effectively allow an arbitrary number of sites to “grow” out of any initial structure, these systems deﬁne their own “boundary conditions” and graphs with arbitrary resolution are possible); (2) repetitive structures, in which some geometrical subset of an initial graph is reproduced, indeﬁnitely, and continuously grafted onto the original structure; and (3) self-replication, in which both site-value and structure is replicated after N steps. In Tomita et al. (2006b), Tomita et al. describe how genetic algorithms (Mitchell 1998) may be used for automating the search for self-replicating patterns. In Tomita et al. (2002), Tomita et al. also present the design of a self-reproducing Turing Machine. Turing machines are abstract symbol manipulating devices that mimic the basic operations of a computer. Formally, they consist of a

“tape” (of indeﬁnite length, to record data), a “head” (that reads/writes symbols on the tape, and that can move left or right), and “state transition rules” (that tell the head which new symbols to write given the current state of the tape). The tape is analogous to “memory” in a modern computer; the head is analogous to the microprocessor. A Turing machine is called “universal” if it can simulate any other Turing machine. Tomita et al.’s (2002) Turing machine is modeled as a ladder structure: the upper sites constitute the “tape” mechanism; the lower sites form the “tape head” that reads the tape; both ends of the ladder are single sites that deﬁne “end of tape”; and the two ends are joined to form a loop. Although the tape is initially ﬁnite, the ladder can grow to arbitrary length, as required, by using appropriate GRA rules. Tomita et al. (2002) self-replicating Turing GRA consists of 20 states and 257 (2-symbol) rules. They also introduce a design for a universal Turing machine (Tomita et al. 2006a) that consists of 30 states and 955 rules for reproduction, and 23 states and 745 rules for computation. While self-reproducing universal Turing machines can be described using conventional CA, their expression using GRA rules are considerably more compact. Dynamic Graphs as Models of SelfReconfigurable Robots In the context of looking for self-reconﬁguration algorithms that may be used to manufacture modular robots for industry, Saidani (2003, 2004) has recently introduced a dynamic graph calculus that includes rules similar to those that deﬁne SDCA; but which depend only on the topology of (but not the s-values living on) the lattice. Saidani and Piel (2004) have also introduced an interactive

Structurally Dynamic Cellular Automata

61

Structurally Dynamic Cellular Automata, Fig. 19 Schematic illustration of a tree topology reconﬁguring itself into a linear chain using a set of case-based “if–then” topology rules deﬁned in Saidani (2004); see text for details

programming environment for studying dynamic graph simulations called Dynagraph, and implemented in Smalltalk. There are two basic approaches to designing modular robots: (1) to develop a set of elementary generic modules that can be rapidly assembled by humans to form robots that solve a speciﬁc problem, and (2) to design a set of (otherwise identical) primitive components that can adaptively reconﬁgure themselves. Focusing on the latter approach, Saidani (2004) formally reinterprets modular “robots” to mean modular networks; and proceeds to model adaptive robotic self-reconﬁgurations as a class of recursive graph dynamical systems. In contrast to other related dynamic graph models (Ferreira 2002; Harary and Gupta 1997), the “modules” (or subgraphs) of Saidani’s model use local knowledge of their neighborhood topology to collectively evolve to some goal conﬁguration. Although the dynamics transforms the global state, the evolution remains strictly decentralized, and individual modules do not know the (desired) ﬁnal state. Apart from restricting the dynamics to topology alone (indeed, none of the sites harbor information states of any kind), Saidani (2003, 2004), Saidani and Piel (2004) further assumes that (1) connections between sites are directional (both to- and from-links may coexist between the same two modular components); (2) “active” sites reconﬁgure their local neighborhood by accepting, keeping, or removing their adjacent links according to rules that are functions of their current topology (deﬁned as a given sites’ current local neighborhood and the current neighborhood of its neighbors: a site only knows about its own in- and out-degree, which can obviously be

computed from its local topology, and the inand out-degrees of its nearest neighbors); (3) a site controls its outgoing links (and can connect or disconnect any outgoing links), but cannot sever incoming connections; (4) sites must maintain at least one link throughout an evolution (so that the graph remains connected); and (5) all sites are equipped with the same set of rules. As in conventional CA and the basic SDCA model, the “reconﬁguration” proceeds synchronously throughout the graph. The decision process includes an innate stochastic element: in the event that there is a rule that speciﬁes that a site is to establish a link to a neighbor of one of its neighbors, but all neighboring sites have the same degree (which is the only dynamical discriminant), the neighbor with which a new link will be forged is selected at random. As a concrete example, Saidani (2004) presents a tree-to-chain algorithm that evolves an initial “tree” graph to a linear chain of linked sites (see Fig. 19). While we do not reproduce the full algorithm here, it is essentially a case-driven list of rules of the form if condition C1 (and condition C2, . . . and condition Cn) then connect (or disconnect) site i to (from) the nth neighbor of i’s neighbor, n. For example, an explicit “rule” might be: if 1 deg(i) 2 and deg+(i) = 1 and |t(i)| = 2 then link i to a neighboring site j that has deg(j) = 0, where deg(i) and deg+(i) are the in- and out-degrees of site i, and t(i) is the total number of sites to which i is currently linked (with either incoming or outgoing links). Conceptually, the details of Saidani’s rules are less important than what the unfolding process represents as a whole. An initial graph – which we recall is to be viewed as a distillation of a

62

“modular robot” – is transformed, by the individual sites (or parts of the robot), into another desired structure; i.e., the graph is entirely selfreconﬁgured. Though the broader reverseengineering problem (which includes asking such fundamental questions as “How can a desired ﬁnal state be mapped onto a speciﬁc cased-based list of graphical rules?”) remains, as yet, unanswered, and the Dynagraph work environment (Saidani and Piel 2004) is currently limited to experimenting only with graphs that have less than 30 sites, the basic model already represents a viable new approach to using dynamic graphs to describe self-reconﬁgurable robots; and is potentially more far-reaching as a general model of topologically-reconﬁgurable dynamical systems.

SDCA as Models of Fundamental Physics Pregeometric Theories of Emergent SpaceTime Although SDCA are a natural formal extension of conventional CA – and serve as general-purpose modeling tools – their conception was originally motivated by fundamental physics; speciﬁcally, by a search for models of self-organized emergent discrete space-time (Meschini et al. 2005). “Space acts on matter, telling it how to move; . . . matter reacts back on space, telling it how to curve”, which is the central lesson of Einstein’s geometrodynamics, as explained by Misner, Thorne and Wheeler in their classic text on Gravitation (Misner et al. 1973). Wheeler (1982) has been a particularly eloquent spokesman for the need to search for what he calls a pregeometry, or a set of basic elements out of which what we normally think of geometry is built, but which are themselves devoid of a speciﬁc dimensionality: “Space-time . . . often considered to be the ultimate continuum of physics, evidences nowhere more clearly than at big bang and at collapse that it cannot be a continuum. Obliterated in those events is not only matter, but the space and time that envelope that matter . . . we are led to ask out of what ‘pregeometry’ the geometry of space and spacetime are built”. Wheeler has also

Structurally Dynamic Cellular Automata

proposed the idea that particles be viewed as geometric disturbances of space time, called geometrodynamic excitons. A priori, SDCA appear tailor-made for describing pregeometric theories of space-time. Since in SDCA, lattice and local s-values are explicitly coupled, and geometry and value conﬁgurations are treated on an approximately equal footing, SDCA is certainly at least formally consistent with Einstein’s geometrodynamic credo. The structure is altered locally as a function of individual site neighborhood value-states and geometries, while local site-connectivity supports the site-value evolution in exactly the same way as in conventional CA models deﬁned on random lattices. The microphysical view of physics that emerges from this construction is one in which a fundamentally discrete pregeometry continually evolves in time as an amorphous structure but with a globally well-deﬁned dimensionality. Particles are constructs of that amorphous structure and can be viewed as locally persistent substructures – i.e. geometrical or topological solitons – with dimensions that differ from the surrounding value. Just as “value structure” solitons are ubiquitous in conventional CA models (Ilachinski 2001; Wolfram 1984), “link structure” solitons might emerge in SDCA; physical particles would, in such a scheme, be viewed as geometrodynamic disturbances propagating within a dynamic lattice. Of course, speculation regarding the ultimate constituents of matter and space-time date back at least as far as 500 BC when the philosopher Democritus mused on the idea that matter is made of indivisible units separated by void. Since then there have been countless attempts, with varying degrees of success, to fashion an entirely discrete theory of nature. We limit our discussion to a short survey of some recent work that centers on ideas that are either direct outgrowths of, or are otherwise conceptually related to, SDCA models. (A short history of pregeometric theories appears in Chap. 12 of Ilachinski (2001)). One of the earliest proponents of pregeometry is Zuse (1982), who speculated on what it would take for a CA-like universe to sustain “digital

Structurally Dynamic Cellular Automata

particles” on a cellular lattice. He focused on two main problems: (1) How does the universe’s observed isotropy arise from a CA’s (Euclidean, hexagonal, etc.) anisotropy?, and (2) What is the information content of a physical particle? As an answer to the ﬁrst question, Zuse suggests . . . “. . . variable and growing automata. Irregularities of the grid structure are a function of moving patterns, which is represented by digital particles. Now, not only certain values are assigned to the single crosspoints of the grid in the concept of the cellular automaton which are interrelated and sequencing each other, but also the irregularities of the grid are itself functions of these values of the just existing interlinking network. One can imagine rather easily that in such a way the interdependence of mass, energy, and curvature of space may logically result from the behavior of the grid structure.”

Jourjine (1985) generalizes Euclidean lattice ﬁeld theory on a d-dimensional lattice to a cell complex. Using homology theory to replace points by cells of various dimensions and ﬁelds by functions on cells, he develops a formalism that treats space-time as a dynamical variable and describes the change in the dimension of space-time as a phase transition. Kaplunovsky and Weinstein (1985) develop a ﬁeld-theoretic formalism that treats the topology and dimension of the spacetime continuum as dynamically generated variables. Dimensionality is introduced out of the characteristic behavior of the energy spectrum of a system of a large number of coupled oscillators. Dadic and Pisk (1979) introduce a selfgenerating discrete-space model that is based on the local quantum-mechanics of graphs. Just as in SDCA, Dadic and Pisk’s spatial structure is discrete but not static; it is fundamentally amorphous and evolves in time. Though the metric is essentially the same one used to deﬁne SDCA (i.e., Deffec), it is generalized to unlabeled graphs by referring to the topological description of the node positions rather than their arbitrary labels. Though their “graph dynamics” differs from what is used by SDCA (and uses a symmetrized Fock space that is local in terms of their graph metric, where “Fock space” is a Hilbert space used to describe quantum states with a variable, or unspeciﬁed, number of particles, and is made from the direct

63

sum of tensor products of single-particle; or, in this case, single-graph, Hilbert spaces) it shares two important properties with SDCA: (1) interactions depend only on the local properties of the graph, and (2) interactions induce only minimal changes to the local metric function. An important consequence of their theory is that the dimension of a graph is a scale dependent quantity that is generated by the dynamics. Combinatorial Space-Time

Hillman (1995) introduces a combinatorial space-time, which he deﬁnes as a class of dynamical systems in which ﬁnite pieces of space time contain ﬁnite amounts of information. Space time is modeled as a combinatorial object, constructed by dynamically coupling copies of ﬁnitely many types of certain allowed neighborhoods. There is no a priori metric, and no concept of continuity, which is expected to emerge on the macroscale. The construction (and evolution) of spaces proceeds in three steps: (1) deﬁne a set X of combinatorial n-dimensional spaces (examples are conventional CA graphs, graphs with directional links, or some other kind of embedded symmetry); (2) deﬁne a set of local, invertible primitive maps T : X $ Y between pairs of space sets, such that the maps do not all commute with one another (for example, a simple renaming of the sites or links gives an invertible, local map); (3) generate an arbitrary set of local invertible graph transformations by composing primitive maps with one another. Since the primitive maps are deliberately chosen so that they do not all commute, the act of composition yields inﬁnitely many nontrivial transformations. The orbits{T z(x)| z Z} (for each space x in X) are (n + 1)-dimensional combinatorial spacetimes; which include reversible CA and SDCA-like networks in which geometry evolves locally over time. Formally, Hillman uses matrices of nonnegative integers, directed graphs, and symmetric tensors to describe these systems, so that local equivalences between space sets are generated by simple matrix transformations. Concrete examples of dynamic combinatorial space-time graphs are given in Hillman (1995).

64

Structurally Dynamic Disordered Cellular Networks

As an explicit example of how dynamic graphs can be used to model pregeometry, consider structurally dynamic disordered cellular networks (abbreviated, SDDCN), recently introduced by Nowotny and Requardt (1998, 1999, 2006) and Requardt (1998, 2003a, b). SDDCN are a class of models closely related to SDCA but developed explicitly to describe a discrete, dynamic space-time fundamental physics. The main difference between the two models is that whereas link connections in SDCA are strictly local, SDDCN are capable of generating both local and translocal links. In contrast to more mainstream high-energy theories of fundamental physics (which are dominated by string theory and/or loop quantum gravity, both of which assume a certain level discretization at the Planck scale, but assume that a discrete space-time emerges from an underlying continuum physics), SDDCN takes a bottom-up approach. SDDCN assumes that there is underlying dynamic, discrete and highly erratic network substratum that consists of (on a given scale) irreducible mutually interacting agents exchanging information via primordial channels (links). The known continuum structures are expected to emerge on a macroscopic (or, mesoscopic) scale, via a sequence of coarse graining and/or renormalization steps. Like SDCA, SDDCN are deﬁned on arbitrary graphs, G, initially deﬁned by a speciﬁed set of sites and links. Both sites and links are allowed to take on values. Site values, si (which represent a primitive “charge”), are taken from some discrete set, q Z, where q is a discrete quantum of information; link states assume the values Jij {1, 0, +1}, and represent an elementary coupling. The Jij are equivalent to SDCA’s lij, but take on three values rather than two. Heuristically, Jij represent directed edges pointing either from site i to j (if Jij = 1), or from j to i (if Jij = 1); or, in the case of Jij = 0, the absence of a link. At each time step (representing an elementary quantum of time), an elementary quantum q is transported along each existing directed link in the indicated direction. As for SDCA, SDDCN dynamically couples site values to links.

Structurally Dynamic Cellular Automata

Nowotny and Requardt (1998) introduce two network models: one in which connected sites that have very different internal states typically lead to large local ﬂuctuations (=SDDCN1), and another in which sites with similar internal states are connected (=SDDCN2): SDDCN X 8 tþ11 si ¼ sti þ J tji , > > > > j < $ J tþ1 ¼ signDs ij > > > ij > : tþ1 J ij ¼ 0, SDDCN X 8 2 > stþ1 ¼ sti þ J tji , > i > > j > > > < tþ1 $ J ij ¼ sign Dsij > > > > J tþ1 ¼ J t , > ij ij > > : J tþ1 ¼ 0, ij

Dsij l2 ,or for Dsij l1 ^J tij ¼ 6 0, otherwise,

0 < Dsij < l1 ,or for 0 < Dsij < l2 ^J tij 6¼ 0, for Dsij ¼ 0, otherwise,

(46) where Dsij ¼ sti stj , and l2 l1 0. Since SDDCN is intended to model pregeometric dynamics, Nowotny and Requardt (1998) caution that the t parameter that appears in these equations must not to be confused with the “true time” that (they expect) emerges on coarser scales. In keeping with its physics-based motivation, SDDCN’s dynamical laws depend only on the relative differences in site values, not on their absolute values. Indeed, charge is nowhere either created or destroyed, Xso that SDDCN conserves global “charge”: sti ¼ constant , where the arbitrary constant cani be set to zero. Both models start out initially on a simplex graph with N 200 nodes, so that the maximum number of possible links is N(N 1)/2. The initial s-seed consists of a uniform random distribution of values scattered over the interval {k, k + 1, . . ., k 1, k}, where k 100. The initial values for link states, J t¼0 ij , are selected from {1, 1} with equal probability; i.e., the initial state is a maximally entangled nucleus of nodes and links. Nowotny and Requardt (2006) state that “. . . in a sense, this is a scenario which tries to imitate the big bang scenario. The hope is, that from this nucleus some large-scale patterns may ultimately

Structurally Dynamic Cellular Automata

emerge for large clock-time”. X For most properties stþ1 st , which are (other than the st and i i i both equal to zero by construction), the average over the width of the initial vertex state distribution, taken over l1 and l 2, speciﬁc realizations of initial conditions, and time, depend linearly on network size. We summarize Nowotny’s and Requardt’s (1998, 2006) ﬁndings, culled from extensive numerical experiments: (1) the appearance of very short limit cycles in SDDCN1 (period 6 and multiples of 6, with the longest having period 36 on a network of size N = 800), (2) Much longer limit cycles and transients in SDDCN2, both of which appear to grow approximately exponentially, (3) structurally, SDDCN1 evolve from almost fully connected simplex networks to more sparse connectivities with increasing l1/2; there is a regime in which few vertices with very high degree coexist with many vertices with a low degree; for large around l1 60; for large l1/2, the graph eventually breaks apart and all nodes become isolated; (4) for SDDCN2, nodes typically have zero degree small l1/2, and links become increasingly dense as l1/2 increase; the degree distribution is generally broad and remains so for large l1/2 (the authors also note observing multiple local maxima of the distributions in a wide range of l1/2 values); (5) for SDDCN1, there is an abrupt phase-transition in the temporal ﬂuctuations of vertex degrees (deﬁned as degi(t + 1) degi(t)) from a state in which there are essentially no ﬂuctuations (“frozen network”) to one with strong ﬂuctuations (“liquid network”); (6) the distribution of site values is strongly bimodal for 62 l1 85 for SDDCN1 while SDDCN1 distributions are not bimodal, the width of the site value distributions for different values of l 1 appears modulated. From a fundamental physics perspective, the most interesting class of behaviors of SDDCN involves emergent dimensionality. Nowotny and Requardt (2006) argue that since the continuum is a self-organized dynamic structure that emerges in the limit of large N and t, the most useful measure of “dimension” cannot be purely local (as in the case of effective dimensionality, Deffec, used for describing SDCA systems). Rather, it must be an

65

intrinsically global property; one that is independent of any arbitrary embedding dimension, and one that can take on relatively stable values in the whole (to characterize effective system-wide characteristics), while simultaneously being relatively impervious to otherwise rapidly changing structural changing taking place on the microscale. Toward this end, Nowotny and Requardt (1998) deﬁne the upper (and lower) scaling dimensions, L DU S ðiÞ (and DS ðiÞ), with respect to site i: DU S ðiÞ ¼ lim sup r!1

DLS ðiÞ

lnbði,rÞ , ln r

lnbði,rÞ , ¼ lim inf r!1 ln r

(47)

and the upper (and lower) connectivity dimenL sions, DU C ðiÞ (and DC ðiÞ), with respect to site i: DU C ðiÞ ¼ lim sup r!1

DLC ðiÞ

[email protected]ði,rÞ , ln r

[email protected]ði,rÞ , ¼ lim inf r!1 ln r

(48)

where b(i, r) = # sitesj j Dij r, and @b(i, r) is the number of sites on the surface of the r-sphere. When the upper and lower limits coincide, we have the scaling dimension (=DS) and the connectivity dimension (=DC), respectively. DS is related to well known dimensional concepts in fractal geometry; DC is a more physical measure that describes how the graph is connected, and thus how sites may potentially inﬂuence one another (Nowotny and Requardt 2006). Preliminary research (Nowotny and Requardt 1998) suggests that under certain conditions, behavior resembling a structural phase transition to states with stable internal (and/or connectivity) dimensions is possible. Network Automata Stephen Wolfram devotes Chap. 9 of his Opus – A new kind of science (abbreviated, NKS) (Wolfram 2002) – to applying CA to fundamental physics; and speculates on ways in which space may be described using a dynamic network. The central, overarching theme of NKS is that “simple” programs often sufﬁce to capture complex behaviors.

66

Structurally Dynamic Cellular Automata

The bold claim made in Chap. 9 of NKS is that, on an even more fundamental level, what underlies all the laws of physics, as we currently understand them, is a simple CA-like program, from which, ultimately, all the phenomenologically observed complexity in the universe naturally emerges. As for the speciﬁc forms such a “program” may take, Wolfram’s intellectual point of departure echoes that of other proponents of a discrete dynamic pregeometric theory: “. . . cellular automata . . . cells are always arranged in a rigid array in space. I strongly suspect that in the underlying rule for our universe there will be no such built-in structure. Rather . . . my guess is that at the lowest level there will just be certain patterns of connectivity that tend to exist, and that space as we know it will then emerge from these patterns as a kind of large-scale limit.”

Wolfram introduces his network automata (abbreviated, NA) with these basic assumptions (see additional notes in NKS (Wolfram 2002) on the evolution of networks: pp. 1037–1040): (1) features of our universe emerge solely from properties of space, (2) the underlying model (and/or “rules”) must contain only a minimal underlying geometric structure, (3) the individual sites of emergent graphs must not be assigned any intrinsic position, (4) sites are limited to possessing purely topological information (that deﬁnes the set of sites to which a given site is connected), (5) incoming and outgoing connections need not be distinguished, and (6) all sites have exactly the same total number of links to other sites (which is assumed equal to three). This last assumption – which is essentially the same one made by Nowotny and Requardt (1998) as the basis of their SDDCN model; see subsection “Structurally Dynamic Disordered Cellular Networks” above – does not lead to any

loss of generality. With two connections, only very trivial graphs are possible; and it is easy to show that any site with more than three links can always be redeﬁned, locally, as a collection of sites with exactly three links each (see Fig. 20). Wolfram (2002) gives several concrete examples of evolving graphs (as models of pregeometry), the dynamics of which are prescribed by a set of substitution rules; i.e., explicit lists of the topological conﬁgurations (of sites and links) that are used to replace (at time t + 1) speciﬁc local conﬁgurations (as they appear at time t). However, in contrast to SDCA rules, Wolfram’s substitution rules are strictly topological; no site-value information is used. Also, the number of sites in the graph can change as the graph evolves; where, in SDCA, the number remains constant. Figure 21 shows examples of rules in which speciﬁc clusters of sites are replaced with other clusters of sites. While the rules shown in the ﬁgure share the property that they all preserve planarity, there is no particular reason for imposing such a restriction; in fact, rules that generate non-planarity are just as easy to deﬁne. Wolfram speculates (2002, pp. 526–530) that “particle states” may be deﬁned as mobile non-planar subgraphs that persist on an otherwise planar, but randomly ﬂuctuating topology. Reversible versions of these rules may also be constructed, by associating a “backward” version with each “forward” transformation. Some care must be taken while both deﬁning and applying these rules consistently. For example, if a cluster of sites contains a certain number of links at t, one is not permitted to deﬁne a rule that replaces that cluster with another one that has a different number of connections. Another restriction is that rules must be independent of orientation; that is, if a candidate rule requires

Structurally Dynamic Cellular Automata, Fig. 20 Illustration of how sites that have more than three links can always be redeﬁned as a set of sites with exactly three links each

Structurally Dynamic Cellular Automata

67

Structurally Dynamic Cellular Automata, Fig. 21 Examples of planarity-preserving network substitution rules. (Reproduced from Wolfram (2002) with permission)

identifying the speciﬁc links (of, say, an otherwise topologically symmetric n-link local subgraph) before activating a desired substitution, that rule is likewise forbidden. However, even with these restrictions, a large number of rules are still possible. For example, 419 distinct rules may be deﬁned for clusters with no more than ﬁve sites. In applying network rules, one cannot simply simultaneously replace all pertinent subgraphs with their replacements, since, in general, two or more subgraphs with the same topology may overlap somewhere within the network. Since there is no priori, or universally consistent, way of ordering the subgraphs, meta-rules must be imposed to eliminate any possible ambiguities. For example, one method (m1) is to restrict replacements to a single subgraph per time step, selecting the subgraph whose replacement entails the minimal change to all recently updated sites. Another method (m2) is to allow all possible nonoverlapping replacements, while ignoring those that overlap. Wolfram reports that, although the second method obviously produces larger graphs in fewer steps, the two methods generally produce qualitatively similar structures. Figure 22 traces the ﬁrst few steps in the evolution of a simple graph under the action of a single substitution rule (deﬁned at the center of the ﬁgure). Figure 22a, b show the results of applying this rule using methods m1 and m2, respectively. In each case, the top row shows the form of the network before the substitution takes place at that step, and the bottom row shows the network that results from the substitution. The

subgraph (or subgraphs, in Fig. 22a) involved in the replacement is highlighted at both top and bottom. Wolfram also suggests that analogs of mobile automata (Miramontes et al. 1993) can be deﬁned for evolving networks. By tagging a site i, say, with a “charge”, si 1, substitution rules may be deﬁned to replace clusters of sites around the charged site. The effect is that the charge itself appears to move, as its effective (relative) position within the network changes as the geometric dynamics unfolds. (However, Wolfram also notes – on page 1040 in Wolfram (2002) – that “despite looking at several hundred cases I have not been able to ﬁnd network mobile automata with especially complicated behavior”).

Future Directions and Speculations Although SDCA were ﬁrst introduced over two decades ago (Ilachinski 1986), much of their behavior remains unexplored. Of course, this is due largely to the difﬁculty of studying dynamical systems that harbor an a priori vastly larger coupled value-geometry space than the “merely” spatially-conﬁned behavioral space of conventional CA. Only relatively recently have desktop computers become sufﬁciently powerful, and visualization programs adept enough at rendering multidimensional graphs (Chen 2004), to make a serious study of SDCA behaviors possible. For example, the general-purpose math programs Mathematica (http://www.wri.com) and Maple

68

Structurally Dynamic Cellular Automata

Structurally Dynamic Cellular Automata, Fig. 22 Examples of network evolutions using the substitution rule shown at center. See text for explanation. (Reproduced from Wolfram (2002) with permission)

(http://www.maplesoft.com) both provide powerful built-in graph-rendering algorithms to help visualize complex graphs. Standalone publicdomain packages are also available; for example, AGNA (2008), NetDraw (Borgatti 2002), and Pajek (Nooy et al. 2005). In this ﬁnal section, we list several open questions and brieﬂy speculate on possible future directions. Because of the relative paucity of studies dedicated purely to exploring the space of emergent structures (such as Wolfram’s (1984) pioneering studies of conventional CA), many (even very fundamental) questions remain open: What kinds of geometries can arise?, Which subspace of the space of all possible graphs corresponds to those that are actually attainable using SDCA (and SDCA-like) rules?, What are the conditions for which certain geometries do, and do not, form?, What combinations of s- and ‘-rules give rise to speciﬁc kinds of graphs? Other open problems include: (1) determining whether the (provisionally deﬁned) set of class-4 rules, for which effective dimension appears to remain constant, is genuine, rather than being

either a long-term transient or an unintentional artifact of imposed run-time constraints; and, if this class is “real”, we obviously need to ask, How large is it?, and Under what conditions does it arise?; (2) developing SDCA as formal mathematical models, perhaps as members of a broader class of graph grammars (Grzegorz 1997; Kniemeyer et al. 2004); and (3) ﬁnding purely geometric analogs of the solitons known to exist in conventional CA models (Ilachinski 2001; Wolfram 1984). This article has introduced several generalizations of the basic SDCA model, including memory effects (subsection “SDCA With Memory”), reversibility (subsection “Reversible SDCA”), probabilistic transitions (subsection “Probabilistic SDCA”), and a class of SDCA-like dynamical systems that evolve according to rules that depend only on topology (subsections “Dynamic Graphs as Models of Self-Reconﬁgurable Robots” and “Network Automata”). However, other possibilities abound:(1) s site-variables may take on a larger range of values, s {0, 1, . . ., k 1}; (2) link variables,‘ij, may similarly take on a larger

Structurally Dynamic Cellular Automata

range of values, ‘ij {0, 1, 2, . . ., m} (where, say, determines “directionality”, and absolute value, |‘ij|, represents either channel capacity for information ﬂow or some other innate property); and (3) both sites and links may take on richer, and more explicitly “active”, roles of agent-actors (Ferber 1999). Apart from these formal extensions, some obvious future applications include modeling communication and social network dynamics, studying the dynamics of plasticity in artiﬁcial neural networks, designing adaptive self-reconﬁguring parallelcomputer networks (as well as “amorphous” computer chips), studying behaviors of gene-regulatory networks, and providing the conceptual core for fundamental pregeometric physical theories of discrete, emergent space-times.

Bibliography Primary Literature Adamatzky A (1995) Identiﬁcation of cellular automata. Taylor & Francis, London Albert J, Culik IIK (1987) A simple universal cellular automaton and its one-way and totalistic version. Complex Syst 1:1–16 Ali SM, Zimmer RM (1995) Games of proto-life in masked cellular automata. Complex Int 2. http://www.complex ity.org.au Ali SM, Zimmer RM (2000) A formal framework for emergent panpsychism. In: Tucson 2000: consciousness research abstracts. http://www.consciousness.ari zona.edu/tucson2000/. Accessed 14 Oct 2008 Alonso-Sanz R (2006) The beehive cellular automaton with memory. J Cell Autom 1(3):195–211 Alonso-Sanz R (2007) A structurally dynamic cellular automaton with memory. Chaos, Solitons Fractals 32(4):1285–1304 Alonso-Sanz R, Martin M (2006) A structurally dynamic cellular automaton with memory in the hexagonal tessellation. In: El Yacoubi S, Chopard B, Bandini S (eds) Lecture notes in computer science, vol 4173. Springer, New York, pp 30–40 Applied Graph & Network Analysis software. http://benta. addr.com/agna/. Accessed 14 Oct 2008 Barabasi AL, Albert R (2002) Statistical mechanics of complex networks. Rev Mod Phys 74:47–97 Bollobas B (2002) Modern graph theory. Springer, New York Borgatti SP (2002) NetDraw 1.0: network visualization software. Analytic Technologies, Harvard

69 Chen C (2004) Graph drawing algorithms. In: Information visualization. Springer, New York Dadic I, Pisk K (1979) Dynamics of discrete-space structure. Int J Theor Phys 18:345–358 Doi H (1984) Graph theoretical analysis of cleavage pattern: graph developmental system and its application to cleavage pattern in ascidian egg. Develop Growth Differ 26(1):49–60 Durrett R (2006) Random graph dynamics. Cambridge University Press, New York Erdos P, Renyi A (1960) On the evolution of random graphs. Publ Math Inst Hung Acad Sci 5:11–61 Ferber J (1999) Multi-agent systems: an introduction to distributed artiﬁcial intelligence. Addison-Wesley, New York Ferreira A (2002) On models and algorithms for dynamic communication networks: the case for evolving graphs. In: 4th Recontres Francophones sur les Aspects Algorithmiques des Télécommunications (ALGOTEL 2002), Meze Gerstner W, Kistler WM (2002) Spiking neuron models. Single neurons, populations, plasticity. Cambridge University Press, New York Grzegorz R (1997) Handbook of graph grammars and computing by graph transformation. World Scientiﬁc, Singapore Halpern P (1989) Sticks and stones: a guide to structurally dynamic cellular automata. Am J Phys 57(5):405–408 Halpern P (1996) Genetic algorithms on structurally dynamic lattices. In: Toffo T, Biafore M, Leao J (eds) PhysComp96. New England Complex Systems Institute, Cambridge, pp 135–136 Halpern P (2003) Evolutionary algorithms on a selforganized, dynamic lattice. In: Bar-Yam Y, Minai A (eds) Unifying themes in complex systems, vol 2. Proceedings of the second international conference on complex systems. Westview Press Cambridge Halpern P, Caltagirone G (1990) Behavior of topological cellular automata. Complex Syst 4:623–651 Harary F, Gupta G (1997) Dynamic graph models. Math Comp Model 25(7):79–87 Hasslacher B, Meyer D (1998) Modeling dynamical geometry with lattice gas automata. Int J Mod Phys C 9:1597 Hillman D (1995) Combinatorial spacetimes. PhD dissertation, University of Pittsburgh Ilachinski A (1986) Topological life-games I. Preprint. State University of New York at Stony Brook Ilachinski A (1988) Computer explorations of self organization in discrete complex systems. Diss Abstr Int B 49(12):5349 Ilachinski A (2001) Cellular automata: a discrete universe. World Scientiﬁc, Singapore Ilachinski A, Halpern P (1987a) Structurally dynamic cellular automata. Preprint. State University of New York at Stony Brook Ilachinski A, Halpern P (1987b) Structurally dynamic cellular automata. Complex Syst 1(3):503–527 Jourjine AN (1985) Dimensional phase transitions: coupling of matter to the cell complex. Phys Rev D 31:1443

70 Kaplunovsky V, Weinstein M (1985) Space-time: arena or illusion? Phys Rev D 31:1879–1898 Kniemeyer O, Buck-Sorlin GH, Kurth W (2004) A graph grammar approach to artiﬁcial life. Artif Life 10(4):413–431 Krivovichev SV (2004) Crystal structures and cellular automata. Acta Crystallogr A 60(3):257–262 Lehmann KA, Kaufmann M (2005) Evolutionary algorithms for the self-organized evolution of networks. In: Proceedings of the 2005 conference on genetic and evolutionary computation. ACM Press, Washington, DC/New York Love P, Bruce M, Meyer D (2004) Lattice gas simulations of dynamical geometry in one dimension. Phil Trans Royal Soc A: Math Phys Eng Sci 362(1821):1667–1675 Majercik S (1994) Structurally dynamic cellular automata. Master’s thesis, Department of Computer Science, University of Southern Maine Makowiec D (2004) Cellular automata with majority rule on evolving network. In: Lecture notes in computer science, vol 3305. Springer, Berlin, pp 141–150 Mendes RV (2004) Tools for network dynamics. Int J Bifurc Chaos 15(4):1185–1213 Meschini D, Lehto M, Piilonen J (2005) Geometry, pregeometry and beyond. Stud Hist Philos Mod Phys 36:435–464 Miramontes O, Solé R, Goodwin B (1993) Collective behavior of random-activated mobile cellular automata. Physica D 63:145–160 Misner CW, Thorne KS, Wheeler JA (1973) Gravitation. W.H. Freeman, New York Mitchell M (1998) An introduction to genetic algorithms. MIT Press, Boston Moore EF (1962) Sequential machines: selected papers. Addison-Wesley, New York Muhlenbein H (1991) Parallel genetic algorithm, population dynamics and combinatorial optimization. In: Schaffer H (ed) Third international conference on genetic algorithms. Morgan Kauffman, San Francisco Murata S, Tomita K, Kurokawa H (2002) System generation by graph automata. In: Ueda K (ed) Proceedings of the 4th international workshop on emergent synthesis (IWES ‘02), Kobe University, pp 47–52 Mustafa S (1999) The concept of poiesis and its application in a Heideggerian critique of computationally emergent artiﬁciality. PhD thesis, Brunel University, London Newman M, Barabasi A, Watts DJ (2006) The structure and dynamics of networks. Princeton University Press, New Jersey Nochella J (2006) Cellular automata on networks. Talk given at the wolfram science conference (NKS2006), Washington, DC, 16–18 June Nooy W, Mrvar A, Batagelj V (2005) Exploratory social network analysis with Pajek. Cambridge University Press, New York Nowotny T, Requardt M (1998) Dimension theory of graphs and networks. J Phys A 31:2447–2463

Structurally Dynamic Cellular Automata Nowotny T, Requardt M (1999) Pregeometric concepts on graphs and cellular networks as possible models of space-time at the Planck-scale. Chaos, Solitons Fractals 10:469–486 Nowotny T, Requardt M (2006) Emergent properties in structurally dynamic disordered cellular networks. arXiv:cond-mat/0611427. Accessed 14 Oct 2008 O’Sullivan D (2001) Graph-cellular automata: a generalized discrete urban and regional model. Environ Plan B: Plan Des 28(5):687–705 Prusinkiewicz P, Lindenmayer A (1990) The algorithmic beauty of plants. Springer, New York Requardt M (1998) Cellular networks as models for Planck-scale physics. J Phys A 31:7997–8021 Requardt M (2003a) A geometric renormalisation group in discrete quantum space-time. J Math Phys 44:5588–5615 Requardt M (2003b) Scale free small world networks and the structure of quantum space-time. arXiv.org:gr-qc/ 0308089 Rose H (1993) Topologische Zellulaere Automaten. Master’s thesis, Humboldt University of Berlin Rose H, Hempel H, Schimansky-Geier L (1994) Stochastic dynamics of catalytic CO oxidation on Pt(100). Physica A 206:421–440 Saidani S (2003) Topodynamique de Graphe. Les Journées Graphes, Réseaux et Modélisation. ESPCI, Paris Saidani S (2004) Self-reconﬁgurable robots topodynamic. In: IEEE international conference on robotics and automation, vol 3. IEEE Press, New York, pp 2883–2887 Saidani S, Piel M (2004) DynaGraph: a Smalltalk environment for self-reconﬁgurable robots simulation. European Smalltalk User Group conference. http:// www.esug.org/ Schliecker G (1998) Binary random cellular structures. Phys Rev E 57:R1219–R1222 Tomita K, Kurokawa H, Murata S (2002) Graph automata: natural expression of self-reproduction. Physica D 171(4):197–210 Tomita K, Kurokawa H, Murata S (2005) Self-description for construction and execution in graph rewriting automata. In: Lecture notes in computer science, vol 3630. Springer, Berlin, pp 705–715 Tomita K, Kurokawa H, Murata S (2006a) Two-state graph-rewriting automata. NKS 2006 conference, Washington, DC Tomita K, Kurokawa H, Murata S (2006b) Automatic generation of self-replicating patterns in graph automata. Int J Bifurc Chaos 16(4):1011–1018 Tomita K, Kurokawa H, Murata S (2006c) Self-description for construction and computation on graph-rewriting automata. Artif Life 13(4):383–396 Weinert K, Mehnen J, Rudolph G (2002) Dynamic neighborhood structures in parallel evolution strategies. Complex Syst 13(3):227–244 Wheeler JA (1982) The computer and the universe. Int J Theor Phys 21:557

Structurally Dynamic Cellular Automata Wolfram S (1984) Universality and complexity in cellular automata. Physica D 10:1–35 Wolfram S (2002) A new kind of science. Wolfram Media, Champaign, pp 508–545 Zuse K (1982) The computing universe. Int J Theor Phys 21:589–600

Books and Reviews Battista G, Eades P, Tamassia R, Tollis IG (1999) Graph drawing: algorithms for the visualization of graphs. Prentice Hall, New Jersey

71 Bornholdt S, Schuster HG (eds) (2003) Handbook of graphs and networks. Wiley-VCH, Cambridge Breiger R, Carley K, Pattison P (2003) Dynamical social network modeling and analysis. The National Academy Press, Washington, DC Dogogovtsev SN, Mendes JF (2003) Evolution of networks. Oxford University Press, New York Durrett R (2006) Random graph dynamics. Cambridge University Press, New York Gross JL, Yellen J (eds) (2004) Handbook of graph theory. CRC Press, Boca Raton

Asynchronous Cellular Automata Nazim Fatès LORIA UMR 7503, Inria Nancy – Grand Est, Nancy, France

Article Outline Glossary Article Outline Deﬁnition of the Subject Introduction Deﬁning Asynchrony in the Cellular Models Convergence Properties of Simple Binary Rules Phase Transitions Induced by a-Asynchronous Updating Other Questions Related to the Dynamics Openings Cross-References Bibliography

Glossary Conﬁgurations These objects represent the global state of the cellular automaton under study. The set of conﬁgurations is denoted by Qℒ, where Q is the set of states of the cells and ℒ is the space of cells. In this text, we mainly consider ﬁnite conﬁgurations with periodic boundary conditions. In one dimension, we use ℒ = ℤ/nℤ, the class of equivalence of integers modulo n. Convergence When started from a given initial condition, the system evolves until it attains a set of conﬁgurations from which it will not escape. It is a difﬁcult problem to know in general what are the properties of these attractive sets and how long it takes for the system to attain them. In this text, we are particularly interested in the case where these sets are limited to a single conﬁguration, that is, when the

system converges to a ﬁxed point. Fixed points play a special role in the theory of asynchronous cellular automata because synchronous and (classical) asynchronous models have the same set of ﬁxed points. In some cases, reaching a ﬁxed point can be interpreted as the end of a randomized computation. De Bruijn graph (or diagram) This is an oriented graph which allows one to represent all the overlaps of length n 1 in words of length n. This graph is used to ﬁnd some elementary properties of the convergence of asynchronous CA, in particular to determine the set of ﬁxed points of a rule. Elementary cellular automata There are 256 one-dimensional binary rules deﬁned with nearest-neighbor interactions; an update sets a cell state to a value that depends only on its three inputs – its own state and the states of its left and right neighbors. Using the symmetries that exchange 0 s and 1 s and left and right, these rules reduce to 88 equivalence classes. Game of Life This cellular automaton was invented by Conway in 1970. It is probably the most famous rule, and it has been shown that it can simulate a universal Turing machine. The behavior of this rule shows interesting phenomena when it is updated asynchronously. Markov chain A stochastic process that does not keep memory of the past; the next state of the system depends only on the current state of the system. Reversibility When the system always return to its initial condition, we say that it is reversible or, more properly speaking, that it is recurrent. Various interpretations of the notion of reversibility can be given in the context of probabilistic cellular automata. Updating scheme The function that decides which cells are updated at each time step. In this text, we focus on probabilistic updating schemes. Our cellular automata are thus particular cases of probabilistic cellular automata or interacting particle systems.

# Springer Science+Business Media LLC, part of Springer Nature 2018 A. Adamatzky (ed.), Cellular Automata, https://doi.org/10.1007/978-1-4939-8700-9_671 Originally published in R. A. Meyers (ed.), Encyclopedia of Complexity and Systems Science, # Springer Science+Business Media LLC 2018 https://doi.org/10.1007/978-3-642-27737-5_671-2

73

74

Article Outline This text is intended as an introduction to the topic of asynchronous cellular automata and is presented as a path. We start from the simple example of the Game of Life and examine what happens to this model when it is made asynchronous (section “Introduction”). We then formulate our deﬁnitions and objectives to give a mathematical description of our topic (section “Deﬁning Asynchrony in the Cellular Models”). Our journey starts with the examination of the shift rule with fully asynchronous updating, and from this simple example, we will progressively explore more and more rules and gain insights on the behavior of the simplest rules (section “Convergence Properties of Simple Binary Rules”). As we will meet some obstacles in having a full analytical description of the asynchronous behavior of these rules, we will turn our attention to the descriptions offered by statistical physics and more speciﬁcally to the phase transition phenomena that occur in a wide range of rules (section “Phase Transitions Induced by a-Asynchronous Updating”). To ﬁnish this journey, we will discuss the various problems linked to the question of asynchrony (section “Other Questions Related to the Dynamics”) and present some openings for the readers who wish to go further (section “Openings”).

Definition of the Subject This article is mainly concerned with asynchronous cellular automata viewed as discrete dynamical systems. The question is to know, given a local rule, how the cellular automaton evolves if this local rule is applied to only a fraction of the cells. We are mainly interested in stochastic systems, that is, we consider that the updating schemes, the functions which select the cells to be updated, are deﬁned with random variables. Even if there exists a wide range of results obtained with numerical simulations, we focus our discussion on the analytical approaches as we believe that the analytical results, although limited to a small class of rules, can serve as a basis for constructing a more general theory.

Asynchronous Cellular Automata

Naturally, this is a partial view on the topic, and there are other approaches to asynchronous cellular automata. In particular, such systems can be viewed as parallel models of computation (see Th. Worsch’s article in this encyclopedia) or as models of real-life systems. Readers who wish to extend their knowledge may refer to our survey paper for a wider scope on this topic (Fatès 2014a).

Introduction Cellular automata were invented by von Neumann and Ulam in the 1950s to study the problem of making artiﬁcial self-reproducing machines (Moore 1962). In order to imitate the behavior of living organisms, the design of such machines involved the use of a grid where the nodes, called the cells, would evolve according to a simple recursive rule. The model employs a unique rule, which is applied to all the cells simultaneously: this rule represents the “physics” of this abstract universe. The rule is said to be local in the sense that each cell can only see some subset of cells located at short distance: these cells form its neighborhood. In von Neumann’s original construction, all the cells are updated at each time step, and this basis has been adopted in the great majority of the cellular automata constructions. This hypothesis of a perfect parallelism is quite practical as it facilitates the mathematical deﬁnition of the cellular automaton and its description with simple rules or tables. However, it is a matter of debate to know if such a hypothesis can be “realistic.” The intervention of an external agent that updates all the components simultaneously somehow contradicts the locality of the model. One may legitimately raise what we could call the no-chief-conductor objection: “in Nature, there is no global clock to synchronise the transitions of the elements that compose a system, why should there be one in our models?” However, this objection alone cannot discard the validity of the classical synchronous models. Instead, one may simply afﬁrm that the no-chiefconductor objection raises the question of the robustness of cellular automata models. Indeed,

Asynchronous Cellular Automata

at some point, the hypothesis of perfectly synchronous transitions may seem unrealistic, but we cannot know a priori if its use introduces spurious effects. There are some cases where a given behavior of a cellular automaton will only be seen for the synchronous case, and there are also cases where this behavior remains constant when the updating scheme is changed. In essence, without any information on the system, we have no means to tell what are the consequences of choosing one updating scheme or the other. If we have a robust model, changes in the updating may only perturb slightly the global behavior of a system. On the contrary, if this modiﬁcation induces a qualitative change on the dynamics, the model will be called structurally unstable or simply sensitive to the perturbations of its updating Scheme. A central question about cellular automata is thus to know how to assess their degree of robustness to the perturbations of their updating. Naturally, the same questions can be raised about the other hypotheses of the model: the homogeneity of the local rule, the regular topology, the discreteness of states, etc. (see, e.g., Problem 11 in Wolfram (1985)). A First Experiment In order to make things more concrete, we propose to start our examination with a simple asynchronous CA. We will employ the a-asynchronous updating scheme (Fatès and Morvan 2005) and apply the following rule: at each time step, each cell is updated with a probability a and is left in the same state with probability 1 – a. The parameter a is called the synchrony rate (see the formal deﬁnitions below) (Note that from the point of view of a given cell, all happens as if between two updates each cell was waiting a random time that follows a geometric law of parameter a.). The advantage of this deﬁnition is to control the robustness of the model by varying the synchrony rate continuously from the classical synchronous case a = 1 to a small value of a, where most updates will occur sequentially. We thus propose to examine the behavior of the a-asynchronous Game of Life. Figure 1 shows three different evolutions of the rule: the synchronous case (a = 1), an evolution with a little

75

asynchrony (a = 0.98), and an evolution with a stronger asynchrony (a = 0.5). The ﬁrst observation is that the introduction of a small degree of asynchrony does not modify the qualitative behavior of the rule on the short term. However, one can predict that the long-term behavior of the rule will be perturbed because it is no longer possible to observe cycles. For example, the conﬁguration with only three living cells in a row oscillates in the classical Game of life, but these oscillations only exist with a synchronous updating, and the conﬁguration evolves to a totally different pattern when this perfect simultaneity is broken. Another important property to remark is that the new (asynchronous) system has the same ﬁxed points as the original (synchronous) system. In fact, this is a quite general property that does not depend on the local rule. The reason is simple: if a conﬁguration is a ﬁxed point of the synchronous system, it means that all its cells are stable under the application of the local rule. Hence, if we select a subset of cells for an update, this subset will also be stable. Reciprocally, if any choice of cells gives a stable situation, then the whole system is also stable. The second important observation regards the evolution with a = 0.5: the global behavior of the system is completely overwhelmed! A new stationary behavior appears, and a pattern which resembles a labyrinth forms. This pattern is stable in some parts and unstable in some other parts of the grid. We will not enter here into the details on how this stability can be quantiﬁed, but it is sufﬁcient to observe that, in most cases, this pattern remains for a very long time. Questions It may be argued that these observations are not that surprising, because if one modiﬁes the basic deﬁnitions of a dynamical system, one naturally expects to see effects on its behavior. However, this statement is only partially true, as this type of radical modiﬁcations is not observed for all the rules. In fact, as Nakamura has shown, we can always modify a rule in order to make it insensitive to the variations of its updating scheme (Nakamura 1974, 1981). Formally, this amounts to show that any classical deterministic cellular

Asynchronous Cellular Automata

a = 0.50

a = 0.98

a= 1

76

t=0

t = 25

t = 50

t = 75

t = 100

Asynchronous Cellular Automata, Fig. 1 Conﬁgurations obtained with the a-asynchronous Game of Life for three values of the synchrony rate a and the same initial conditions. (Top) Synchronous updating, the system is

stable at t = 50; (middle) small asynchrony introduced, the system is still evolving at t = 100; (bottom) a = 1/2, the qualitative behavior of the system has changed

automaton may be simulated by an asynchronous one. By “simulated” we mean that the knowledge of the evolution of the stochastic asynchronous system allows one to know the evolution of the deterministic original rule with a simple transformation (see Th. Worsch’s article). The idea of Nakamura is that each cell should keep three registers: one with its current state, one with its previous state, and one with a counter that tells if its local time is late, in advance or synchronized with the local time of its neighbors. There is of course an overhead in terms of simulation time and number of states which are used, and one may want to reduce this overhead as much as possible (Lee et al. 2004), but the point is that there are asynchronous rules which will evolve as their synchronous deterministic counterparts. As an extreme example, we can also think of the rule where each cell turns to a given state independently of its neighbor: the global evolution is easily predicted. Partial robustness can also be observed with some simple rules. For example, let us consider the majority rule: cells take the state that is the most present in their neighborhood. Observing

this rule on a two-dimensional grid with periodic boundary conditions shows that it is robust to the variations of a: roughly speaking, if we start from a uniform random initial condition, for 0.5 < a < 1, the system seems to always stabilize quickly on a ﬁxed point. For smaller values of a, the only noticeable effect is a slowdown of the converge time. However, a modiﬁcation also exists at the vicinity of a = 1: like for the Game of Life, as soon as a little asynchrony is present, cycles disappear. These experiments indicate that there is something about asynchronous systems that deserves to be investigated. Since the ﬁrst numerical simulations (Buvel and Ingerson 1984), a great number of approaches have been adopted to gain insights on asynchronous cellular automata. However, if we want to be convinced that these systems can be studied and understood theoretically, and despite their randomness, we need some analytical tools. The purpose of the lines that follow is to give a few indications on how the question of asynchrony in cellular automata can be dealt with theoretical tools from computer science and probability theory.

Asynchronous Cellular Automata

Defining Asynchrony in the Cellular Models Literally, asynchronous is a word derived from the Ancient Greek a᾿sunwronoB, which simply means “not same time”. From this etymology, it follows that we cannot speak of a single model of asynchrony in cellular automata, but there is an inﬁnity of models. In fact, one is allowed to speak of an asynchronous model as soon as there is some perturbation in the updating process of the cells (Note that asynchrony and asynchronism have been both used in the literature in an equivalent way. We will in general use the former for the modiﬁcation of the updating and use the latter to designate a topic of research.).We voluntarily stay vague at this point in order to stress that one may imagine a great variety of situations where some irregularity occurs on the way the information is processed by the cells. For instance, we may examine what happens if all the transitions do occur at each time step but where the cells receive the state of their neighbors imperfectly. In this text, we will restrict our scope to the most simple cases of asynchronous updating.

Mathematical Framework Let ℒ ℤd be the set of cells that compose a d-dimensional cellular automaton. The set of states that each cell may hold is Q. The collection of all states at a given time is called a conﬁguration, and the conﬁguration space is thus Qℒ. k Let N ℤd be the neighborhood of the cellular automaton, that is, for N ¼ ðn1 , . . . , nk Þ, ni represents the vector between the central cell and its ith neighbor. The local function of a cellular automaton is a function f: Qk ! Q which assigns to a cell c ℒ its new state q0 = f (q1,. . ., qk), where the tuple (q1,. . ., qk) represents the state of the neighbors of a cell c. Starting from an initial conﬁguration x Qℒ, the classical evolution of the system gives a sequence of conﬁgurations that we denote by (xt)t ℕ. This sequence is obtained by the recursive application of the global rule F : Qℒ ! Qℒ deﬁned with x0 = x and xt+1 = F (xt) such that:

77

t t ¼ f x , . . . , x 8c ℤ, xtþ1 c cþn1 cþnk : Now, to deﬁne an asynchronous cellular automaton, we need to introduce an updating scheme. Such a function takes the form U : ℒ ! P ðℒÞ, where P ðSÞ denotes the parts of S, that is, the set of all subsets of S (also denoted by 2S). For a given time step t ℕ, the set of cells that are updated at time t is represented by U ðtÞ. We obtain a new global rule, denoted by FU : ℕ Qℒ ! Qℒ where FU ðx, tÞ represents the image of x at time t given the updating scheme U: The evolution of (xt)t ℕ starting from x Qℒ is now deﬁned with x0 = x and xtþ1 ¼ FU ðxt Þ such that: ( f xtcþn1 , . . . , xtcþnk if c U ðtÞ, tþ1 8c ℤ, xc ¼ t otherwise: xc The type of function U deﬁnes the type of asynchronism in use. The ﬁrst issue of distinction is between deterministic and stochastic (or probabilistic) functions. In this text, we will focus on stochastic functions. Indeed, since asynchronism is often thought of as an unpredictable aspect of the system, stochastic systems have been more intensively studied. One ﬁnds only a small number of studies which use deterministic systems. Examples of such studies can be found in Cornforth et al. (2005), Schönﬁsch and de Roos (1999) where the authors have considered, for example, the effects caused by updating cells sequentially from left to right. As one may expect, such approaches often lead to curious phenomena: the information spreads in a nonnatural way because a single sequence of updates from left to right sufﬁces to change the state of the whole system. More interesting are even-odd updating schemes where one updates the even cells and, in the next step, the odd cells. A famous example of such model is the Q2R model (Vichniac 1984): although the local rule of this system is deterministic, using a random initial condition makes it evolve with the same density as the Ising model (see, e.g., Kari and Taati (2015) for a recent development). In fact, we can remark that in general it is not difﬁcult to transform an asynchronous system into

78

Asynchronous Cellular Automata

a synchronous one: in many cases, adding more states is sufﬁcient. For example, for the even-odd updating, we may mark the even and odd cells with a ﬂag up and down, respectively, and make this ﬂag “ﬂip” at each time step. Similarly, an ordered updating may be simulated in a synchronous model by moving a token in a given order. However, such direct transformations are not always possible: for example, Vielhaber has proposed an original way of achieving computation universality by selecting the cells to update (Vielhaber 2013), and this construction cannot be transformed into a deterministic cellular automaton by the mere addition of a few internal states. Randomness in the Updating In the case where the updating scheme U is a random variable, then the evolution of the system is a stochastic process, and if U does not depend on time, it is a Markov chain (a memoryless system). In order to be perfectly rigorous in the formal description of the system, advanced tools from probability theory are necessary. A good example on how to properly use these mathematical objects and their properties can be found in a survey by Mairesse and Marcovici (2014). However, for the sake of simplicity, one may still use the usual notations and consider that the sequences (xt)t ℕ are formed by conﬁgurations rather than probability distributions. We can now deﬁne the two major asynchronous updating schemes: • a-asynchronous updating scheme: let a (0, 1] be constant called the synchrony rate. Let t ℬi i ℒ, t ℕ be a sequence of independent and identically distributed Bernoulli random variables of parameter a. The evolution of the system with an a-asynchronous updating scheme is then given by: x0 ¼ x and 8i ℤ, xtþ1 i ( f xtiþn1 , . . . , xtiþnk ¼ xtc

if ℬti ¼ 1, otherwise:

• Fully asynchronous updating scheme: in the case where ℒ is ﬁnite, let (St)t ℕ be a sequence

of independent and identically distributed random variables that select an element uniformly in ℒ. The evolution of the system is given by: x0 ¼ x and 8i ℤ, xtþ1 i ( f xtiþn1 , . . . , xtiþnk ¼ xtc

if i ¼ St , otherwise:

Note that in most authors do not use the cases, indices i and t for ℬti or (St) and simply consider that there is one function that is used at each time step and for each cell. We do not enter here into the details of how we can generalize these deﬁnitions (see, e.g., Dennunzio et al. (2013)). We point the work of Bouré et al. on asynchronous lattice-gas cellular automata to underline that adding asynchrony to the cellular models which have more structure than the classical ones can be a nontrivial operation if one wants to maintain the properties of these models (e.g., conservation of the number of particles) (Bouré et al. 2013a). Similar difﬁculties arise when agents can move on the cellular grid, and one needs to deﬁne some procedures to solve the conﬂicts that may occur when several agents want to modify simultaneously the same cell (Belgacem and Fatès 2012; Chevrier and Fatès 2010).

Convergence Properties of Simple Binary Rules We have seen that a central question in the study of asynchronous cellular automata was to determine their convergence properties. In particular one may wonder, given a simple binary rule, what we can predict about its possible behavior. Is it converging to a given ﬁxed point? In which time in average? And if so, what kind of “trajectory” the system will follow to attain a stable state (if any)? The lines that follow aim at presenting the mathematical tools to answer these questions. Expected Convergence Time to a Fixed Point Recall that one major modiﬁcation caused by the transformation of a cellular automaton from

Asynchronous Cellular Automata

synchronous to asynchronous updating is the removal of cycles: cycles are replaced by some attractive sets of conﬁgurations (see below for a more precise description). Let us examine this property on a simple case. We work on a ﬁnite one-dimensional system and denote the set of cells by ℒ = ℤ/nℤ, where n is the number of cells. We employ a fully asynchronous updating scheme described by a sequence of independent and identically distributed random variables (St) which are uniform on ℒ (one cell is selected at each time step). The local rule depends only on the state of the cell itself and its left and right neighbors; we have N = {1, 0, 1}. Recall that for an initial condition x Qℒ, the evolution of the system is thus described by (xt)t ℕ such that 0 xt+1 = F (xt) such that 8i ℒ, xtþ1 ¼f i x t= x and xi1 , xti , xtiþ1 if i = St and xtþ1 ¼ xti otherwise. i To evaluate the converge time of given rule, we proceed as in the theory of computation and deﬁne the “time complexity” of this rule as the function which estimates the amount of time taken by the “most expensive” computation of size n (see Th. Worsch’s article in this encyclopedia). Let F denote the set of ﬁxed points of a rule, and let T (x) denote the random variable which represents the time needed to attain a ﬁxed point: T (x) = {min t: xt F }. In order to have a fair comparison with the synchronous update, we consider that one time step corresponds to n updates, and we introduce the rescaled time t (x) = T (x)/n. The “complexity measure” of a rule is then given by the worst expected convergence time (WECT): W ECT ðnÞ ¼ max ftðxÞg; x Qℒ . Two Notations for ECAs Following a convention introduced by Wolfram, it is common to identify each ECA f with a decimal code W ( f ) which consists in converting the sequence of bits formed by the values of f to a decimal number: W ( f ) = f(0, 0, 0).20 + f(0, 0, 1).21 + + f(1, 1, 1).27. We now introduce another notation of ECA rules, which consists in identifying an ECA rule f with a word which consists in a collection of labels from {A, B,. . ., H} where each label identiﬁes an active transition, that is, a couple ((x, y, z), f(x, y, z)) such that f(x, y, z) ¼ 6 y.

79 Asynchronous Cellular Automata, Table 1 Notation by transitions. Left, table of transitions and their associated labels. Right, symmetries of the ECA space (see text for explanations) A 000 010 E

B 001 011 F

C 100 110 G

D 101 111 H

The mapping between labels and transition is given in Table 1. reflexion

A B C D 000 001 100 101 010 011 110 111 E F G H

A

C

B

D conjugation

E

F

r+c

G

H

For example, let us consider the XOR rule L L L f(x, y, z) = x y z, where denotes the usual XOR operator. The decimal code associated to this rule is 150. The active transitions of this rule are 001 ! 1 (B), 100 ! 1 (C), 011 ! 0 (F), and 110 ! 0 (G). The four other transitions are passive, that is, they do not change the state of the central cell. We thus obtain the new code: BCFG. Given the transition code of a rule, one can easily deduce the symmetric rules: to obtain the rule where the left and right directions are permuted, it is sufﬁcient to exchange the letters B and C and to obtain the symmetric rule where the states 0 and 1 are permuted, on exchanges the letters A and E, B and F, C and G and H (see Table 2, right). In the case of a fully asynchronous updating, the notation by transitions also allows us to decompose the behavior of the local rule as follows: • If a rule does not have A (resp. H) in its code, the size of a 0-region (resp. a 1-region) may increase or decrease by 1, but this region cannot be broken. • Transitions B and F control the movements of the 01-frontiers: B (resp. F) moves this frontier to the left (resp. to the right). If both transitions are present, the 01-frontier performs a nonbiased random walk. • Similarly, transitions C and G control the movements of the 10-frontiers.

80

Asynchronous Cellular Automata

Asynchronous Cellular Automata, Table 2 Left, summary of the effect of each transition on a fully asynchronous ECA. Right, summary of the combinations of two (active or inactive) transitions A B C D E F G H

Stability of 0-regions B 01-frontiers move left 10-frontiers move right Absorption of 0-regions Absorption of 1-regions 01-frontiers move right 10-frontiers move left Stability of 1-regions

No A+ no H doubly quiescent rule

B+ F random walk of the 01-frontiers

C + G random walk of the 10-frontiers

• Transition D (resp. E) controls the fusion of 1-regions (resp. 0-regions): the absence of D (resp. E) implies that the 0-regions (resp. 1-regions) cannot disappear. These properties are summed up on Table 2, left. In addition, the code by transitions can be used to produce a complementary useful view on conﬁgurations by transforming a conﬁguration x Qℒ in a conﬁguration x~ fa, . . . , hgℒ , where each cell is labeled with a, b, . . . if the transition A, B, . . . applies on it. An example of such transformation is shown in Fig. 2, left. This transformation can be done directly, but it is also interesting to consider the de Bruijn graph (or diagram), which allows one to do this transformation by reading one symbol at a time, from left to right, and by following the edge with the label that was read (see Fig. 2, right). This graph is useful for determining various properties of cellular automata. For example, the ﬁxed points of rule are made by the cycles which do not contain a node with an active transition. For any conﬁguration x, if we write by a, b, . . . the respective number of a’s, b’s, . . . of x~ , then the following relations can be easily obtained: b = c; f = g; |x|01 = b + d = e + f; |x|10 = c + d = e + g; |x|01 = |x|10.

A Starting Example

Let us take the shift rule f(x, y, z) = z as a ﬁrst example of ECA. The Wolfram code and the transition code of this rule are 150:BCFG. As it can be seen from the space-time diagrams shown in Fig. 3, although the local rule is elementary, the evolution of the system is quite puzzling at ﬁrst sight. The diagrams show that, starting from the same initial condition, the system may reach either the ﬁxed point 0 = 0ℒ or the ﬁxed point 1 = 1ℒ and that the convergence time is subject to a high variability. A little close-up on the behavior of the rule allows us to discover that the number of regions of 0 s or 1 s can only decrease. Indeed, it is impossible to create a new state inside a region of homogeneous state. More precisely, a change of state can only occur on the boundaries between regions: if such a boundary is updated, it moves one cell to the left. Let us examine what happens for an initial condition x Qℒ with only two regions: we have |x|01 = 1, where |x|01 is the function which counts the number of occurrences of the pattern 01 in x. To calculate the probability to reach a given ﬁxed point, we introduce the stochastic process (Xt) which counts the number of 1’s in a conﬁguration: Xt = |xt|1, where |x|1 is the function which counts the number of occurrences of 1’s. It can easily be veriﬁed that (Xt) is a Markov chain whose graph is shown in Fig. 4. Note that this is not immediate and this property is not true for any initial condition. The values Xt = 0 and Xt = n are the absorbing states of the Markov chain and represent the convergence of the asynchronous cellular automaton to its respective ﬁxed points 0 and 1. We can thus calculate the probability p1(k) to reach the ﬁxed point 1 given an initial condition x such that |x|1 = k. This can be done by recurrence by noting that p(0) = 0, p(n) = 1, and p(k) = ϵp(k 1) + (1 2ϵ)p(k) + ϵp(k + 1), where ϵ = 1/n is the probability to update a cell. The solution is p(i) = ϵi = i/n. In other words, the probability to reach the ﬁxed point 1 is exactly the density of the initial conﬁguration. Let us now estimate the average number of time steps that it will take to reach one of the two ﬁxed points. Recall thatT(x) = min {t ℕ : xt {0, 1}}.

Asynchronous Cellular Automata

81

1

b 001

0011001111100 abfgcbfhhhgca ↑ 0011001011100 abfgcbedfhgca

0

1 0

e 010

1

0

0

0 c 100

1

1

1

a 000

f 011

0

d 101

1

0

1 0

h 111

g 110

Asynchronous Cellular Automata, Fig. 2 (left): Example of two binary conﬁgurations and their images by the transition code. The upper conﬁguration is obtained by updating the lower conﬁguration on the cell indicated with an arrow. (Right) De Bruijn graph with the

correspondence between binary sequences of length 3 and transitions A, . . ., H. The label on the edges shows the next letter that is given in input when reading a binary sequence from left to right

Asynchronous Cellular Automata, Fig. 3 Space-time diagrams showing the evolution of the shift rule for a ring of n cells, with n = 20. Cells in blue and white, respectively, represent states 0 and 1. Time goes from

bottom to top. Each row shows the state of the system after n random updates. This convention is kept in the following

As the Markov chain is ﬁnite and has two absorbing states, T is almost surely ﬁnite. The average of T depends only on the number of 1 s of the initial condition. With a small abuse of notation, we can denote by Ti the average convergence time from an initial condition with i cells in state 1; we have the following recurrence equation: T0 = Tn = 0 and 8i {1,. . ., n 1},

T i ¼ eðT i1 þ 1Þ þ ð1 2eÞðT i þ 1Þ þ eðT i1 þ 1Þ

(1)

¼ 1 þ eT i1 ð1 2eÞT i þ eT iþ1

(2)

The solution of this system is Ti = i(n i)/2e. Since e = 1/n, we can write 8i {0,. . ., n},

82

Asynchronous Cellular Automata

Ti n3/8; in other words, for the conﬁgurations with only two zones, the average number of updates needed to attain a ﬁxed point is at most cubic in n. Martingales

How can we deal with the other conﬁgurations? If we start from a conﬁguration x with k 1-regions and k > 1, the probability to increase or decrease by 1 the number of 1 s is kϵ. The evolution of the system can no longer be described by the Markov chain in Fig. 4. Indeed, the value ϵ needs to be replaced by ϵ 0 = kϵ, but, as k is not constant, this process is no longer a Markov chain. As seen in Fig. 4, the frontiers of the regions will perform random walks until a region disappears, which will make ϵ 0 decrease again and so on until we reach one of the two ﬁxed points. In order to determine the convergence time t (x), one could estimate the average “living time” of a conﬁguration with k-regions. However, this is a difﬁcult problem because this living time strongly depends on the size of each region. It is easier to note that the process (Xt) deﬁned with Xt = |xt|1 is a martingale, that is, a stochastic process whose average value is constant over time. The theory of martingales allows us to ﬁnd the probability p1(x) to reach the ﬁxed point 1 from x and the average time of convergence ftðxÞg. For the sake of brevity, we skip the details of the mathematical treatments and write down directly the results that are exposed in Fatès et al. (2006a): (a) the probability of reaching the ﬁxed point 1 is still equal to the initial density, p1(x) = |x|1/n, and (b) the rescaled average time also scales quadratically with n : ftðxÞg jxj1 n jxj1 =2.

ε 0

1 ε

1

ε 1−2ε

ε

ε 2

n−1

n

1−2ε

1

ε 1−2ε

Asynchronous Cellular Automata, Fig. 4 Representation of the Markov chain that counts the number of 1 s. The constant ϵ = 1/n represents the probability to update a cell at a given time step

We thus have an upper bound on the WECT which is WECT (n) n2/8, and, considering the initial condition x = 0n/21n/2, we obtain the lower bound WECT (n) n2/8. We can thus write WECT (n) = O(n2) where O expresses the equivalence up to a constant. We thus say that the shift has a quadratic convergence time or, for short, that it is quadratic. A Relationship with Computational Problems

In fact, since the convergence of the asynchronous shift depends on the initial density, one may consider this process as a particular kind of decentralized computation. For the sake of brevity, we will not develop this point here, but we simply indicate to the readers interested by this issue that similar stochastic rules have been used to solve the density classiﬁcation problem (see, e.g., (de Oliveira 2014; Fatès 2013b; Fukś 2002) and de Oliveira’s article in this encyclopedia). From the Shift to Other Quadratic Rules We now examine step by step how to generalize the example of the asynchronous shift given above to a wider class of rules. With the decomposition described above, we can readily deduce that the Markov chain described for counting the number of 1 s for the shift rule (BDEG) also applies for rule CG, for which the 10-frontier performs a non-biased random walk and for rule BCDEFG, for which the two frontiers perform a random walk. In a second time, we can ask what happens if we change the code of these rules by removing the transition D of their code, that is, we set 101 ! 0 and make the transition D inactive. This transformation implies that the 0-regions can no longer disappear, while the 1-regions may disappear if an isolated 1 is updated (010 ! 0). As a consequence, the ﬁxed point 1 is no longer reachable, and the system will almost surely converge to the ﬁxed point 0 for an initial condition different from 1. The system will thus most of the time behave as a regular martingale, but sometimes it will “bounce” on an isolated 0. Is the average convergence time still quadratic? The answer is positive: even

Asynchronous Cellular Automata

83

though the behavior cannot be described (simply) by a martingale, it is possible to “save” the previous results and still obtain a quadratic scaling of the WECT. Interested readers may refer to our study on fully asynchronous doubly quiescent (A quiescent state is a state q such that the local rule f obeys f(q,. . ., q) = q.) rules for the mathematical details (Fatès et al. 2006a). Functions with a Potential In the previous paragraph, we started from the shift rule (BDEG), showed that it had a quadratic WECT, an then indicated that ﬁve other rules had a similar qualitative behavior and a quadratic WECT. The other rules were obtained by making the transition D inactive or by changing the behavior of the frontiers, as long as this movement remained a non-biased random walk (Fig. 5). We now propose to examine what happens if we dare to “touch” a transition that breaks the random movement of the frontiers. Concretely, let us make the transition B inactive: we obtain the minimal representative rule DEG (168). The evolution of this rule is displayed in Fig. 6; it can be seen that the evolution of the rule is less

CDEG 184

CEG 152

“spectacular” than the quadratic rules. The size of the 1-regions regularly decreases until all the regions disappear and the system reaches the ﬁxed point 0. It is easy to see that in the case where the initial condition does not contain an isolated 0, the evolution of the number of 1 s is a non-increasing function. Now, let us consider the function f : Qℒ ! ℕ deﬁned by f(x) = |x|1 + |x|01. Writing (Xt) = f(xt), one can verify that the evolution of (Xt) is non-increasing. Indeed, if a transition D is applied, the number of 1 s increases by 1, but the number of regions also decreases by 1. Moreover, we have that Xt = 0 implies that xt = 0. The function f can thus be named a potential: it is a positive, non-increasing function of the current state of the system, which equals to zero when the system has attained its attractive ﬁxed point. This argument can be applied for showing a linear WECT for the following four rules (G is active) 136:EG, 140:G, 168:DEG, and 172:DG and the following four rules (F and G are active) 128: EFG, 132:FG, 160:DEFG, and 164:DFG. Interestingly, a similar type of convergence can also be obtained by adding an active transition to the shift rule. For example, let us consider ECA BDEFG (162). Its evolution is shown in Fig. 6. One should observe that the 01-frontiers perform

BCDEFG 178

BCEFG 146

Asynchronous Cellular Automata, Fig. 5 Space-time diagrams showing the evolution of four rules with a quadratic worse expected convergence time (WECT).

84

Asynchronous Cellular Automata

DEG 168

DEG 168

BDEFG 162

BDEFG 162

Asynchronous Cellular Automata, Fig. 6 Space-time diagrams showing two evolutions of two rules with a linear worse expected convergence time (WECT)

a non-biased random walk, while the 10-frontier tends to move to the left. This means that the 1-regions have a tendency to decrease, but their evolution is no longer monotonous as in the case of rule DEG. It can be shown that if we take back the function f(x) = |x|1 + |x|01 and Xt = f(xt), then (Xt) is a super-martingale, that is, its average value decreases in average. This property and other conditions ensuring that it cannot stay too “static” imply that its convergence time scales linearly with the ring size n (Fatès et al. 2006a). Indeed, for any conﬁguration that is not a ﬁxed point, the quantity Xtþ1 Xt jxt is negative. The same method can be applied for showing the convergence in linear time for the rule 130: BEFG. Non-polynomial Types of Convergence.

For the sake of brevity, we will not go here into the details but only indicate the other classes of convergence that were exhibited. Readers may consult Fatès et al. (2006a) for detailed arguments. • The rules 200:E and 232:DE have a logarithmic WECT. This can be shown with the same techniques as for the convergence of the coupon-collector process (Fatès et al. 2006a). • The rule 154:BCEG has an exponential WECT. This comes from a kind of paradox: the rule has a tendency to increase the number of 1 s, but its only ﬁxed point 1 is not reachable. The only way it can converge is by reaching the ﬁxed point 0, a phenomenon that is very unlikely.

• The rules 134:BFG, 142:BG, 156:CG, and 150:BCFG are non-converging. This is because in all these rules, transitions D and E are inactive and, at the same time, the frontiers are not static. Other Elementary Rules

The question of classifying the other ECA rules, where no state or only one state is quiescent, is still open. Some conjectures have been stated from experimental observations, but they still deserve an in-depth analysis (Fatès 2013a). In particular, there are currently only partial results for all the rules which are conjectured to converge “very rapidly,” that is, in logarithmic time (Fatès 2014b). From Fully Asynchronous to a-Asynchronous Updating What happens if one uses a partially synchronous updating scheme instead of a totally asynchronous one? Regnault et al. have extended the convergence results of the doubly quiescent ECA to the case of a-asynchronous updating (Fatès et al. 2006b). The possibility of having simultaneous updates of neighboring cells creates additional “local movements,” and the behavior of these rules is more difﬁcult to analyze. In particular, the authors have identiﬁed four phenomena that are speciﬁcally related to the a-asynchronous updating: the shift, the fork, the spawn, and the annihilation. These phenomena are shown in Fig. 7. The authors developed an interesting analytical framework (potential functions, masks, etc.) and

Asynchronous Cellular Automata

85

t +1 t shift

fork

spawn

annihilation

Asynchronous Cellular Automata, Fig. 7 New phenomena observed with the a-asynchronous updating of linear CA (From the work of Fatès et al. (2006b))

succeeded in giving bounds on the convergence of 19 (minimal) doubly quiescent rules, leaving the question open for ﬁve other rules. The various rules show different kinds of scaling relations of the WECT, depending on a and n. If we consider the dependence on n only, the families of functions are the same as those obtained for fully asynchronous dynamics, that is, logarithmic, linear, quadratic, exponential, and inﬁnite. However, there are rules whose type of converge varies from the fully asynchronous updating to a-asynchronous updating. For example, rule 152:CEG, which is quadratic with a fully asynchronous updating (see above), becomes linear for a-asynchronous updating. Two rules, namely, ECA 146:BCEFG and 178:BCDEFG, were conjectured to display a phase transition: their type of converge may change from polynomial to exponential depending on whether the a is greater or lower than a particular critical value. This property was partially proved by Regnault in a thorough study of ECA 178, where the polynomial and exponential convergence times were formally obtained for extrema values of the synchrony rate (Regnault 2013). Ramos and Leite recently studied a generalization of this model where the asynchronous case appears as a special case of the family of probabilistic cellular automata that are studied (Ramos and Leite 2017). Two-Dimensional Rules The study of the convergence properties of simple two-dimensional rules has been carried out for the so-called totalistic cellular automata, where the local rule only depends on the number of 1 s in the neighborhood (Fatès and Gerin 2009). For the von Neumann neighborhood (the cell and its four nearest neighbors), there are 26 such rules. Their WECT were also analyzed for the fully asynchronous updating, and all rules but one was found to fall into the previous classes of convergence. One

remarkable exception was given by the epidemic rule, where a 0 turns into a 1 if it has a 1 in its neighborhood and then will always remain a 1. This pﬃﬃﬃ rule has a WECT which scales as Yð nÞ: Even though this scaling property can be intuitively understood from the dynamics of the rule, which merely amounts to “contaminating” neighboring cells, proving the class of convergence was a difﬁcult task. It is only recently that a proof has been proposed by Gerin, who succeeded in applying subtle combinatorial arguments to obtain upper and lower bounds on the time of convergence (Gerin 2017). The minority rule received a special attention. Indeed, when updated asynchronously, it has the ability to create patterns which can take the form of checkerboard or stripes. The behavior of this rule with an asynchronous updating was analyzed in the case of von Neumann and Moore neighborhood (the cell and its eight nearest neighbors) (Regnault et al. 2009, 2010). Regnault et al. noticed that the convergence to the ﬁxed point was not uniform: the process can be separated in two phases – ﬁrst the “energy” decreases rapidly, and then the system stays in a low-energy state where it will progressively approach the ﬁxed point by moving the unstable patterns, thanks to the random ﬂuctuations. It is an open question to know to which extent this type of behavior can be found in other contexts, e.g., lattice-gas cellular automata (Bouré et al. 2013b). The convergence properties can thus be determined quite precisely but only for a family of simple binary cellular automata rules. It is an open problem to ﬁnd such analytical tools. As far as the a-asynchronous updating is concerned, the results are even more restricted. As we will see in the following, this is not so surprising because the behavior of some rules sometimes requires the introduction of tools from advanced statistical physics.

86

Asynchronous Cellular Automata

Phase Transitions Induced by a-Asynchronous Updating The Game of Life We propose to come back to the phenomenon observed in Fig. 1 (see p. 4). Blok and Bergersen were the ﬁrst authors to give a precise explanation of the change of behavior in the Game of Life, the phenomenon that was described in the introductory part of this article. They identiﬁed the existence of a second-order phase transition (Informally, in statistical physics, phase transitions are deﬁned by the existence of a discontinuity in the values taken by a macroscopic parameter, called the order parameter, when system is submitted to a continuous variation of a control parameter. First-order transitions are those for which the discontinuity appears directly on the order parameter, while second-order phase transitions (or continuous phase transitions) are those where the derivative of the order parameter is inﬁnite.) which separates two qualitatively different behaviors: a high-density steady state with vertical and horizontal stripes and low-density steady state with avalanches (Blok and Bergersen 1999). They measured the critical value of the synchrony rate at ac 0.906 and showed that near the critical point, the stationary density d1 obeyed a power law of the form d1 (a ac)b. It is well known in the ﬁeld of statistical physics that the values taken by the power laws are not arbitrary and that various systems of unrelated ﬁelds may display the same critical exponents (see F. Bagnoli’s article in this encyclopedia). The class of systems which share the same values of exponents is called a universality class, and in the case of the Game of Life, Blok and Bergersen found that its phase transition was likely to belong to the universality class of directed percolation (also called oriented percolation or Reggeon ﬁeld theory). These measures were later conﬁrmed by a set of more precise experiments (Fatès 2010), and the critical value of the synchrony rate was measured

at ac 0.911. Moreover, for the Game of Life, the critical phenomenon was shown to be robust to the introduction of a small degree of irregularity in the grid. This phase transition was also observed for other lifelike rules (Fatès 2010). Elementary Cellular Automata In the ﬁrst experiment where the whole set of ECAs was examined with an a-asynchronous updating (Fatès and Morvan 2005), some rules were observed to display an abrupt variation of the density for a given value of the synchrony rate a. This phenomenon was later studied in detail, and this critical phenomenon was identiﬁed for ten (non-equivalent) rules. As for the Game of Life, we are here in the presence of second-order phase transitions which belong to the directed percolation universality class (Fatès 2009). The values of the measured critical synchrony rates are reported in Table 3. It is a puzzling question to know why these ten rules are speciﬁcally producing such critical phenomena. Some insights to this question were given in a study of the local-structure approximations of the rules, that is, a generalization of the mean-ﬁeld approximation to correlations of higher order (Fukś and Fatès 2015). This study revealed that it was possible to predict the occurrence of a phase transition, but it was not possible to use it to correctly approximate the value of the critical synchrony rate (Fig. 8). Another possible approach would be to analyze the branching-annihilating phenomenon in a speciﬁc way, with small-size Markov chains, for instance, but this remains an open path of research.

Other Questions Related to the Dynamics In order to broaden our view of asynchronous cellular automata, we now brieﬂy mention some other problems which have been studied with analytical tools.

Asynchronous Cellular Automata, Table 3 Critical synchrony rates for the ECA with a phase transition ECA ac

6 0.283

18 0.714

26 0.475

38 0.041

50 0.628

58 0.340

106 0.815

134 0.082

146 0.675

178 0.410

0.5 0.45 0.4 0.35 0.3 0.25 0.2 0.15 0.1 0.05 0 0.1

87

ECA 6

P(1)

P(1)

Asynchronous Cellular Automata

0.2

0.3

0.4

0.5

0.6

0.7

0.8

0.9

0.5 0.45 0.4 0.35 0.3 0.25 0.2 0.15 0.1 0.05 0 0.1

ECA 50

0.2

0.3

0.4

α

0.7

0.8

0.9

plots legend

0.3

k=2 k=3 k=4 k=5 k=6 k=9 exp

0.25

P(1)

0.6

α

ECA 146

0.35

0.2 0.15 0.1 0.05 0 0.1

0.5

0.2

0.3

0.4

0.5

0.6

0.7

0.8

0.9

α Asynchronous Cellular Automata, Fig. 8 Local structure approximations obtained for various approximation levels of order k (see Fukś and Fatès (2015) for details). For the sake of readability of the results, the cases k = 7 and

k = 8 are omitted. The plot in red (labelled “exp”) shows the experimental steady-state density obtained for a ring size of n = 40,000 cells after 10,000 time steps

Reversibility The question of reversibility amounts to knowing if it is always possible to “go back in time” and to knowing if any conﬁguration has a unique predecessor. This question is undecidable in general, but there are some sets of rules for which one can tell whether a rule is reversible or not (see Morita (2008) for a survey on this question). In the context of random asynchronous updating, the question cannot be transposed in a direct way because the evolution of the system is not one to one (otherwise we would have a deterministic system). To date, two different approaches have been considered for ﬁnite systems. Wacker and Worsch proposed to examine the transition graph of the Markov chain of the asynchronous system (Wacker and Worsch 2013). A rule is said to be phase-space invertible if there exists another rule – possibly itself – whose transition graph is

the “inverse” of the graph of the original rule. By “inverse” it is meant that the directions of the transitions are reversed. In other words, the probabilities to go from x to y are identical if one permutes x and y. Interestingly, the authors show that the property of being phase-space invertible is decidable for one-dimensional fully asynchronous cellular automata. Another approach has been proposed by Sethi et al.: to interpret the reversibility of a system as the possibility to always go back to the initial condition (Sethi et al. 2014). The problem then amounts to deciding the recurrence property of the Markov chain. This allows the authors to propose a partition of the elementary cellular automata according to their recurrence properties and to show that among the 88 non-equivalent rules, there are 16 rules which are recurrent for any ring size greater than 2 and 2 rules which are recurrent for ring sizes greater than 3 (Fatès et al.

88

Asynchronous Cellular Automata

Asynchronous Cellular Automata, Table 4 Wolfram codes and transition codes of the 16 recurrent rules (From Fatès et al. (2017)). The two separate rules are recurrent for n 6¼ 3 35: ABDEFGH 51: ABCDEFGH 62:BCDGH 142:BG 33:ADEFGH

38:BDFGH

43:ABDEGH 46:BDGH

54:BCDFGH 57:ACDEGH 60:CDGH 105:ADEH 150:BCFG 41:ADEGH

108:DH 156:CG

134:BFG 204:I

2017). These rules are listed in Table 4. For the recurrent rules, the structure of the transition graph was analyzed as well as the number of connected components of this graph, that is, the number of communication classes of the rules. It was found that the number of classes of communication varies greatly from one rule to another: some rules have an exponential number, while others have a constant number; the most interesting examples were obtained for the rules with an “intermediary” behavior. For example, for rule 105:ADEH, the number of communication classes is 2 for an odd ring size n and is equal to n/ 2 + 3 when n is divisible by 4 and to n/2 when n is even and not a multiple of 4. It is an open question to generalize these results to other types of rules or to other types of updating schemes. These results are encouraging, and it is rather pleasant to note that contrarily to the problem of convergence seen above, deciding the recurrence properties of an ECA can be achieved. It is thus interesting to see to which extent these results apply to a broader class of systems, including inﬁnite-size systems. Coalescence In the experimental study of the a-asynchronous ECA (Fatès and Morvan 2005), a strange phenomenon was noticed for ECA 46, almost by chance: though this rule does not converge to a ﬁxed point and remains in a chaotic-like steady state, its evolution does not seem to depend on the initial condition. All seems to happen as if the evolution of the rule was only dictated by the sequence of updates that is applied. This phenomenon, named coalescence, can be observed in

Fig. 9: if we start from two different initial conditions of the same size and apply the same updates on the two systems, they quickly synchronize and adopt the same evolution. This is a particular kind of synchronization where no desynchronization is possible: after the coalescence has occurred, the two trajectories remain identical as the local rules are deterministic. The question is to know under which conditions coalescence happens and how long does it take in average for two different initial conditions to “merge” their trajectories. Rouquier and Morvan have studied experimentally this phenomenon for the 88 ECA with a-asynchronous updating (Rouquier and Morvan 2009). They discovered an unexpected richness of behavior: some rules coalesce rapidly and others slowly, some never coalesce, some even display phase transitions, etc. Insights have been given by Francès de Mas on this question, and a classiﬁcation of the convergence time has been given from both the observation of space-time diagrams and an analysis of the behavior (de Mas 2017). It is still an open question to provide a complete mathematical analysis of these systems and to issue a proof that coalescence can indeed happen in a linear time with respect to the ring size. Other Problems There are many other problems which have led to various interesting experimental or theoretical works. For instance, Gacs (2001) and then MacAuley and Mortveit (2010, 2013; Macauley et al. 2008) have provided a deep analysis on the independence of the trajectories of an asynchronous with regard to the updating sequence. Chassaing and Gerin analyzed the scaling relationships that would lead to an inﬁnite-size continuous framework (Chassaing and Gerin 2007). This framework is also analyzed in detail by Dennunzio et al., who examined how the theory of measure can be applied to one-dimensional systems deﬁned on an inﬁnite line (Dennunzio et al. 2013, 2017). As an example of a possible application of the use of these dynamical systems, we mention the work of Das et al., who proposed to use such models for pattern classiﬁcation (Sethi et al. 2016), and the work of Takada et al., who designed asynchronous self-reproducing loops (Takada

Asynchronous Cellular Automata

et al. 2007a). These are only some entry point to the literature on this topic, and we refer again to our survey paper for a wider scope (Fatès 2014a).

Openings We have seen that the randomness involved in the asynchronous updating create an amazing source of new questions on cellular automata. After more than two decades of continued efforts, this topic shows signs of maturity, and although it remains in large part a terra incognita, there are some insights on how asynchronous cellular automata can be studied with a theoretical point of view. A set of analytical tools are now available, and when the analysis fails to answer all the questions, one can carry out numerical simulations. Readers should now be convinced that asynchronous cellular automata are by no means some “exotic” mathematical objects but constitute a thriving ﬁeld of research. The elements we presented here are only a small part of this ﬁeld and should be completed by a more extensive bibliographical work. Before closing this text, we want to present a few questions that are currently investigated.

89

has led to propose the use of some measuretheoretic tools to deﬁne m-asynchronous cellular automata to include the cases of nonhomogeneous probabilities of updating, inﬁnitesimal ones, etc. (Dennunzio et al. 2012, 2013). To complete this point, let us underline that Bouré et al. have proposed to examine the case where the randomness occurs not on the moments of updating but on the possibility to miss the information from one or several neighbors (Bouré et al. 2012). Interestingly, the study of these new updating schemes, named b- and g-asynchronous updating schemes, shows that their behavior partially overlaps with a-asynchronous systems but also reveals some novel and unexpected behaviors (e.g., other rules show a phase transitions).

Defining Asynchrony As mentioned in the introduction, asynchrony is a concept that can be deﬁned with a great variety of forms. For example, the notion of a-asynchronous updating scheme needs to be generalized to go beyond the simple homogeneous ﬁnite case. This

Asynchronous Models The theoretical results obtained so far do not tell us what is a good model of asynchrony in general. Since cellular automata are deﬁned with a discrete of time and space, it is not straightforward to decide a priori to use a synchronous updating, or a fully asynchronous one, or a partially synchronous one. In fact, the most reasonable position would be to test various updating schemes on a rule and to examine if it is robust or sensitive to these modiﬁcations. Although this critical attitude has been quite rare so far, a good example of such a study has been provided by Grilo and Correia, who made a systematic study of the effects of the updating in the spatially extended

Asynchronous Cellular Automata, Fig. 9 Rapid coalescence phenomenon for ECA 46 with fully asynchronous updating. The same updates are applied on two systems with two different random initial conditions (left and

middle). The right diagram shows the agreement and disagreement of the two systems. Cells in white and light gray, respectively, show agreement on state 0 or 1, while red and green show disagreement (the order is not important)

90

Asynchronous Cellular Automata

evolutionary games. This question rose after the criticisms made by Huberman and Glance (1993) to the model proposed by Nowak and May (1992). We think that exploring more systematically these issues on real-world models could help us understand to which extent the simpliﬁcations operated in a model are justiﬁed or are a potential source of artifacts (see Fatès (2014a) for other examples).

asynchronous computations (Lee et al. 2016b; Peper et al. 2010). They represent a potential source of major technical innovations, in particular with the possibility of implementing such circuits with DNA reaction-diffusion systems (Yamashita et al. 2017) or single electron tunneling techniques (Lee et al. 2016a).

Experimental Approaches and Theoretical Questions The questions of how to measure the behavior of asynchronous systems are of course primordial. Among the various approaches, let us mention that Silva and Correia have shown the importance of taking into account the time-rescaling effects when using experiments (Silva and Correia 2013). Louis has underlined that the efﬁciency of a simulation may greatly vary depending on the different regimes that may occur in a simulation (Louis 2015). Recently, Bolt et al. have raised the problem of identiﬁcation: if one is given space-time diagrams with missing parts, how can one ﬁnd the rule which generated this piece of information? (Bolt et al. 2016). (See also A. Adamatzky’s article in this encyclopedia for the general problem of identiﬁcation.)

Cross-References

New Models of Computation As mentioned earlier, it is no surprise if the computing abilities of general asynchronous cellular automata are the same as those of their deterministic counterparts. However, as shown by various authors, the question becomes much more delicate if one asks how to simulate an asynchronous system by another asynchronous system or if one wants to design asynchronous systems which hold good computing abilities and use a limited number of states (Takada et al. 2007b; Worsch 2013). On the technological side, let us mention the work of Silva et al. on modeling the interactions between (static) robots which need to be synchronized (Silva et al. 2015). Lee, Peper, and their collaborators aimed at developing asynchronous circuits which are designed with simple local rules (Peper et al. 2003). Such Brownian cellular automata (Lee and Peper 2008) exploit the inherent ﬂuctuations of the particles to perform

▶ Cellular Automata as Models of Parallel Computation ▶ Identiﬁcation of Cellular Automata

Bibliography Belgacem S, Fatès N (2012) Robustness of multi-agent models: the example of collaboration between turmites with synchronous and asynchronous updating. Complex Syst 21(3):165–182 Blok HJ, Bergersen B (1999) Synchronous versus asynchronous updating in the “game of life”. Phys Rev E 59:3876–3879 Bolt W, Wolnik B, Baetens JM, De Baets B (2016) On the identiﬁcation of a-asynchronous cellular automata in the case of partial observations with spatially separated gaps. In: De Tré G, Grzegorzewski P, Kacprzyk J, Owsinski JW, Penczek W, Zadrozny S (eds) Challenging problems and solutions in intelligent systems. Springer, pp 23–36 Bouré O, Fatès N, Chevrier V (2012) Probing robustness of cellular automata through variations of asynchronous updating. Nat Comput 11:553–564 Bouré O, Fatès N, Chevrier V (2013a) First steps on asynchronous lattice-gas models with an application to a swarming rule. Nat Comput 12(4):551–560 Bouré O, Fatès N, Chevrier V (2013b) A robustness approach to study metastable behaviours in a latticegas model of swarming. In: Kari J, Kutrib M, Malcher A (eds) Proceedings of automata’13, volume 8155 of lecture notes in computer science. Springer, Gießen, Germany, pp 84–97 Buvel RL, Ingerson TE (1984) Structure in asynchronous cellular automata. Physica D 1:59–68 Chassaing P, Gerin L (2007) Asynchronous cellular automata and brownian motion. In: DMTCS proceedings of AofA’07, volume AH. Juan les Pins, France, pp 385–402 Chevrier V, Fatès N (2010) How important are updating schemes in multi-agent systems? An illustration on a multi-turmite model. In: Proceedings of AAMAS ‘10. International Foundation for Autonomous Agents and Multiagent Systems, Richland, pp 533–540

Asynchronous Cellular Automata Cornforth D, Green DG, Newth D (2005) Ordered asynchronous processes in multi-agent systems. Physica D 204(1–2):70–82 de Mas JF (2017) Coalescence in fully asynchronous elementary cellular automata. Technical report, HAL preprint hal-01627454 de Oliveira PPB (2014) On density determination with cellular automata: results, constructions and directions. J Cell Autom 9(5–6):357–385 Dennunzio A, Formenti E, Manzoni L (2012) Computing issues of asynchronous CA. Fundamenta Informaticae 120(2):165–180 Dennunzio A, Formenti E, Manzoni L, Mauri G (2013) m-asynchronous cellular automata: from fairness to quasi-fairness. Nat Comput 12(4):561–572 Dennunzio A, Formenti E, Manzoni L, Mauri G, Porreca AE (2017) Computational complexity of ﬁnite asynchronous cellular automata. Theor Comput Sci 664:131–143 Fatès N (2009) Asynchronism induces second order phase transitions in elementary cellular automata. J Cell Autom 4(1):21–38 Fatès N (2010) Does life resist asynchrony? In: Adamatzky A (ed) Game of life cellular automata. Springer, London, pp 257–274 Fatès N (2013a) A note on the classiﬁcation of the most simple asynchronous cellular automata. In: Kari J, Kutrib M, Malcher A (eds) Proceedings of automata’13, volume 8155 of lecture notes in computer science. Springer, Netherlands, pp 31–45. https://doi.org/ 10.1007/s11047-013-9389-2 Fatès N (2013b) Stochastic cellular automata solutions to the density classiﬁcation problem – when randomness helps computing. Theory Comput Syst 53(2):223–242 Fatès N (2014a) A guided tour of asynchronous cellular automata. J Cell Autom 9(5–6):387–416 Fatès N (2014b) Quick convergence to a ﬁxed point: a note on asynchronous elementary cellular automata. In: Was J, Sirakoulis GC, Bandini S (eds) Proceedings of ACRI’14, volume 8751 of lecture notes in computer science. Krakow, Poland, Springer, pp 586–595 Fatès N, Gerin L (2009) Examples of fast and slow convergence of 2D asynchronous cellular systems. Old City Publishing. J Cell Autom 4(4):323–337. http:// www.oldcitypublishing.com/journals/jca-home/ Fatès N, Morvan M (2005) An experimental study of robustness to asynchronism for elementary cellular automata. Complex Syst 16:1–27 Fatès N, Morvan M, Schabanel N, Thierry E (2006a) Fully asynchronous behavior of double-quiescent elementary cellular automata. Theor Comput Sci 362:1–16 Fatès N, Regnault D, Schabanel N, Thierry E (2006b) Asynchronous behavior of double-quiescent elementary cellular automata. In: Correa JR, Hevia A, Kiwi MA (eds) Proceedings of LATIN 2006, volume 3887 of lecture notes in computer science. Valdivia, Chile, Springer, pp 455–466 Fatès N, Sethi B, Das S (2017) On the reversibility of ecas with fully asynchronous updating: the recurrence point

91 of view. To appear in a monography edited by Andrew Adamatzky – Preprint available on the HAL server, id: hal-01571847 Fukś H (2002) Nondeterministic density classiﬁcation with diffusive probabilistic cellular automata. Phys Rev E 66(6):066106 Fukś H, Fatès N (2015) Local structure approximation as a predictor of second-order phase transitions in asynchronous cellular automata. Nat Comput 14(4):507–522 Gács P (2001) Deterministic computations whose history is independent of the order of asynchronous updating. Technical report – arXiv:cs/0101026 Gerin L (2017) Epidemic automaton and the eden model: various aspects of robustness. Text to appear in a monography on probabilistic cellular automata. Springer Huberman BA, Glance N (1993) Evolutionary games and computer simulations. Proc Natl Acad Sci U S A 90:7716–7718 Kari J, Taati S (2015) Statistical mechanics of surjective cellular automata. J Stat Phys 160(5):1198–1243 Lee J, Peper F (2008) On brownian cellular automata. In: Adamatzky A, Alonso-Sanz R, Lawniczak AT, Martínez GJ, Morita K, Worsch T (eds) Proceedings of automata 2008. Luniver Press, Frome, pp 278–291 Lee J, Adachi S, Peper F, Morita K (2004) Asynchronous game of life. Phys D 194(3–4):369–384 Lee J, Peper F, Cotofana SD, Naruse M, Ohtsu M, Kawazoe T, Takahashi Y, Shimokawa T, Kish LB, Kubota T (2016a) Brownian circuits: designs. Int J Unconv Comput 12(5–6):341–362 Lee J, Peper F, Leibnitz K, Ping G (2016b) Characterization of random ﬂuctuation-based computation in cellular automata. Inf Sci 352–353:150–166 Louis P-Y (2015) Supercritical probabilistic cellular automata: how effective is the synchronous updating? Nat Comput 14(4):523–534 Macauley M, Mortveit HS (2010) Coxeter groups and asynchronous cellular automata. In: Bandini S, Manzoni S, Umeo H, Vizzari G (eds) Proceedings of ACRI’10, volume 6350 of lecture notes in computer science. Springer, Ascoli Piceno, Italy, pp 409–418 Macauley M, Mortveit HS (2013) An atlas of limit set dynamics for asynchronous elementary cellular automata. Theor Comput Sci 504:26–37. Discrete mathematical structures: from dynamics to complexity Macauley M, McCammond J, Mortveit HS (2008) Order independence in asynchronous cellular automata. J Cell Autom 3(1):37–56 Mairesse J, Marcovici I (2014) Around probabilistic cellular automata. Theor Comput Sci 559:42–72. Nonuniform cellular automata Moore EF (1962) Machine models of self-reproduction. Proc Symp Appl Math 14:17–33. (Reprinted in Essays on cellular automata, Burks AW (ed), University of Illinois Press, 1970) Morita K (2008) Reversible computing and cellular automata – a survey. Theor Comput Sci 395(1):101–131

92 Nakamura K (1974) Asynchronous cellular automata and their computational ability. Syst Comput Controls 5(5):58–66 Nakamura K (1981) Synchronous to asynchronous transformation of polyautomata. J Comput Syst Sci 23(1):22–37 Nowak MA, May RM (1992) Evolutionary games and spatial chaos. Nature 359:826–829 Peper F, Lee J, Adachi S, Mashiko S (2003) Laying out circuits on asynchronous cellular arrays: a step towards feasible nanocomputers? Nanotechnology 14(4):469 Peper F, Lee J, Isokawa T (2010) Brownian cellular automata. J Cell Autom 5(3):185–206 Ramos AD, Leite A (2017) Convergence time and phase transition in a non-monotonic family of probabilistic cellular automata. J Stat Phys 168(3):573–594 Regnault D (2013) Proof of a phase transition in probabilistic cellular automata. In: Béal MP and Carton O (eds) Proceedings of developments in language theory, volume 7907 of lecture notes in computer science. Springer, Marne-la-Vallée, France, pp 433–444 Regnault D, Schabanel N, Thierry E (2009) Progresses in the analysis of stochastic 2D cellular automata: a study of asynchronous 2D minority. Theor Comput Sci 410(47–49):4844–4855 Regnault D, Schabanel N, Thierry E (2010) On the analysis of “simple” 2d stochastic cellular automata. Discrete Math Theor Comput Sci 12(2):263–294 Rouquier J-B, Morvan M (2009) Coalescing cellular automata: synchronization by common random source for asynchronous updating. J Cell Autom 4(1):55–78 Schönﬁsch B, de Roos A (1999) Synchronous and asynchronous updating in cellular automata. Biosystems 51:123–143 Sethi B, Fatès N, Das S (2014) Reversibility of elementary cellular automata under fully asynchronous update. In: Gopal TV, Agrawal M, Li A, Cooper B (eds) Proceedings of TAMC’14, volume 8402 of lecture notes in computer science. Springer, Chennai, India, pp 39–49

Asynchronous Cellular Automata Sethi B, Roy S, Das S (2016) Asynchronous cellular automata and pattern classiﬁcation. Complexity 21:370–386 Silva F, Correia L (2013) An experimental study of noise and asynchrony in elementary cellular automata with sampling compensation. Nat Comput 12(4):573–588 Silva F, Correia L, Christensen AL (2015) Modelling synchronisation in multirobot systems with cellular automata: analysis of update methods and topology perturbations. In: Sirakoulis GC, Adamatzky A (eds) Robots and lattice automata, volume 13 of emergence, complexity and computation. Springer International Publishing, Springer. pp 267–293 Takada Y, Isokawa T, Peper F, Matsui N (2007a) Asynchronous self-reproducing loops with arbitration capability. Phys D Nonlinear Phenom 227(1):26–35 Takada Y, Isokawa T, Peper F, Matsui N (2007b) Asynchronous self-reproducing loops with arbitration capability. Phys D 227(1):26–35 Vichniac GY (1984) Simulating physics with cellular automata. Phys D Nonlinear Phenom 10(1):96–116 Vielhaber M (2013) Computation of functions on n bits by asynchronous clocking of cellular automata. Nat Comput 12(3):307–322 Wacker S, Worsch T (2013) On completeness and decidability of phase space invertible asynchronous cellular automata. Fundam Informaticae 126(2–3):157–181 Wolfram S (1985) Twenty problems in the theory of cellular automata. Phys Scr T9:170 Worsch T (2013) Towards intrinsically universal asynchronous CA. Nat Comput 12(4):539–550 Yamashita T, Isokawa T, Peper F, Kawamata I, Hagiya M (2017) Turing-completeness of asynchronous noncamouﬂage cellular automata. In: Dennunzio A, Formenti E, Manzoni L, Porreca AE (eds) Proceedings of AUTOMATA 2017, volume 10248 of lecture notes in computer science. Springer, Milan, Italy, pp 187–199

Quantum Cellular Automata Karoline Wiesner School of Mathematics, University of Bristol, Bristol, UK

Article Outline Glossary Deﬁnition of the Subject Introduction Cellular Automata Early Proposals Models of QCA Computationally Universal QCA Modeling Physical Systems Implementations Future Directions Bibliography

Glossary BQP complexity class Bounded error, quantum probabilistic, the class of decision problems solvable by a quantum computer in polynomial time with an error probability of at most one third. Conﬁguration The state of all cells at a given point in time. Hadamard gate The one-qubit unitary gate 1 1 U ¼ p1ﬃﬃ2 1 1 Heisenberg picture Time evolution is represented by observables (elements of an operator algebra) evolving in time according to a unitary operator acting on them. Neighborhood All cells with respect to a given cell that can affect this cell’s state at the next time step. A neighborhood always contains a ﬁnite number of cells.

Pauli operator The three Pauli operators are sx ¼ 0 i 1 0 0 1 ,sz ¼ ,sy ¼ i 0 0 1 1 0 Phase gate The one-qubit unitary gate 1 0 U¼ 0 eif QMA complexity class Quantum MerlinArthur, the class of decision problems such that a “yes” answer can be veriﬁed by a 1-message quantum interactive proof (veriﬁable in BQP). Quantum Turing machine A quantum version of a Turing machine – an abstract computational model able to compute any computable sequence. Qubit Two-state quantum system, representable as vector a|0i + b|1i in complex space with a2 + b2 = 1. Schrödinger picture Time evolution is represented by a quantum state evolving in time according to a time-independent unitary operator acting on it. Space homogeneous The transition function/ update table is the same for each cell. Swap operation The one-qubit unitary gate 0 1 U¼ 1 0 Time homogeneous The transition function/ update table is time independent. Update table Takes the current state of a cell and its neighborhood as an argument and returns the cell’s state at the next time step.

Definition of the Subject Quantum cellular automata (QCA) are a generalization of (classical) cellular automata (CA) and in particular of reversible CA. The latter are reviewed shortly. An overview is given over early attempts by various authors to deﬁne onedimensional QCA. These turned out to have serious shortcomings which are discussed as well.

# Springer Science+Business Media LLC, part of Springer Nature 2018 A. Adamatzky (ed.), Cellular Automata, https://doi.org/10.1007/978-1-4939-8700-9_426 Originally published in R. A. Meyers (ed.), Encyclopedia of Complexity and Systems Science, # Springer Science+Business Media New York 2013 https://doi.org/10.1007/978-3-642-27737-5_426-4

93

94

Various proposals subsequently put forward by a number of authors for a general deﬁnition of oneand higher-dimensional QCA are reviewed, and their properties such as universality and reversibility are discussed. Quantum cellular automata (QCA) are a quantization of classical cellular automata (CA); d-dimensional arrays of cells with a ﬁnitedimensional state space; and a local, spatially homogeneous, discrete-time update rule. For QCA, each cell is a ﬁnite-dimensional quantum system, and the update rule is unitary. CA as well as some versions of QCA have been shown to be computationally universal. Apart from a theoretical interest in a quantized version of CA, QCA are a natural framework for what is most likely going to be the ﬁrst application of quantum computers – the simulation of quantum physical systems. In particular, QCA are capable of simulating quantum dynamical systems whose dynamics are uncomputable by classical means. QCA are now considered one of the standard models of quantum computation next to quantum circuits and various types of measurement-based quantum computational models. (For details on these and other aspects of quantum computation, see the article by Kendon in this encyclopedia.) Unlike their classical counterpart, an axiomatic, all-encompassing deﬁnition of (higher-dimensional) QCA is still missing.

Introduction Automata theory is the study of abstract computing devices and the class of functions they can perform on their inputs. The original concept of cellular automata is most strongly associated with John von Neumann (1903, †1957), a Hungarian mathematician who made major contributions to a vast range of ﬁelds including quantum mechanics, computer science, functional analysis, and many others. According to Burks, an assistant of von Neumann (1966), von Neumann had posed the fundamental questions: “What kind of logical organization is sufﬁcient for an automaton to reproduce itself?” It was Stanislaw Ulam who suggested to use the framework of cellular automata to answer this question. In 1966, von

Quantum Cellular Automata

Neumann presented a detailed analysis of the above question in his book Theory of SelfReproducing Automata (von Neumann 1966). Thus, von Neumann initiated the ﬁeld of cellular automata. He also made central contributions to the mathematical foundations of quantum mechanics, and in a sense von Neumann’s quantum logic ideas were an early attempt at deﬁning a computational model of physics. But he did not pursue this and did not go in the directions that have led to modern ideas of quantum computing in general or quantum cellular automata in particular. The idea of quantum computation is generally attributed to Feynman who, in his now famous lecture in 1981, proposed a computational scheme based on quantum mechanical laws (Feynman 1982). A contemporary paper by Benioff contains the ﬁrst proposal of a quantum Turing machine (Benioff 1980). The general idea was to devise a computational device based on and exploiting quantum phenomena that would outperform any classical computational device. These ﬁrst proposals were sequentially operating quantum mechanical machines imitating the logical operations of classical digital computation. The idea of parallelizing the operations was found in classical cellular automata. However, how to translate cellular automata into a quantum mechanical framework turned out not to be trivial. And to a certain extent how to do this in general remains an open question until today. The study of quantum cellular automata (QCA) started with the work of Grössing and Zeilinger who coined the term QCA and provided a ﬁrst deﬁnition (Grössing and Zeilinger 1988). Watrous developed a different model of QCA (Watrous 1995). His work led to further studies by several groups (van Dam 1996; Dürr and Santha 2002; Dürr et al. 1997). Independently of this, Margolus developed a parallelizable quantum computational architecture building on Feynman’s original ideas (Margolus 1991). For various reasons to be discussed below, none of these early proposals turned out to be physical. The study of QCA gained new momentum with the work by Richter, Schumacher, and Werner (Richter 1996; Schumacher and Werner 2004) and others (Arrighi and Fargetton 2007; Arrighi et al. 2007a; Perez-Delgado and Cheung 2007)

Quantum Cellular Automata

who avoided unphysical behavior allowed by the early proposals (Arrighi et al. 2007a; Schumacher and Werner 2004). It is important to notice that in spite of the over two-decade-long history of QCA, there is no single agreed-upon deﬁnition of QCA, in particular of higher-dimensional QCA. Nevertheless, many useful properties have been shown for the various models. Most importantly, quite a few models were shown to be computationally universal, i.e., they can simulate any quantum Turing machine and any quantum circuit efﬁciently (van Dam 1996; Perez-Delgado and Cheung 2007; Raussendorf 2005; Shepherd et al. 2006; Watrous 1995). Very recently, their ability to generate and transport entanglement has been illustrated (Brennen and Williams 2003). A comment is in order on a class of models which are often labeled as QCA but in fact are classical cellular automata implemented in quantum mechanical structures. They do not exploit quantum effects for the actual computation. To make this distinction clear, they are now called quantum-dot QCA. These types of QCA will not be discussed here.

Cellular Automata Deﬁnition (Cellular Automata) A cellular automaton (CA) is a 4-tuple ðL,S, N , f Þ consisting of (1) a d-dimensional lattice of cells L indexed i ℤd, (2) a ﬁnite set of states S, (3) a ﬁnite neighborhood scheme N ℤd , and (4) a local transition function f :SN ! S . A CA is discrete in time and space. It is space and time homogeneous if at each time step the same transition function, or update rule, is applied simultaneously to all cells. The update rule is local if for a given lattice L and lattice site x, f(x) is localized in x þ N ¼ fx þ njx L,n N g , where N is the neighborhood scheme of the CA. In addition to the locality constraint, the local transition function f must generate a unique global transition function mapping a lattice conﬁguration Ct SL at time t to a new conﬁguration Ct+1 at time t + 1:F:SL ! SL. Most CA are deﬁned on inﬁnite lattices or, alternatively, on ﬁnite lattices with periodic boundary conditions. For ﬁnite CA, only a ﬁnite

95 Quantum Cellular Automata, Table 1 Update table for CA rule “110” (the second row is the decimal number “110” in binary notation) M 110 ¼ 111 0

110 101 100 011 010 001 000 1 1 0 1 1 1 0

number of cells are not in a quiescent state, i.e., a state that is not effected by the update. The most studied CA are the so-called elementary CA – 1-dimensional lattices with a set of two states and a neighborhood scheme of radius 1 (nearestneighbor interaction). That is, the state of a cell at point x at time t + 1 only depends on the state of cells x 1, x, and x + 1 at time t. There are 256 such elementary CA, easily enumerated using a scheme invented by Wolfram (1983). As an example and for later reference, the update table of rule 110 is given in Table 1. CA with update rule “110” have been shown to be computationally universal, i.e., they can simulate any Turing machine in polynomial time (Cook 2004). A possible approach to constructing a QCA would be to simply “quantize” a CA by rendering the update rule unitary. There are two problems with this approach. One is that applying the same unitary to each cell does not yield a well-deﬁned global transition function nor necessarily a unitary one. The second problem is the synchronous update of all cells. “In practice,” the synchronous update of, say, an elementary CA, can be achieved by storing the current conﬁguration in a temporary register; then, update all cells with odd index in the original CA, update all cells with even index in the register, and ﬁnally splice the updated cells together to obtain the original CA at the next time step. Quantum states, however, cannot be copied in general due to the so-called no-cloning theorem (Wootters and Zurek 1982). Thus, parallel update of a QCA in this way is not possible. Sequential update on the other hand leads to either an inﬁnite number of time steps for each update or inconsistencies at the boundaries. One solution is a partitioning scheme as it is used in the construction of reversible CA. Reversible Cellular Automata Deﬁnition (Reversible CA) A CA is said to be reversible if for every current conﬁguration, there

96

Quantum Cellular Automata

belongs to exactly one block, and any two blocks are connected by a lattice translation. Such a CA is neither time homogeneous nor space homogeneous anymore, but periodic in time and space. As long as the rule for evolving each block is reversible, the entire automaton will be reversible.

Early Proposals

Quantum Cellular Automata, Fig. 1 Even (solid lines) and odd (dashed lines) of a Margolus partitioning scheme in d = 2 dimensions using blocks of size 2 2. For each partition, one block is shown shaded. Update rules are applied alternatingly to the solid and dashed partition

is exactly one previous conﬁguration. The global transition function F of a reversible CA is bijective. In general, CA are not reversible. Only 16 out of the 256 elementary CA rules are reversible. However, one can construct a reversible CA using a partitioning scheme developed by Toffoli and Margolus for 2-dimensional CA (Toffoli and Margolus 1990). Consider a 2-dimensional nearest CA with neighborhood scheme N ¼ x ℤ2 8jxi j 1 . In the partitioning scheme introduced by Toffoli and Margolus, each block of 2 2 cells forms a unit cube □ such that the even translates □ + 2x with x ℤ2 and the odd translates □ + 1 + 2x, respectively, form a partition of the lattice (see Fig. 1). The update rule of a partitioned CA takes as input an entire block of cells and outputs the updated state of the entire block. The rule is then applied alternatingly to the even and to the odd translates. The Margolus partitioning scheme is easily extended to d-dimensional lattices. A generalized Margolus scheme was introduced by Schumacher and Werner (2004). It allows for different cell sizes in the intermediate step. A partitioned CA is then a CA with a partitioning scheme such that the set of cells are partitioned in some periodic way: Every cell

Grössing and Zeilinger were the ﬁrst to coin the term and formalize a QCA (Grössing and Zeilinger 1988). In the Schrödinger picture of quantum mechanics, the state of a system at some time t is described by a state vector | cti in Hilbert space ℋ. The state vector evolves unitarily. c

tþ1

¼ U jct i

(1)

U is a unitary operator, i.e., UU† = 1, with the complex conjugate U† and the identity matrix 1. If {|fii} is a computational basis of the Hilbert space ℋ, any state |ci ℋ can be written as P a superposition ci jfi i , with coefﬁcients jf i

i P ci ℂ and ci ci ¼ 1. The QCA constructed by Grössing i and Zeilinger is an inﬁnite 1-dimensional lattice where at time t lattice site i is assigned the complex amplitude ci of state |cti. The update rule is given by unitary operator U.

Deﬁnition (Grössing-Zeilinger QCA) A Grössing-Zeilinger QCA is a 3-tuple (L, ℋ, U) which consists of (1) an inﬁnite 1-dimensional lattice L ℤ representing basis states of (2) a Hilbert space ℋ with basis set {|fii} and (3) a band-diagonal unitary operator U. Band diagonality of U corresponds to a locality condition. It turns out that there is no GrössingZeilinger QCA with nearest-neighbor interaction and nontrivial dynamics. In fact, later on, Meyer showed more generally that “in one dimension there exists no nontrivial homogeneous, local, scalar QCA. More explicitly, every band r-diagonal unitary matrix U which commutes with the one-step translation matrix T is also a

Quantum Cellular Automata

translation matrix Tk for some k ℤ, times a phase” (Meyer 1996a). Grössing and Zeilinger also introduced QCA where the unitarity constraint is relaxed to only approximate unitarity. After each update, the conﬁguration can be normalized which effectively causes nonlocal interactions. The properties of Grössing-Zeilinger QCA were studied by Grössing and coworkers in some more detail in following years (see Fussy et al. 1993, p. and references therein). This pioneering deﬁnition of QCA, however, was not studied much further, mostly because the “nonlocal” behavior renders the Grössing-Zeilinger deﬁnition nonphysical. In addition, it has little in common with the concepts developed in quantum computation later on. The Grössing-Zeilinger definition really concerns what one would call today a quantum random walk (for further details, see the review by Kempe 2003). The ﬁrst model of QCA researched in depth was that introduced by Watrous (1995), whose ideas were further explored by van Dam (1996), Dürr et al. (1997), Dürr and Santha (2002), and Arrighi (2006). A Watrous QCA is deﬁned over an inﬁnite 1-dimensional lattice, a ﬁnite set of states including a quiescent state. The transition function maps a neighborhood of cells to a single quantum state instantaneously and simultaneously. Deﬁnition (Watrous QCA) A Watrous QCA is a four-tuple ðL,S,N ,f Þ which consists of (1) a 1-dimensional lattice L ℤ, (2) a ﬁnite set of cell states S including a quiescent state e, (3) a ﬁnite neighborhood scheme N , and (4) a local transition function f :SN ! ℋS. Here, ℋS denotes the Hilbert space spanned by the cell states S. This model can be viewed as a direct quantization of a CA where the set of possible conﬁgurations of the CA is extended to include all linear superpositions of the classical cell conﬁgurations and the local transition function now maps the cell conﬁgurations of a given neighborhood to a quantum state. One cell is labeled “accept” cell. The quiescent state is used to allow only a ﬁnite number of states to be active and renders the lattice effectively ﬁnite. This is

97

crucial to avoid an inﬁnite product of unitaries and, thus, to obtain a well-deﬁned QCA. The Watrous QCA, however, allows for nonphysical dynamics. It is possible to deﬁne transition functions that do not represent unitary evolution of the conﬁguration, either by producing superpositions of conﬁgurations which do not preserve the norm or by inducing a global transition function which is not unitary. This leads to nonphysical properties such as superluminal signaling (Schumacher and Werner 2004). The set of Watrous QCA is not closed under composition and inverse (Schumacher and Werner 2004). Watrous deﬁned a restricted class of QCA by introducing a partitioning scheme. Deﬁnition (Partitioned Watrous QCA) A partitioned Watrous QCA is a Watrous QCA with S = Sl Sc Sr for ﬁnite sets Sl, Sc, and Sr and matrix L of size S S. For any state, s = (sl, sc, sr) S deﬁne transition function f as f ðs1 , s2 , s3 , sÞ ¼ Lðsl3 , sm2 , sr1 , sÞ,

(2)

with matrix element Lsi,sj. In a partitioned Watrous QCA, each cell is divided into three sub-cells – left, center, and right. The neighborhood scheme is then a nearestneighbor interaction conﬁned to each cell. The transition function consists of a unitary acting on each partitioned cell and swap operations among sub-cells of different cells. Figure 2 illustrates the swap operation between neighboring cells. For the class of partitioned Watrous QCA, Watrous provides the ﬁrst proof of computational universality of a QCA by showing that any quantum Turing machine can be efﬁciently simulated by a partitioned Watrous QCA with constant slowdown and that any partitioned Watrous QCA can be simulated by a quantum Turing machine with linear slowdown. Theorem (Watrous 1995) Given any quantum Turing machine MTM, there exists a partitioned Watrous QCA MCA which simulates MTM with constant slowdown.

98

Quantum Cellular Automata

Models of QCA

Quantum Cellular Automata, Fig. 2 Each cell is divided into three sub-cells labeled l, c, and r for left, center, and a right, respecti vely. The update rule consists of swapping left and right sub-cells of neighboring cells and then updating each cell internally using a unitary operation acting on the left, center, and right part of each cell

Theorem (Watrous 1995) Given any partitioned Watrous QCA MCA, there exists a quantum Turing machine MTM which simulates MCA with linear slowdown. Watrous’ model was further developed by van Dam (1996), who deﬁned a QCA as an assignment of a product vector to every basis state in the computational basis. Here the quiescent state is eliminated, and thus, the QCA is made explicitly ﬁnite. Van Dam showed that the ﬁnite version is also computationally universal. Efﬁcient algorithms to decide whether a given 1-dimensional QCA is unitary was presented by Dürr et al. (1997), Dürr and Santha (2002). Due to substantial shortcomings such as nonphysical behavior, these early proposals were replaced by a second wave of proposals to be discussed below. Today, there is not a generally accepted QCA model that has all the attributes of the CA model: unique deﬁnition, simple to describe, and computationally powerful. In particular, there is no axiomatic deﬁnition, contrary to its classical counterpart, that yields an immediate way of constructing/enumerating all of the instances of this model. Rather, each set of authors deﬁnes QCA in their own particular fashion. The states s S are basis states spanning a ﬁnite-dimensional Hilbert space. At each point in time, a cell represents a ﬁnite-dimensional quantum system in a superposition of basis states. The unitary operators represent the discrete-time evolution of strictly ﬁnite propagation speed.

Reversible QCA Schumacher and Werner used the Heisenberg picture rather than the Schrödinger picture in their model (Schumacher and Werner 2004). Thus, instead of associating a d-level quantum system with each cell, they associated an observable algebra with each cell. Taking a quasi-local algebra as the tensor product of observable algebras over a ﬁnite subset of cells, a QCA is then a homomorphism of the quasilocal algebra, which commutes with lattice translations and satisﬁes locality on the neighborhood. The observable-based approach was ﬁrst used in Richter (1996) with focus on the irreversible case. However, this deﬁnition left questions open such as whether the composition of two QCA will again form a QCA. The following deﬁnition does avoid this uncertainty. Consider an inﬁnite d-dimensional lattice L ℤd of cells x ℤ2, where each cell is associated with the observable algebra Ax and each of these algebras is an isomorphic copy of the algebra of complex d d-matrices. When L ℤd is a ﬁnite subset of cells, denote by A(L) the algebra of observables belonging to all cells in L, i.e., the tensor product N x LAx. The completion of this algebra is called a quasi-local algebra and will be denoted by A(ℤd). Deﬁnition (Reversible QCA) A quantum cellular automaton with neighborhood scheme N ℤd is a homomorphism T:A(ℤd) ! A(ℤd) of the quasi-local algebra, which commutes with lattice translations, and satisﬁes the locality condition T ðAðLÞÞ T ðAðL þ N ÞÞ for every ﬁnite set L ℤd. The local transition rule of a cellular automaton is the homomorphism T0:A0 ! A(N). Schumacher and Werner presented and proved the following theorem on one-dimensional QCA. Theorem (Structure Theorem (Schumacher and Werner 2004)) Let T be the global transition homomorphism of a one-dimensional nearestneighbor QCA on the lattice ℤd with single-cell algebra A0 = Md. Then T can be represented in the generalized Margolus partitioning scheme, i.e., T restricts to an isomorphism

Quantum Cellular Automata

99

T : Að□Þ ! ℬs , sS

(3)

where for each quadrant vector q Q, the subalgebra ℬq A(□ + q) is a full matrix algebra, ℬqMn(q). These algebras and the matrix dimensions n(q) are uniquely determined by T. Theorem (Structure Theorem (Schumacher and Werner 2004)) does not hold in higher dimensions (Werner R, private communication). A central result obtained in this framework is that almost any (Werner R, private communication) 1-dimensional QCA can be represented using a set of local unitary operators and a generalized Margolus partitioning (Schumacher and Werner 2004), as illustrated in Fig. 3. Furthermore, if the local implementation allows local ancillas, then any QCA, in any lattice dimension, can be built from local unitaries (Schumacher and Werner 2004; Werner R, private communication). In addition, they proved the following corollary: Corollary (Schumacher and Werner 2004) The inverse of a nearest-neighbor QCA exists and is a nearest-neighbor QCA. The latter result is not true for CA. A similar result for ﬁnite conﬁgurations was obtained in Arrighi et al. (2007a). Here evidence is presented that the result does not hold for two-dimensional QCA. The work by Schumacher and Werner can be considered the ﬁrst general deﬁnition for 1-dimensional QCA. A similar result for manydimensional QCA does not exist.

Quantum Cellular Automata, Fig. 3 Generalized Margolus partitioning scheme in 1 dimension using two unitary operations U and V

translations Ux and Uy must commute for all x, y L. The product VU is a valid local, unitary quantum operation. The resulting global update rule is well deﬁned and space homogeneous. The set of states includes a quiescent state as well as an “ancillary” set of states/subspace which can store the result of the “read” operation. The initial state of a local-unitary QCA consists of identical kd blocks of cells initialized in the same state. Local-unitary QCA are universal in the sense that for any arbitrary quantum circuit, there is a local-unitary QCA which can simulate it. In addition, any local-unitary QCA can be simulated efﬁciently using a family of quantum circuits (Perez-Delgado and Cheung 2007). Adding an additional memory register to each cell allows this class of QCA to model any reversible QCA of the Schumacher/Werner type discussed above.

Local Unitary QCA Perez-Delgado and Cheung proposed a local unitary QCA (Perez-Delgado and Cheung 2007).

Block-Partitioned and Nonunitary QCA Brennen and Williams introduced a model of QCA which allows for unitary and nonunitary rules (Brennen and Williams 2003).

Deﬁnition (Local-Unitary QCA) A localunitary QCA is a ﬁve-tuple fðL, S, N , U 0 , V0 Þg consisting of (1) a d-dimensional lattice of cells indexed by integer tuples L ℤd, (2) a ﬁnite set of orthogonal basis states S, (3) a ﬁnite neighborhood scheme N ℤd , (4) a local read function

Deﬁnition (Block-Partitioned QCA) A blockpartitioned QCA is a 4-tuple fL, S, N , M g consisting of (1) a 1-dimensional lattice of n cells indexed L = 0, . . ., n 1, (2) a 2-dimensional state space S, (3) a neighborhood scheme N , and (4) an update rule M applied over N .

N

N

U 0 :ðℋSÞ ! ðℋSÞ , and (5) a local update function V0:ℋS ! ℋS. The read operation carries the further restriction that any two lattice

Given a system with nearest-neighbor interactions, the simplest unitary QCA rule has radius

100

Quantum Cellular Automata

r = 1 describing a unitary operator applied over a three-cell neighborhood j 1, j, j + 1: M ðu00 , u01 , u10 , u11 Þ ¼ j00ij00i u00 þj01ij01i u01 þ j10ij10i u10 þj11ij11i u11

(4)

where | abihab | uab means update the qubit at site j with the unitary uab if the qubit at the site j 1 is in state | ai and the qubit at site j + 1 is in state | bi. M commutes with its own two-site translation. Thus, a partitioning is introduced by updating simultaneously all even qubits with rule M before updating all odd qubits with rule M. Periodic boundaries are assumed. However, by addressability of the end qubits, simulation of a block-partitioned QCA by a QCA with boundaries can be achieved. Nonunitary update rules correspond to completely positive maps on the quantum states where the neighboring states act as the environment. Take a nearest-neighbor 1-dimensional blockpartitioned QCA. In the density operator formalism, each quantum system r is given by the probability P distributionr ¼ iri jcihcj over outer products of quantum states | ci. A completely positive map S(r) applied to state r is represented by a set of Krauss operators Fm, which are positive operators that sum P † up to the identity mF m F m ¼ 1. The map Sjab(r) acting on cell j conditioned on state a of the left neighbor and state b of the right neighbor can then be written as

The implementation of such a blockpartitioned nonunitary QCA is proposed in form of a lattice of even order constructed with an alternating array of two distinguishable species ABABABAB. . . that are globally addressable and interact via the Ising interaction. Update rules that generate and distribute entanglement were studied in this framework (Brennen and Williams 2003). Continuous-Time QCA Vollbrecht and Cirac initiated the study of continuous-time QCA (Vollbrecht and Cirac 2008). They show that the computability of the ground state energy of a translationally invariant n-neighbor Hamiltonian was QMA-hard. Their QCA model is taken up by Nagaj and Wocjam (2008) who used the term Hamiltonian QCA. Deﬁnition (Hamiltonian QCA) A Hamiltonian QCA is a tuple {L, S = Sp Sd} consisting of (1) a 1-dimensional lattice of length L, (2) a ﬁnite set of orthogonal basis states S = Sp Sd containing (2a) a data register Sd, and (2b) a program register Sp. The initial state encodes both the program and the data, stored in separate subspaces of the state space:

L E jfi ¼ rj d j j¼1

S ab j ðrÞ ¼ jabihabj

X m

ab† F ab m rF m

jabihabj:

(5)

As an example, the CA rule “110” can now be translated into an update rule for cell j in a blockpartitioned nonunitary QCA: F j1 ¼ j00ih00j 1j þ j10ih10j 1j þ j11ih11j sjx þ j01ih01j j1ijj h1j (6) F j2 ¼ j01ih01j j1ijj h0j, where sx is the Pauli operator.

(7)

j

(8)

The computation is carried out autonomously. Nagaj and Wocjam showed that, if the system is left alone for a period of time t = O(L log L), polynomially in the length of the chain, the result of the computation is obtained with probability p 5/6 O(1/log L). Hamiltonian QCA are computationally universal; more precisely, they are in the complexity class BQP. Two constructions for Hamiltonian QCA are given in (Nagaj and Wocjan 2008), one using a 10-dimensional state space, and the resulting system can be thought of as the diffusion of a system of free fermions. The second construction given uses a 20-dimensional state space and can be thought of as a quantum walk on a line.

Quantum Cellular Automata

Examples of QCA Raussendorf proved an explicit construction of QCA and proved its computational universality (Raussendorf 2005). The QCA lives on a torus with a 2 2 Margolus partitioning. The update rule is given by a single four-qubit unitary acting on 2 2 blocks of qubits. The four-qubit unitary operation consists of swap operations, the Hadamard transformation, and a phase gate. The initial state of the QCA is prepared such that columns encode alternatingly data and program. When the QCA is running, the data travel in one direction, while the program (encoding classical information in orthogonal states) travels in the opposite direction. Where the two cross, the computation is carried out through nearest-neighbor interaction. After a ﬁxed number of steps, the computation is done, and the result can be read out of a dedicated “data” column. This QCA is computationally universal; more precisely, it is within a constant as efﬁcient as a quantum logic network with local and nearest-neighbor gates. Shepherd, Franz, and Werner compared classically controlled QCA to autonomous QCA (Shepherd et al. 2006). The former is controlled by a classical compiler that selects a sequence of operations acting on the QCA at each time step. The latter operates autonomously, performing the same unitary operation at each time step. The only step that is classically controlled is the measurement (and initialization). They show the computational equivalence of the two models. Their result implies that a particular quantum simulator may be as powerful as a general one.

Computationally Universal QCA Quite a few models have been shown to be computationally universal, i.e., they can simulate any quantum Turing machine and any quantum circuit efﬁciently. A Watrous QCA simulates any quantum Turing machine with constant slowdown (Watrous 1995). The QCA deﬁned by Van Dam is a ﬁnite version of a Watrous QCA and is computationally universal as well (van Dam 1996). Local-unitary QCA can simulate any quantum

101

circuit and thus are computationally universal (Perez-Delgado and Cheung 2007). Blockpartitioned QCA can simulate a quantum computer with linear overhead in time and space (Brennen and Williams 2003). Continuous-time QCA are in complexity class BQP and thus computationally universal (Vollbrecht and Cirac 2008). The explicit constructions of 2-dimensional QCA by Raussendorf are computationally universal; more precisely, it is within a constant as efﬁcient as a quantum logic network with local and nearestneighbor gates (Raussendorf 2005). Shepherd, Franz, and Werner provided an explicit construction of a 12-state 1-dimensional QCA which is in complexity class BQP. It is universally programmable in the sense that it simulates any quantumgate circuit with polynomial overhead (Shepherd et al. 2006). Arrighi and Fargetton proposed a 1-dimensional QCA capable of simulating any other 1-dimensional QCA with linear overhead (Arrighi and Fargetton 2007). Implementations of computationally universal QCA have been suggested by Lloyd (1993) and Benjamin (2001).

Modeling Physical Systems One of the goals in developing QCA is to create a useful modeling tool for physical systems. Physical systems that can be simulated with QCA include Ising and Heisenberg interaction spin chains, solid state NMR, and quantum lattice gases. Spin chains are perhaps the most obvious systems to model with QCA. The simple cases of such 1-dimensional lattices of spins are Hamiltonians which commute with their own lattice translations. Vollbrecht and Cirac showed that the computability of the ground state energy of a translationally invariant n-neighbor Hamiltonian is in complexity class QMA (Vollbrecht and Cirac 2008). For simulating noncommuting Hamiltonians, a block-wise update such as the Margolus partitioning has to be used (see section on “Reversible Cellular Automata”). Here the fact is used that any Hamiltonian can be expressed as the sum of two Hamiltonians, H = Ha + Hb. Ha and Hb can

102

then, to a good approximation, be applied sequentially to yield the original Hamiltonian H, even if these do not commute. It has been shown that such 1-dimensional spin chains can be simulated efﬁciently on a classical computer (Vidal 2004). It is not known, however, whether higher-dimensional spin systems can be simulated efﬁciently classically. Quantum Lattice Gas Automata Any numerical evolution of a discretized partial differential equation can be interpreted as the evolution of some CA, using the framework of lattice gas automata. In the continuous time and space limit, such a CA mimics the behavior of the partial differential equation. In quantum mechanical lattice gas automata (QLGA), the continuous limit on a set of so-called quantum lattice Boltzmann equation recovers the Schrödinger equation (Succi and Benzi 1993). The ﬁrst formulation of a linear unitary CA was given in Bialynicki-Birula (1994). Meyer coined the term quantum lattice gas automata (QLGA) and demonstrated the equivalence of a QLGA and the evolution of a set of quantum lattice Boltzmann equations (Meyer 1996a, b). Meyer (1997), Boghosian and Taylor (1998a), and Love and Boghosian (2005) explored the idea of using QLGA as a model for simulating physical systems. Algorithms for implementing QLGA on a quantum computer have been presented in Boghosian and Taylor (1998b), Meyer (2002), Ortiz et al. (2001).

Implementations A large effort is being made in many laboratories around the world to implement a model of a quantum computer. So far all of them are conﬁned to a very ﬁnite number of elements and are no way near to a quantum Turing machine (which in itself is a purely theoretical construct but can be approximated by a very large number of computational elements). One existing experimental setup that is very promising for quantum information processing and that does not suffer from this “ﬁniteness” is optical lattices (for a review, see Bloch 2005). They possess a translation symmetry

Quantum Cellular Automata

which makes QCA a very suitable framework in which to study their computational power. Optical lattices are artiﬁcial crystals of light and consist of hundreds of thousands of microtraps. One or more neutral atoms can be trapped in each of the potential minima. If the potential minima are deep enough, any tunneling between the traps is suppressed, and each site contains the same amount of atoms. A quantum register – here in form of a so-called Mott insulator – has been created. The biggest challenge at the moment is to ﬁnd a way to address the registers individually to implement quantum gates. For a QCA, all that is needed is implementing the unitary operation(s) acting on the entire lattice simultaneously. The internal structure of the QCA guarantees the locality of the operations. This is a huge simpliﬁcation compared to individual manipulation of the registers. Optical lattices are created routinely by superimposing two or three orthogonal standing waves generated from laser beams of a certain frequency. They are used to study fermionic and bosonic quantum gases, nonlinear quantum dynamics, and strongly correlated quantum phases, to name a few. A type of locally addressed architecture by global control was put forward by Lloyd (1993). In this scheme, a 1-dimensional array is built out of three atomic species, periodically arranged as AℬCAℬCAℬC. Each species encodes a qubit and can be manipulated without affecting the other species. The operations on any species can be controlled by the states of the neighboring cells. The end-cells are used for readout, since they are the only individually addressable components. Lloyd showed that such a quantum architecture is universal. Benjamin investigated the minimum physical requirements for such a many-species implementation and found a similar architecture using only two types of species, again arranged periodically AℬAℬAℬ (Benjamin 2000, 2001; Benjamin and Bose 2004). By giving explicit sequences of operations implementing one-qubit and two-qubit (CNOT) operations, Benjamin showed computational universality. But the reduction in spin resources comes with an increase in logical encoding into four spin sites with a buffer space of at least four empty spin sites between each logical qubit.

Quantum Cellular Automata

A continuation of this multispecies QCA architecture is found in the work by Twamley (2003). Twamley constructed a proposal for a QCA architecture based on Fullerene (C60) molecules doped with atomic species 15N and 31P, respectively, arranged alternatingly in a 1-dimensional array. Instead of electron spins which would be too sensitive to stray electric charges, the quantum information is encoded in the nuclear spins. Twamley constructed sequences of pulses implementing Benjamin’s scheme for one- and two-qubit operations. The weakest point of the proposal is the readout operation which is not well deﬁned. A different scheme for implementing QCA was suggested by Tóth and Lent (2001). Their scheme is based on the technique of quantum-dot CA. The term quantum-dot CA is usually used for CA implementations in quantum dots (for classical computation). The authors, therefore, called their model a coherent quantum-dot CA. They illustrated the usage of an array of N quantum dots as an N-qubit quantum register. However, the setup and the allowed operations allow for individual control of each cell. This coherent quantum-dot CA is more a hybrid of a quantum circuit with individual qubit control and a QCA with constant nearest-neighbor interaction. The main property of a QCA, operating under global control only, is not taken advantage of.

Future Directions The ﬁeld of QCA is developing rapidly. New deﬁnitions have appeared very recently. Since QCA are now considered to be one of the standard measurement-based models of quantum computation, further work on a consistent and sufﬁcient deﬁnition of higher-dimensional QCA is to be expected. One proposal for such a “ﬁnal” deﬁnition has been put forward in (Arrighi et al. 2007a, b). In the search for robust and easily implementable quantum computational architectures, QCA are of considerable interest. The main strength of QCA is global control without the need to address cells individually (with the possible exception of the readout operation). It has become clear that the global update of a QCA

103

would be a way around practical issues related to the implementation of quantum registers and the difﬁculty of their individual manipulation. More concretely, QCA provide a natural framework for describing quantum dynamical evolution of optical lattices, a ﬁeld in which the experimental physics community has made huge progress in the last decade. The main focus so far has been on reversible QCA. Irreversible QCA are closely related to measurement-based computation and remain to be explored further.

Bibliography Primary Literature Aoun B, Tariﬁ M (2004) Introduction to quantum cellular automata. http://arxiv.org/abs/quant-ph/0401123 Arrighi P (2006) Algebraic characterizations of unitary linear quantum cellular automata. In: Mathematical foundations of computer science 2006, vol 4162, Lecture notes in computer science. Springer, Berlin, pp 122–133 Arrighi P, Fargetton R (2007) Intrinsically universal onedimensional quantum cellular automata. 0704.3961. http://arxiv.org/abs/0704.3961 Arrighi P, Nesme V, Werner R (2007) One-dimensional quantum cellular automata over ﬁnite, unbounded conﬁgurations. 0711.3517v1. http://arxiv.org/abs/0711. 3517 Arrighi P, Nesme V, Werner R (2007) N-dimensional quantum cellular automata. 0711.3975v1. http://arxiv.org/ abs/arXiv:0711.3975 Benioff P (1980) The computer as a physical system: a microscopic quantum mechanical hamiltonian model of computers as represented by turing machines. J Stat Phys 22:563–591 Benjamin SC (2000) Schemes for parallel quantum computation without local control of qubits. Phys Rev A 61:020301–020304 Benjamin SC (2001) Quantum computing without local control of qubit-qubit interactions. Phys Rev Lett 88(1):017904 Benjamin SC, Bose S (2004) Quantum computing in arrays coupled by “always-on” interactions. Phys Rev A 70:032314 Bialynicki-Birula I (1994) Weyl, Dirac, and Maxwell equations on a lattice as unitary cellular automata. Phys Rev D 49:6920 Bloch I (2005) Ultracold quantum gases in optical lattices. Nat Phys 1:23–30 Boghosian BM, Taylor W (1998a) Quantum lattice-gas model for the many-particle Schrödinger equation in d dimensions. Phys Rev E 57:54

104 Boghosian BM, Taylor W (1998b) Simulating quantum mechanics on a quantum computer. Phys D Nonlinear Phenom 120:30–42 Brennen GK, Williams JE (2003) Entanglement dynamics in one-dimensional quantum cellular automata. Phys Rev A 68:042311 Cook M (2004) Universality in elementary cellular automata. Complex Syst 15:1 Dürr C, Santha M (2002) A decision procedure for unitary linear quantum cellular automata. SIAM J Comput 31:1076–1089 Dürr C, LêThanh H, Santha M (1997) A decision procedure for well-formed linear quantum cellular automata. Random Struct Algorithm 11:381–394 Feynman R (1982) Simulating physics with computers. Int J Theor Phys 21:467–488 Fussy S, Grössing G, Schwabl H, Scrinzi A (1993) Nonlocal computation in quantum cellular automata. Phys Rev A 48:3470 Grössing G, Zeilinger A (1988) Quantum cellular automata. Complex Syst 2:197–208 Gruska J (1999) Quantum computing. Osborne/McGrawHill, New York, QCA are treated in Section 4.3 Kempe J (2003) Quantum random walks: an introductory overview. Contemp Phys 44:307 Lloyd S (1993) A potentially realizable quantum computer. Science 261:1569–1571 Love P, Boghosian B (2005) From Dirac to diffusion: decoherence in quantum lattice gases. Quantum Inf Process 4:335–354 Margolus N (1991) Parallel quantum computation. In: Zurek WH (ed) Complexity, entropy, and the physics of information, Santa Fe Institute series. Addison Wesley, Redwood City, pp 273–288 Meyer DA (1996a) From quantum cellular automata to quantum lattice gases. J Stat Phys 85:551–574 Meyer DA (1996b) On the absence of homogeneous scalar unitary cellular automata. Phys Lett A 223: 337–340 Meyer DA (1997) Quantum mechanics of lattice gas automata: one-particle plane waves and potentials. Phys Rev E 55:5261 Meyer DA (2002) Quantum computing classical physics. Philos Trans R Soc A 360:395–405 Nagaj D, Wocjan P (2008) Hamiltonian quantum cellular automata in 1d. 0802.0886. http://arxiv.org/abs/0802. 0886 Ortiz G, Gubernatis JE, Knill E, Laﬂamme R (2001) Quantum algorithms for fermionic simulations. Phys Rev A 64:022319

Quantum Cellular Automata Perez-Delgado CA, Cheung D (2005) Models of quantum cellular automata. http://arxiv.org/abs/quant-ph/0508164 Perez-Delgado CA, Cheung D (2007) Local unitary quantum cellular automata. Phys Rev A (At Mol Opt Phys) 76:032320–15 Raussendorf R (2005) Quantum cellular automaton for universal quantum computation. Phys Rev A (At Mol Opt Phys) 72:022301–022304 Richter W (1996) Ergodicity of quantum cellular automata. J Stat Phys 82:963–998 Schumacher B, Werner RF (2004) Reversible quantum cellular automata. quant-ph/0405174. http://arxiv.org/ abs/quant-ph/0405174 Shepherd DJ, Franz T, Werner RF (2006) Universally programmable quantum cellular automaton. Phys Rev Lett 97:020502–020504 Succi S, Benzi R (1993) Lattice Boltzmann equation for quantum mechanics. Phys D Nonlinear Phenom 69:327–332 Toffoli T, Margolus NH (1990) Invertible cellular automata: a review. Phys D Nonlinear Phenom 45:229–253 Tóth G, Lent CS (2001) Quantum computing with quantum-dot cellular automata. Phys Rev A 63:052315 Twamley J (2003) Quantum-cellular-automata quantum computing with endohedral fullerenes. Phys Rev A 67:052318 van Dam W (1996) Quantum cellular automata. Master’s thesis, University of Nijmegen Vidal G (2004) Efﬁcient simulation of one-dimensional quantum many-body systems. Phys Rev Lett 93(4):040502 Vollbrecht KGH, Cirac JI (2008) Quantum simulators, continuous-time automata, and translationally invariant systems. Phys Rev Lett 100:010501 von Neumann J (1966) Theory of self-reproducing automata. University of Illinois Press, Champaign Watrous J (1995) On one-dimensional quantum cellular automata. In: Proceedings of the 36th annual symposium on foundations of computer science, Milwaukee, pp 528–537 Wolfram S (1983) Statistical mechanics of cellular automata. Rev Mod Phys 55:601 Wootters WK, Zurek WH (1982) A single quantum cannot be cloned. Nature 299:802–803

Books and Reviews Summaries of the topic of QCA can be found in chapter 4.3 of Gruska (Grössing and Zeilinger 1988), and in Aoun and Tariﬁ (2004) and Ortiz et al. (2001)

Reversible Cellular Automata Kenichi Morita Hiroshima University, Higashi-Hiroshima, Japan

Article Outline Glossary Deﬁnition of the Subject Introduction Reversible Cellular Automata How Can We Find RCAs? Simulating Irreversible Cellular Automata by Reversible Ones 1-D Universal Reversible Cellular Automata Simulating Cyclic Tag Systems by 1-D RCAs 2-D Universal Reversible Cellular Automata That Can Simulate Reversible Logic Gates Future Directions Bibliography

Glossary Cellular automaton A cellular automaton (CA) is a system consisting of a large (theoretically, inﬁnite) number of ﬁnite automata, called cells, which are connected uniformly in a space. Each cell changes its state depending on the states of itself and the cells in its neighborhood. Thus, the state transition of a cell is speciﬁed by a local function. Applying the local function to all the cells in the space synchronously, the transition of a conﬁguration (i.e., a whole state of the cellular space) is induced. Such a transition function is called a global function. A CA is regarded as a kind of dynamical system that can deal with various kinds of spatiotemporal phenomena. Cellular automaton with block rules A CA with block rules was proposed by Margolus (1984), and it is often called a CA with Margolus neighborhood. The cellular space is

divided into inﬁnitely many blocks of the same size (in the two-dimensional case, e.g., 2 2). A local transition function consisting of “block rules,” which is a mapping from a block state to a block state, is applied to all the blocks in parallel. At the next time step, the block division pattern is shifted by some ﬁxed amount (e.g., to the north-east direction by one cell), and the same local function is applied to them. This model of CA is convenient to design a reversible CA. This is because if the local transition function is injective, then the resulting CA is reversible. Partitioned cellular automaton A partitioned cellular automaton (PCA) is a framework for designing a reversible CA. It is a subclass of a usual CA where each cell is divided into several parts, whose number is equal to the neighborhood size. Each part of a cell has its own state set and can be regarded as an output port to a speciﬁed neighboring cell. Depending only on the corresponding parts (not on the whole states) of the neighboring cells, the next state of each cell is determined by a local function. We can see that if the local function is injective, then the resulting PCA is reversible. Hence, a PCA makes it feasible to construct a reversible CA. Reversible cellular automaton A reversible cellular automaton (RCA) is deﬁned as a CA whose global function is injective (i.e., one-to-one). It can be regarded as a kind of a discrete model of reversible physical space. It is in general difﬁcult to construct an RCA with a desired property such as computational universality. Therefore, the frameworks of a CA with Margolus neighborhood, a partitioned cellular automaton, and others are often used to design RCAs. Universal cellular automaton A CA is called computationally universal (or Turing universal), if it can simulate a universal Turing machine, or equivalently, it can compute any recursive function by giving an appropriate initial conﬁguration. Computational

# Springer Science+Business Media LLC, part of Springer Nature 2018 A. Adamatzky (ed.), Cellular Automata, https://doi.org/10.1007/978-1-4939-8700-9_455 Originally published in R. A. Meyers (ed.), Encyclopedia of Complexity and Systems Science, # Springer Science+Business Media LLC 2018 https://doi.org/10.1007/978-3-642-27737-5_455-7

105

106

universality of RCAs can be proved by simulating other systems such as arbitrary (generally irreversible) CAs, reversible Turing machines, reversible counter machines, and reversible logic elements and circuits, which have already been known to be universal.

Definition of the Subject Reversible cellular automata (RCAs) are deﬁned as cellular automata (CAs) with an injective global function. Every conﬁguration of an RCA has exactly one previous conﬁguration, and thus RCAs are “backward deterministic” CAs. The notion of reversibility originally comes from physics. It is one of the fundamental microscopic physical laws of nature. In this sense, an RCA is thought as an abstract model of a physically reversible space as well as a computing model. It is very important to investigate how computation can be carried out efﬁciently and elegantly in a system having reversibility. This is because future computing devices will surely become those of a nanoscale size. In this entry, we mainly discuss on the properties of RCAs from the computational aspects. In spite of the strong constraint of reversibility, RCAs have very high capability of computing. We can see that even very simple RCAs have universal computing power. We can also recognize, in some reversible cellular automata, that computation is carried out in a very different manner from conventional computing systems; thus, they will give new ways and concepts for future computing.

Introduction Problems related to injectivity and surjectivity of global functions of CAs were ﬁrst studied by Moore (1962) and Myhill (1963) in the Gardenof-Eden problem. A Garden-of-Eden conﬁguration is such that it can exist only at time zero, i.e., it has no predecessor conﬁguration. Therefore, if a CA has a Garden-of-Eden conﬁguration, then its global function is not surjective. They proved the

Reversible Cellular Automata

following Garden-of-Eden theorem: A CA has a Garden-of-Eden conﬁguration, if and only if it has an “erasable conﬁguration.” After that, many researchers studied on injectivity and surjectivity of global functions more generally (Amoroso and Cooper 1970; Maruoka and Kimura 1976, 1979; Richardson 1972). In particular, Richardson (1972) showed that if a CA is injective, then it is surjective. Toffoli (1977) ﬁrst studied reversible (i.e., injective) CAs from the computational viewpoint. He showed that every k-dimensional irreversible CA can be simulated by a (k + 1)-dimensional RCA. Hence, a two-dimensional RCA has universal computing capability. Since then, extensive studies on RCAs have been done until now. After the pioneering work of Bennett (1973) on reversible Turing machines, several models of reversible computing were proposed besides RCAs. They are, for example, reversible logic circuits (Fredkin and Toffoli 1982; Morita 2001; Toffoli 1980), billiard ball model (BBM) of computing (Fredkin and Toffoli 1982), and reversible counter machines (Morita 1996). Most of these models have a close relation to physical reversibility. In fact, reversible computing plays an important role when considering inevitable power dissipation in computing (Bennett 1973, 1982; Bennett and Landauer 1985; Landauer 1961; Toffoli and Margolus 1990). It is also one of the bases of quantum computing (see, e.g., Gruska 1999) because an evolution of a quantum system is a reversible process. In this entry, we discuss how RCAs can have universal computing capability and how simple they can be. Since reversibility is one of the fundamental microscopic properties of physical systems, it is important to investigate whether we can use such physical mechanisms directly for computation. An RCA is a useful framework to formalize and investigate these problems. Since this entry is not an exhaustive survey, many interesting topics related to RCAs, such as complexity of RCA (Sutner 2004), relations to quantum CA (e.g., Watrous 1995), etc., are omitted. An outline of the following sections is as follows. In section “Reversible Cellular Automata,”

Reversible Cellular Automata

we give basic deﬁnitions on RCAs and design methods for obtaining RCAs. In section “Simulating Irreversible Cellular Automata by Reversible Ones,” it is shown how irreversible CAs are simulated by RCAs. In section “1-D Universal Reversible Cellular Automata,” two kinds of computationally universal 1-D RCAs are shown. In section “2-D Universal Reversible Cellular Automata,” several universal 2-D RCAs with very simple local functions are shown. In section “Future Directions,” we discuss future perspectives and open problems as well as some other problems on RCAs not given in the previous sections.

Reversible Cellular Automata We ﬁrst give deﬁnitions on conventional cellular automata (CAs) and then reversible CAs. Next, we give design methods of reversible CAs. Formal Definitions Deﬁnition 1 A deterministic k-dimensional (k-D) m-neighbor cellular automaton (CA) is a system deﬁned by A ¼ ℤk , Q, ðn1 , . . . , nm Þ, f ,# , where ℤ is the set of all integers (hence ℤk is the set of all k-dimensional points with integer coordinates at which cells are placed), Q is a nonempty ﬁnite set of states of each cell, (n1,. . ., nm) is an element of (ℤk)m called a neighborhood (m = 1, 2,. . .), f: Qm ! Q is a local function, and # Q is a quiescent state that satisﬁes f(#,. . ., #) = #. We also allow a CA such that no quiescent state is speciﬁed. A conﬁguration of A is a mapping a: ℤk ! Q. Let Conf(A) denote the set of all conﬁgurations of A, i.e., Conf(A) = {a| a: ℤk ! Q}. We say that a conﬁguration a is ﬁnite if the set {x| x ℤk ^ a(x) 6¼ #} is ﬁnite. Otherwise, it is called inﬁnite. The global function F: Conf(A) ! Conf(A) is deﬁned as the one that satisﬁes the following formula:

107

8a Conf ðAÞ, x Zk : FðaÞðxÞ ¼ f ðaðx þ n1 Þ, . . . , aðx þ nm ÞÞ Deﬁnition 2 Let A = (ℤk, Q, (n1,. . ., nm), f, #) be a CA. (1) A is called an injective CA if F is injective. (2) A is called an invertible CA if there is a CA A0 = (ℤk, Q, N0, f 0, #) that satisﬁes the following condition: 8a, b Conf ðAÞ : FðaÞ ¼ b iff F0 ðbÞ ¼ a, where F and F0 are the global functions of A and A0 , respectively. The following theorem can be derived from the results independently proved by Hedlund (1969) and Richardson (1972). Theorem 1 (Hedlund 1969; Richardson 1972) A CA A is injective iff it is invertible. By the above theorem, we see the notions of injectivity and invertibility are equivalent. Henceforth, we use the terminology reversible CA (RCA) for such a CA, instead of injective CA or invertible CA, because an RCA is regarded as an analog of physically reversible space. (Note that, in some other computing models such as Turing machines, counter machines, and logic circuits, injectivity is trivially equivalent to invertibility, if they are suitably deﬁned. Therefore, for these models, we can directly deﬁne reversibility without introducing the notions of injectivity and invertibility.)

How Can We Find RCAs? The class of RCAs is a special subclass of CAs. Therefore, there arises a problem how we can ﬁnd or construct RCAs with some desired property. It is in general hard to do so if we use the conventional framework of CAs. This is because the following result is shown by Kari (1994) for the two-dimensional case (hence, it also holds for higher-dimensional CAs). Theorem 2 (Kari 1994) The problem whether a given two-dimensional CA is reversible is undecidable.

108

Reversible Cellular Automata

For the case of one-dimensional CA, it is known to be decidable. Theorem 3 (Amoroso and Patt 1972) There is an algorithm to test whether a given one-dimensional CA is reversible or not. There are also several studies on enumerating all reversible one-dimensional CAs (e.g., Boykett 2004; Mora et al. 2005). But it is generally difﬁcult to ﬁnd RCAs with speciﬁc properties such as computational universality, even for the onedimensional case. In order to make it feasible to design an RCA, several methods have been proposed until now. They are, for example, CAs with block rules (Margolus 1984; Toffoli and Margolus 1990), partitioned CAs (Morita and Harao 1989), CAs with second-order rules (Margolus 1984; Toffoli et al. 2004; Toffoli and Margolus 1990), and others (see, e.g., Toffoli and Margolus 1990). Here, we describe the ﬁrst two methods in detail. Cellular Automata with Block Rules Margolus (1984) proposed an interesting variant of a CA, by which he composed a computationally universal two-dimensional two-state RCA. In his model, all the cells are grouped into “blocks” of size 2 2 as shown in Fig. 1. A particular example of a transformation speciﬁed by “block rules” is shown in Fig. 2. This CA evolves as follows: At time 0, the local transformation is applied to every solid line block, then at time 1 to every dotted line block, and so on, alternately. Since this local transformation is injective, the global function of the CA is also injective. Such a neighborhood is called Margolus neighborhood. One can obtain reversible CAs, by giving an injective block transformation. However, CAs with Margolus neighborhood are not conventional CAs, because each cell should know the relative position in a block and the parity of time besides its own state. Related to this topic, Kari (1996) showed that every one- and two-dimensional RCA can be represented by a block permutations and translations.

Reversible Cellular Automata, Fig. 1 A cellular space with the Margolus neighborhood

Reversible Cellular Automata, Fig. 2 Block rules for the Margolus RCA (1984)

Partitioned Cellular Automata The method of using partitioned cellular automata (PCA) has some similarity to the one that uses block rules. However, resulting reversible CAs are in the framework of conventional CA (in other words, a PCA is a special subclass of a CA). In addition, ﬂexibility of neighborhood is rather high. A shortcoming of PCA is that, in general, the number of states per cell becomes large. Deﬁnition 3 A deterministic k-dimensional m-neighbor partitioned cellular automaton (PCA) is a system deﬁned by P ¼ ℤk , ðQ1 , . . . , Qm Þ, ðn1 , . . . , nm Þ, f , ð#1 , . . . , #m Þ ,

where ℤ is the set of all integers, Q i (i = 1,. . ., m) is a nonempty ﬁnite set of states of the i-th part of each cell (thus the state set of each cell is Q = Q1 Qm), (n1,. . ., nm) (ℤk)m is a neighborhood, f: Q ! Q is a local function, and (#1,. . ., #m) Q is a quiescent state that satisﬁes f (#1,. . ., #m) = (#1,. . ., #m). The notion of a ﬁnite (or inﬁnite) conﬁguration is deﬁned similarly as in CA. Let Conf(P) = {a| a:

Reversible Cellular Automata

109

ℤk ! Q}, and let pi: Q ! Qi be the projection function such that pi (q1,. . ., qm) = qi for all (q1,. . ., qm) Q. The global function F: Conf(P) ! Conf (P) of P is deﬁned as the one that satisﬁes the following formula:

t

8a Conf ðPÞ, x ℤk : FðaÞðxÞ ¼ f ðp1 ðaðx þ n1 ÞÞ, . . . , pm ðaðx þ nm ÞÞÞ

t +1

By the above deﬁnition, a one-dimensional PCA P1d with the neighborhood (1, 0, 1) can be deﬁned as follows:

L C R L C R L C R

f

x−1

Let (l, c, r), (l0, c0, r0) L C R. If f(l, c, r) = (l0, c0, r0), then this equation is called a local rule (or simply a rule) of the PCA P1d, and it is sometimes written in a pictorial form as shown in Fig. 4. Note that, in the pictorial representation, the arguments of the left-hand side of f(l, c, r) = (l0, c0, r0) appear in a reverse order. Similarly, a two-dimensional PCA P2d with von Neumann-like neighborhood is deﬁned as follows: P2d ¼ ðℤ2 , ðC, U, R, D, LÞ, ðð0, 0Þ, ð0, 1Þ, ð1, 0Þ, ð0, 1Þ, ð1, 0ÞÞ, f , ð#, #, #, #, #ÞÞ Figure 5 shows the cellular space of P2d and a pictorial representation of a local rule f(c, u, r, d, l) = (c0, u0, r0, d0, l0). Let P = (ℤk, (Q1,. . ., Qm), (n1,. . ., nm), f, (#1,. . ., #m)) be a k-dimensional PCA and F be its global function. It is easy to show the following proposition (a proof for the one-dimensional case given in Morita and Harao (1989) can be extended to higher dimensions).

x+1

Reversible Cellular Automata, Fig. 3 One-dimensional three-neighbor PCA P1d and its local function f

P1d ¼ ðℤ, ðL, C, RÞ, ð1, 0, 1Þ, f , ð#,#,#ÞÞ Each cell is divided into three parts, i.e., left, center, and right parts, and their state sets are L, C, and R. The next state of a cell is determined by the present states of the left part of the right-neighbor cell, the center part of this cell, and the right part of the left-neighbor cell (not depending on the whole three parts of the three cells). Figure 3 shows its cellular space and how the local function f works.

x

c

r

l

l c r

Reversible Cellular Automata, Fig. 4 A pictorial representation of a local rule f(l, c, r) = (l0, c0, r0) of a onedimensional three-neighbor PCA P1d

d r

c u

l

u l c r d

Reversible Cellular Automata, Fig. 5 Cellular space of a two-dimensional ﬁve-neighbor PCA P2d and its local rule

Proposition 1 The local function f is injective, iff the global function F is injective. It is also easy to see that the class of PCAs is a subclass of CAs. More precisely, the following proposition is derived by extending the domain of the local function of P. Proposition 2 For any k-dimensional m-neighbor PCA P, we have a k-dimensional m-neighbor CA A whose global function is identical with that of P.

110

Reversible Cellular Automata

By the above, if we want to construct an RCA, it is sufﬁcient to give a PCA whose local function f is injective. This makes a design of an RCA feasible.

As for one-dimensional CA with ﬁnite conﬁgurations, reversible simulation is possible without increasing the dimension.

Simulating Irreversible Cellular Automata by Reversible Ones

Theorem 5 (Morita 1995) For any onedimensional (irreversible) CA A with ﬁnite conﬁgurations, we can construct a one-dimensional RCA A0 that simulates A (but not in real time).

Toffoli (1977) ﬁrst showed that for every irreversible CA, there exists a reversible one that simulates the former by increasing the dimension by one. From this result, computational universality of two-dimensional RCA is derived, since it is easy to embed a Turing machine in a (irreversible) one-dimensional CA. Theorem 4 (Toffoli 1977) For any k-dimensional (irreversible) CA A, we can construct a (k + 1)dimensional RCA A0 that simulates A in real time. Although Toffoli’s proof is rather complex, the idea of the proof is easily implemented by using a PCA. Here we explain it informally. Consider a one-dimensional three-neighbor irreversible CA A that evolves as in Fig. 6. Then, we can construct a two-dimensional reversible PCA P that simulates A as shown in Fig. 7. The conﬁguration of A is kept in some row of P. A state of a cell of A is stored in the left, center, and right parts of a cell in P in triplicate. By this, each cell of P can compute the next state of the corresponding cell of A correctly. At the same time, the previous states of the cell and the left and right neighbor cells (which were used to compute the next state) are put downward as a “garbage” signal to keep P reversible. In other words, the additional dimension is used to record all the past history of the evolution of A. In this way, P can simulate A reversibly. t =0

q01

q02

q03

q04

1

q11

q12

q13

q14

2

q21

q22

q23

q24

3

q31

q32

q33

q34

Reversible Cellular Automata, Fig. 6 An example of an evolution in an irreversible one-dimensional CA A

1-D Universal Reversible Cellular Automata Computational universality of one-dimensional RCAs can be shown by constructing RCAs that simulate universal systems such as reversible Turing machines or cyclic tag systems. Simulating Reversible Turing Machines by 1-D RCAs It is possible to simulate reversible Turing machines by one-dimensional RCAs. We ﬁrst give deﬁnitions on reversible Turing machines. Then, we show how they can be simulated by RCAs. Bennett (1973) showed a nice construction method of a reversible Turing machine that simulates a given irreversible Turing machine and never leaves garbage signals on its tape at the end of computation. Though TMs of the quadruple formulation were used in Bennett (1973), here we use TMs of quintuple formulation (Morita 2008). Deﬁnition 4 A one-tape Turing machine (TM) is deﬁned by T ¼ ðQ, S, q0 , F, s0 , dÞ, where Q is a nonempty ﬁnite set of states, S is a nonempty ﬁnite set of symbols, q0 is an initial state (q0 Q), F is a set of ﬁnal (i.e., accepting) states (F Q), s0 is a special blank symbol (s0 S), and d is a move relation which is a subset of (Q S S {, 0, +} Q). The symbols “,” “0,” and “+” denote left shift, zero shift, and right shift of the head, respectively. A quintuple [qi, s, s0, d, qj ] (Q S S {, 0, +} Q) means that if T reads the symbol s in the state qi, then write s0 , shift the head to the direction d, and go to the state qj.

Reversible Cellular Automata

111

t =1

t =0 q01 q01 q01 q02 q02 q02 q03 q03 q03 q04 q04 q04

q11 q11 q11 q12 q12 q12 q13 q13 q13 q14 q14 q14 (q00 ,q01 ,q02 )

(q01 ,q02 ,q03 )

(q02 ,q03 ,q04 )

(q03 ,q04 ,q05 )

t =3

t =2 q21 q21 q21 q22 q22 q22 q23 q23 q23 q24 q24 q24

q31 q31 q31 q32 q32 q32 q33 q33 q33 q34 q34 q34

(q10 ,q11 ,q12 )

(q11 ,q12 ,q13 )

(q12 ,q13 ,q14 )

(q13 ,q14 ,q15 )

(q20 ,q21 ,q22 )

(q21 ,q22 ,q23 )

(q22 ,q23 ,q24 )

(q23 ,q24 ,q25 )

(q00 ,q01 ,q02 )

(q01 ,q02 ,q03 )

(q02 ,q03 ,q04 )

(q03 ,q04 ,q05 )

(q10 ,q11 ,q12 )

(q11 ,q12 ,q13 )

(q12 ,q13 ,q14 )

(q13 ,q14 ,q15 )

(q00 ,q01 ,q02 )

(q01 ,q02 ,q03 )

(q02 ,q03 ,q04 )

(q03 ,q04 ,q05 )

Reversible Cellular Automata, Fig. 7 Simulating the irreversible CA A in Fig. 6 by a two-dimensional reversible PCA P

The TM T is called deterministic if the following statement holds for any pair of distinct quintuples [p1, s1, t1, d1, q1] and [p2, s2, t2, d2, q2]: If p1 ¼ p2 , then s1 6¼ s2 : On the other hand, T is called reversible if the following statement holds for any pair of distinct quintuples [p1, s1, t1, d1, q1] and [p2, s2, t2, d2, q2]: If q1 ¼ q2 , then d1 ¼ d2 ^ t1 6¼ t2 : Note that multi-tape reversible TMs can also be deﬁned similarly. Hereafter, we consider only deterministic reversible and deterministic irreversible TMs. Hence, the term “deterministic” will be omitted. The next theorem shows computational universality of a reversible three-tape TM.

Theorem 6 (Bennett 1973) For any (irreversible) one-tape Turing machine, there is a reversible threetape Turing machine that simulates the former. It is also shown in Morita et al. (1989) that for any irreversible one-tape TM, there is a reversible one-tape two-symbol TM that simulates the former. To prove computational universality of a one-dimensional reversible PCA, it is convenient to simulate a reversible one-tape TM. The following theorem was ﬁrst shown in Morita and Harao (1989). Later, the number of states of a reversible PCA was reduced in Morita (2008) using an RTM of the quintuple formulation. Theorem 7 (Morita and Harao 1989) For any reversible one-tape TM T, there is a onedimensional three-neighbor reversible PCA P that simulates the former.

112

Reversible Cellular Automata

We show how P simulates T. Let T = (Q, S, q0, F, s0, d) be a reversible one-tape TM. We assume that q0 does not appear as the ﬁfth element in any quintuple in d, since we can always construct such a reversible TM from an irreversible one by a method given in Morita et al. (1989). We can also assume that for any [p, s, t, d, q] d, if q is a non-halting state, then d {, +}, and if q is a halting state, then d = 0. Now, let Q, Q0, and Q+ be as follows: Q ¼ fqj ∃p Q∃s, t Sð½p, s, t, , q dÞg Q0 ¼ fqj ∃p Q∃s, t Sð½p, s, t, 0, q dÞg Qþ ¼ fqj ∃p Q∃s, t Sð½p, s, t, þ , q dÞg Note that, since T is an RTM, Q, Q0, and Q+ are mutually disjoint. A reversible PCA P that simulates T is as follows: P ¼ ðℤ, ðL, C, RÞ, ð1, 0, 1Þ, f , ð#, s0 ,#ÞÞ L ¼ Q [ Q0 [ fq0 ,#g C¼S R ¼ Qþ [ Q0 [ fq0 ,#g The local function f is as below: 1. For each s, t S, and q Q (Q0 [ {q0}), deﬁne f as follows: f ð#, s,#Þ ¼ ð#, s,#Þ f ð#, s, q0 Þ ¼ ð#, s, q0 Þ f ðq0 , s,#Þ ¼ ðq0 , s,#Þ f ðq0 , s, q0 Þ ¼ ð#, t, qÞ if ½q0 , s, t, þ , q d f ðq0 , s, q0 Þ ¼ ðq, t,#Þ if ½q0 , s, t, , q d 2. For each p, q Q (Q0 [ {q0}), and s, t S, deﬁne f as follows: f ð#, s, pÞ ¼ ð#, t, qÞif p Qþ ^ ½p, s, t, þ , q d f ðp, s,#Þ ¼ ð#, t, qÞif p Q ^ ½p, s, t, þ , q d f ð#, s, pÞ ¼ ðq, t,#Þif p Qþ ^ ½p, s, t, , q d f ðp, s,#Þ ¼ ðq, t,#Þif p Q ^ ½p, s, t, , q d 3. For each p Q (Q0 [ {q0}), q Q0, and s, t S, deﬁne f as follows:

f ð#, s, pÞ ¼ ðq, t, qÞ f ðp, s,#Þ ¼ ðq, t, qÞ

if p Qþ ^ ½p, s, t, 0, q d if p Q ^ ½p, s, t, 0, q d

4. For each q Q0 and s S, deﬁne f as follows: f ð#, s, qÞ ¼ ð#, s, qÞ f ðq, s,#Þ ¼ ðq, s,#Þ We can see that the right-hand side of each rule in (1)–(4) differs from that of any other rule, since T is reversible. Hence, P is reversible. Assume that the initial computational conﬁguration of T is s0 t1 ti1 q0 ti tiþ1 tn s0 where tj S (j {1,. . ., n}). Then, set P to the following conﬁguration: ð#, s0 ,#Þð#, t1 ,#Þ ð#, ti1 , q0 Þð#, ti ,#Þ ðq0 , tiþ1 ,#Þ ð#, tn ,#Þð#, s0 ,#Þ Then, by the rules in (1)–(4), T is simulated step by step. If T becomes a halting state q ( Q0), then two signals qs are created by the rules in (3), and then travel leftward and rightward indeﬁnitely by the rules in (4). Note that P itself cannot halt, because P is reversible. But the ﬁnal tape of T is kept unchanged in P. Termination of a simulation can be sensed from the outside of P by observing if a ﬁnal state of T appears in some cell of P’s conﬁguration as a kind of a ﬂag. Example 1 Consider a small reversible TM Tparity = (Q, {0, 1}, q0, {qa}, 0, d) such that Q = {q0, q1, q2, qa, qr}, and d is as follows: d ¼ f½q0 , 0, 1, þ , q1 , ½q1 , 0, 1, 0, qa ; ½q1 , 1, 0, þ , q2 , ½q2 , 0, 1, 0, qr , ½q2 , 1, 0, þ , q1 g

For a given unary number n on the tape, Tparity checks if n is even or odd. If it is even, then Tparity halts in the ﬁnal (accepting) state qa; otherwise it halts in the rejecting state qr. All the symbols read by Tparity are complemented. The reversible PCA Pparity constructed by the above method is as follows:

Reversible Cellular Automata

113

Pparity ¼ ðℤ, ðL, C, RÞ, ð1, 0, 1Þ, f , ð#, 0,#ÞÞ L ¼ fq0 , qa , qr g C ¼ f0, 1g R ¼ fq 0 , q1 , q2 , qa , qr g

The local function f is as below:

Simulating Cyclic Tag Systems by 1-D RCAs

1. For each s {0, 1}, deﬁne f as follows: f ð#, s,#Þ ¼ ð#, s,#Þ f ð#, s, q0 Þ ¼ ð#, s, q0 Þ f ðq0 , s,#Þ ¼ ðq0 , s,#Þ f ðq0 , 0, q0 Þ ¼ ð#, 1, q1 Þ ðIt simulates ½q0 , 0, 1, þ , q1 Þ 2. Deﬁne f as follows: f ð#, 1, q1 Þ ¼ ð#, 0, q2 ÞðItsimulates ½q1 , 1, 0, þ , q2 Þ f ð#, 1, q2 Þ ¼ ð#, 0, q1 ÞðItsimulates ½q2 , 1, 0, þ , q1 Þ 3. Deﬁne f as follows: f ð#, 0, q1 Þ ¼ ðqa , 1, qa Þ ðIt simulates ½q1 , 0, 1, 0, qa Þ f ð#, 0, q2 Þ ¼ ðqr , 1, qr Þ ðIt simulates ½q2 , 0, 1, 0, qr Þ

4. For each s {0, 1} and q {qa, qr}, deﬁne f as follows: f ð#, s, qÞ ¼ ð#, s, qÞ f ðq, s,#Þ ¼ ðq, s,#Þ Computing process of Tparity for n = 2 is as follows: q0 0110 ‘ 1 q1 110 ‘ 10 q2 10 ‘ 100 q1 0 ‘ 100 qa 1. It is simulated by Pparity as shown in Fig. 8. Reversible Cellular Automata, Fig. 8 Simulating T parity by the reversible PCA Pparity. The state # is indicated by a blank

t =0

In Morita (2011a), a method of simulating a given reversible one-tape TM by a two-neighbor reversible PCA is shown. By this, the total number of states of a cell can be reduced.

From Theorem 6, we can see the existence of a universal reversible TM. In fact, several kinds of small universal reversible TMs have been given (see, e.g., Morita 2017a). Thus, from Theorem 7, a one-dimensional universal RCA can be constructed. However, the number of states of an RCA obtained by this method will become large. To get a universal RCA with a small number (say a few dozens) of states, we need another useful framework of a universal system. A cyclic tag system (CTAG) is proposed by Cook (2004) to show universality of the elementary cellular automaton of rule 110. As we shall see, it is also useful for composing simple universal RCAs. Deﬁnition 5 A cyclic tag system (CTAG) is deﬁned by C = (k, (p0,. . ., pk 1)), where k (k = 1, 2,. . .) is the length of a cycle (i.e. period) and (p0,. . ., pk 1) ({Y, N})k is a k-tuple of production rules. A pair (v, m) is called an instantaneous description (ID) of C, where v {Y, N} and m {0,. . ., k 1}. The nonnegative integer m is called a phase of the ID. A transition relation ) on the set of IDs is deﬁned as follows. For any (v, m), (v0, m0) {Y, N} {0,. . ., k 1},

0 q0

0

q0 1

1

0

0

0

1

0

1 q1

1

1

0

0

0

2

0

1

0 q2

1

0

0

0

0

0

0

qa 1 q a

0

0

3

0

1

0

0 q1

4

0

1

0

0

5

0

1

0

qa 0

1

0 qa

0

6

0

1

qa 0

0

1

0

0 qa

114

ðYv, mÞ ) ðv0 , m0 Þ if ½m0 ¼ m þ 1modk ^ ½v0 ¼ vpm , ðNv, mÞ ) ðv0 , m0 Þ if ½m0 ¼ m þ 1modk ^ ½v0 ¼ v:

A sequence of IDs (v0, m0), (v1, m1),. . . is called a computation starting from v {Y, N} if (v0, m0) = (v, 0) and (vi, mi) ) (vi + 1, mi + 1) (i = 0, 1,. . .). (In what follows, we write a computation by (v0, m0) ) (v1, m1) ) ). A CTAG is a variant of a classical tag system (see, e.g., Minsky 1967) such that production rules are applied cyclically. If the ﬁrst symbol of a host (i.e., rewritten) string is Y, then it is removed, and a speciﬁed string at that phase is attached to the end of the host string. If it is N, then it is simply removed and no string is attached. Example 2 Let us consider the CTAG C0 = (3, (Y, NN, YN)). If we give NYY to C0 as an initial string, then ðNYY, 0Þ ) ðYY, 1Þ ) ðYNN, 2Þ ) ðNNYN, 0Þ ) ðNYN, 1Þ ) ðYN, 2Þ is an initial segment of a computation starting from NYY. In Cocke and Minsky (1964) and Minsky (1967), it was shown that a two-tag system, which is a special class of classical tag systems, is universal. The following theorem shows universality of CTAG. Theorem 8 (Cook 2004) For any two-tag system, there is a CTAG that simulates the former. It was shown that there are universal onedimensional RCAs that can simulate any CTAG (Morita 2007, 2011). Theorem 9 (Morita 2011) There is a 24-state onedimensional two-neighbor reversible PCA P24 that can simulate any CTAG on inﬁnite (leftward-periodic) conﬁgurations. Theorem 10 (Morita 2007) There is a 98-state one-dimensional three-neighbor reversible PCA P98 that can simulate any CTAG on ﬁnite conﬁgurations. (Note: it can also manage halting of a CTAG.)

Reversible Cellular Automata

The reversible PCA P24 in Theorem 9 is as follows: P24 ¼ Z, ðfY, N,þ ,g, fy, n, þ , , ,=gÞ, 0, 1 , f 24 , ðY,Þ

The state set of each cell is {Y, N, +, } {y, n, +, , , /}, and thus P24 has 24 states. The local function f24 is as below. It is easy to see that f24 is injective: f 24 ðc, r Þ ¼ ðc, r Þ if c fY, N g, r fy, n, þ , ,=g f 24 ðY,Þ ¼ ðþ,=Þ f 24 ðN,Þ ¼ ð,=Þ f 24 ð, r Þ ¼ ð, r Þ if r fy, n,g f 24 ðc, r Þ ¼ ðr, cÞ if c fþ,g, r fþ,g f 24 ðþ, yÞ ¼ ðY,Þ f 24 ðþ, nÞ ¼ ðN,Þ f 24 ðþ,=Þ ¼ ðþ, yÞ f 24 ð,=Þ ¼ ðþ, nÞ f 24 ðþ,Þ ¼ ðþ,Þ Consider the CTAG C0 in Example 2. The computation in C0 starting from NYY is simulated in P24 as shown in Fig. 9. The production rules are given by a sequence consisting of the states (, y), (, n), (, ), and (, ) in a reverse order, where the sequence (, )(, ) is used as a delimiter indicating the beginning of a rule. Thus, one cycle of the rules (Y, NN, YN) is (, n)(, y)(, )(, )(, n) (, n)(, )(, )(, y)(, )(, ). We should give inﬁnite copies of this sequence to the left, since these rules are applied cyclically. We can see the right-part states y, n, , and in this sequence act as right-moving signals. The initial string NYY is given to the right of it by the sequence (N, )(Y, )(Y, ) (, ), where (, ) is a delimiter. All the cells right to this sequence are set to (Y, ).

2-D Universal Reversible Cellular Automata That Can Simulate Reversible Logic Gates A logic gate is called reversible if its logical function is injective. Fredkin gate (Fredkin and Toffoli 1982) is one of the typical reversible logic gates, which has three input lines and three output

Reversible Cellular Automata

t 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23

− − − − − − − − − − − − − − − − − − − − − − − −

n ∗ − y ∗ − n n ∗ − y n ∗ − y ∗ − n n ∗ − y n ∗

− − − − − − − − − − − − − − − − − − − − − − − −

y n ∗ − y ∗ − n n ∗ − y n ∗ − y ∗ − n n ∗ − y n

− − − − − − − − − − − − − − − − − − − − − − − −

− y n ∗ − y ∗ − n n ∗ − y n ∗ − y ∗ − n n ∗ − y

− − − − − − − − − − − − − − − − − − − − − − − −

∗ − y n ∗ − y ∗ − n n ∗ − y n ∗ − y ∗ − n n ∗ −

− − − − − − − − − − − − − − − − − − − − − − − −

n ∗ − y n ∗ − y ∗ − n n ∗ − y n ∗ − y ∗ − n n ∗

− − − − − − − − − − − − − − − − − − − − − − − −

115

n n ∗ − y n ∗ − y ∗ − n n ∗ − y n ∗ − y ∗ − n n

− − − − − − − − − − − − − − − − − − − − − − − −

− n n ∗ − y n ∗ − y ∗ − n n ∗ − y n ∗ − y ∗ − n

− − − − − − − − − − − − − − − − − − − − − − − −

∗ − n n ∗ − y n ∗ − y ∗ − n n ∗ − y n ∗ − y ∗ −

− − − − − − − − − − − − − − − − − − − − − − − −

y ∗ − n n ∗ − y n ∗ − y ∗ − n n ∗ − y n ∗ − y ∗

− − − − − − − − − − − − − − − − − − − − − − − −

− y ∗ − n n ∗ − y n ∗ − y ∗ − n n ∗ − y n ∗ − y

− − − − − − − − − − − − − − − − − − − − − − − −

∗ − y ∗ − n n ∗ − y n ∗ − y ∗ − n n ∗ − y n ∗ −

N − − − − − − − − − − − − − − − − − − − − − − −

− / − y ∗ − n n ∗ − y n ∗ − y ∗ − n n ∗ − y n ∗

Y Y Y Y Y + − − − − − − − − − − − − − − − − − −

− − / − y / + n n ∗ − y n ∗ − y ∗ − n n ∗ − y n

Y Y Y Y Y Y Y Y Y Y + − − − − − − − − − − − − −

− − − / − y / + n n / + y n ∗ − y ∗ − n n ∗ − y

− − − − + − − + + N N N N N N − − − − − − − − −

− − − − n + y n + ∗ n / + y n / − y ∗ − n n ∗ −

Y Y Y Y Y Y Y Y Y Y + N N N N N N N N − − − − −

− − − − − n + y n + / ∗ / + y n / − y / − n n ∗

Y Y Y Y Y Y Y Y Y Y Y Y + + + Y Y Y Y Y Y Y Y Y

− − − − − − n + y n + / / y + ∗ n / − y / − n n

Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y + N N N N N N N

− − − − − − − n + y n + / / y + / ∗ / − y / − n

Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y + + − − + −

− − − − − − − − n + y n + / / y + / / y + y n +

Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y

− − − − − − − − − n + y n + / / y + / / y + y n

Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y

− − − − − − − − − − n + y n + / / y + / / y + y

Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y

− − − − − − − − − − − n + y n + / / y + / / y +

Reversible Cellular Automata, Fig. 9 Simulating the CTAG C 0 by the reversible PCA P24 (Morita 2011)

Reversible Cellular Automata, Fig. 10 Fredkin gate

c p q

x=c y = cp + cq z = cp + cq

c

y1 y2

cx

y3

c

x

x (a)

lines (Fig. 10). A reversible logic gate is called logically universal, if any reversible sequential machine (i.e., ﬁnite automaton with output ports as well as input ports) can be realized using only copies of it and delay elements. Since a ﬁnite control and tape cells of a reversible Turing machine are formulated as reversible sequential machines, we can construct any reversible Turing machine by them. Therefore, if an RCA can simulate any circuit composed of a universal reversible gate, we can say it is computationally universal. It is known that Fredkin gate is a universal reversible gate (Fredkin and Toffoli 1982). In Morita (1990) a construction method of a reversible sequential machine out of Fredkin gates is given. It is also known that Fredkin gate can be composed of switch gate and inverse switch gate (Fig. 11) (Fredkin and Toffoli 1982). Hence, the set of switch gate and its inverse is logically universal.

c cx

(b)

Reversible Cellular Automata, Fig. 11 (a) Switch gate. (b) Inverse switch gate, where c = y1 and x = y2 + y3 under the assumption ððy2 ! y1 Þ ^ ðy3 ! y1 ÞÞ

We show several two-dimensional RCAs in which switch gate and its inverse are embeddable. By this, we obtain very simple computationally universal 2-D RCAs. 2-D Universal RCAs on a Square Tessellation Here, three models of simple universal RCAs on a square tessellation are explained. The ﬁrst one is a two-state RCA with Margolus neighborhood. The second and the third are 16-state reversible PCAs. Two-State RCA with Margolus Neighborhood

Margolus (1984) ﬁrst showed a two-dimensional RCA in which any circuit composed of Fredkin gates can be simulated. His model is an RCA with the Margolus neighborhood (Fig. 1) and has the block rules given in Fig. 2. He showed that the

116 Reversible Cellular Automata, Fig. 12 The local function of the 16-state rotation-symmetric reversible PCA S1 (Morita and Ueno 1992)

Reversible Cellular Automata •

•

•

• •

•

• •

•

•

Reversible Cellular Automata, Fig. 13 Switch gate realized in the reversible PCA S1 (Morita and Ueno 1992). The moving direction of a signal is changed by reﬂectors. Small circles show virtual collision points of signals

• • •

•

• • • •

•

•

•

•

•

•

c

cx ↑

↑

••

• • • • •• • • • • •• ••

••

• • • • •• • • • • •• ••

c→

•

•• • • • ••• •• • • • ••• •• • • • • •• • • • • •• ••

• • •

•• • • • ••• ••• • • • • • •• •• •• ••

→ cx

•• • • • • • • •• • • •• ••• • • • •• •• •• • • • ••• •• • • •• ••

↑

x billiard ball model (BBM) (Fredkin and Toffoli 1982) of computation is simulated in its cellular space. The BBM is a kind of physical model of computation where a signal is represented by an ideal ball, and logical operations and signal routing can be performed by their elastic collisions and reﬂections by reﬂectors. Since switch gate and its inverse can be realized in the BBM (Fredkin and Toffoli 1982), computational universality of the Margolus’ RCA is concluded. A 16-State Reversible PCA Model S1

If we use the framework of a PCA to simulate reversible logic gates, we can obtain a standard type of an RCA (see Proposition 2), though the total number of states of a cell is larger than that of the RCA of Margolus neighborhood. The model

S1 (Morita and Ueno 1992) is a four-neighbor rotation and reﬂection-symmetric reversible PCA. A cell is divided into four parts, and each part has the state set {0, 1}. Its local transition rules are shown in Fig. 12. Rotated rules are omitted since it is rotation-symmetric. The states 0 and 1 are represented by a blank and a dot, respectively. The set of these rules has some similarity with that of Margolus’ RCA, and in fact, it can simulate the BBM in a similar manner. In S1, a signal is represented by two particles. Figure 13 gives a conﬁguration of a switch gate module in S1. The moving direction of a signal is controlled by a reﬂector pattern, and the switch gate operation is realized by two collisions of signals. It is also possible to realize an inverse switch gate. Thus, S1 is computationally universal.

Reversible Cellular Automata

117

A 16-State Reversible PCA Model S2

three parts, each of which has its own state set (Fig. 16). The next state of a cell is determined by the present states of the three edge-adjacent parts of the neighboring cells. The reason we use TPCAs here is that their local functions can be simpler than those of PCAs on a square lattice, since the number of edge-adjacent cells are only three. Hence, it is convenient to study how computational universality emerges from a simple reversible local function. An elementary triangular partitioned cellular automaton (ETPCA) is a TPCA such that each part of a cell has the state set {0, 1}, and it is rotation-symmetric (i.e., isotropic) (Morita 2016a). A local function of an ETPCA is speciﬁed by only four local transition rules. Figure 17 shows an example of local rules of an ETPCA, by which a local function is completely determined. Each ETPCA is referred by a four-digit

The second computationally universal model S2 (Morita and Ueno 1992) is also a four-neighbor reversible PCA having the set of local rules shown in Fig. 14. It is rotation-symmetric but not reﬂection-symmetric. In S2, reﬂection of a signal by a reﬂector is different from that in S1, i.e., only left turn is possible. Hence, right turn should be realized by three left turns. The other features are similar to S1. Figure 15 shows a conﬁguration of a switch gate.

2-D Universal RCAs on a Triangular Tessellation Next, we give three models of computationally universal reversible triangular partitioned cellular automata (TPCAs). In a TPCA, the shape of a cell is an equilateral triangle, and it is divided into Reversible Cellular Automata, Fig. 14 The local function of the 16-state rotation-symmetric reversible PCA S2 (Morita and Ueno 1992)

•

•

• •

• •

•

• •

•

• •

Reversible Cellular Automata, Fig. 15 Switch gate realized in the reversible PCA S2 (Morita and Ueno 1992)

•

•

• • • •

•

•

• •

•

•

c ↑

••

••

• • •• ••

• • •• ••

•• • • •• ••

•• • • •• ••

•• • • •• ••

c→

•

→ cx

•• • • •• • •

•• • • •• ••

•• • • •• •• •• • • •• ••

•• • • •• ••

•• • • •• ••

•• • • • • • • •• • • •• ••

• • •• • • •• ••

• ↑

x

•• • • •• ••

→ cx

118

Reversible Cellular Automata

number that is obtained by reading the bit patterns of the right-hand sides of the four local rules as binary numbers. The identiﬁcation number of the ETPCA shown in Fig. 17 is 0457. There are 256 ETPCAs in total, and 36 ETPCAs among them are reversible (Morita 2016a). For example, ETPCA 0457 is reversible, since there is no pair of rules that have the same right-hand side. In the following, we investigate three reversible ETPCAs 0157, 0137, and 0347. In spite of the simplicity of their local functions, they are computationally universal, since universal reversible logic gates can be realized in their cellular space. ETPCA 0157

This model was ﬁrst studied in Imai and Morita (2000). Its local function is shown in Fig. 18. It is easy to see that the local function is injective. Thus, it is a reversible ETPCA. In ETPCA 0157, a signal is represented by a single particle, and switch gate is realized by one cell as shown in Fig. 19. However, signal routing, crossing, and delay are very complex to realize. Since a single particle simply rotates around some point, a “wall,” along which a particle goes, is used for

signal routing. It is composed of stable blocks, each of which consists of 12 particles as in Fig. 20. Crossing of two signals and delay of a signal are implemented using auxiliary control particles as well as blocks (see Imai and Morita 2000 for details). Figure 20 shows a switch gate module implemented in the ETPCA 0157 (the original pattern of a switch gate module in Imai and Morita 2000 is reduced in its size here). Combining two switch gates and two inverse switch gates, a Fredkin gate module is obtained (Fig. 21). By the above, we can conclude ETPCA 0157 is computationally universal. It should be noted that the local rules of ETPCA 0457 (Fig. 17) are the mirror images of those of ETPCA 0157. Hence, conﬁgurations of ETPCA 0157 are directly simulated by their mirror images in ETPCA 0457. Likewise, the local rules of ETPCAs 0267 and 0237 are obtained from ETPCAs 0157 and 0457, respectively, by the complementation (i.e., 0-1 exchange) of each rule. Therefore, ETPCAs 0267 and 0237 are also computationally universal. A similar argument can be applied to ETPCAs 0137 and 0347 below. ETPCA 0137

Reversible Cellular Automata, Fig. 16 Cellular space of a triangular partitioned cellular automaton (TPCA)

, 0

•

•

,

The second ETPCA is the one whose local function is shown in Fig. 22 (Morita 2016b). Again, it is easy to see the local function is injective. Similar to the case of ETPCA 0157, a signal is represented by a single particle, and the switch gate operation is realized by one cell (Fig. 23). In this case, a stable block consists of six particles, from which transmission wire is composed. Crossing of signals and signal delay is also realized using auxiliary control particles. Figure 24

•

•

••

,

• •

5

4

•

•• • 7

Reversible Cellular Automata, Fig. 17 The set of four local rules of ETPCA 0457, which deﬁnes its local function

, 0

•

• 1

,

•

•

••

,

•

5

Reversible Cellular Automata, Fig. 18 The local function of the reversible ETPCA 0157

• •

•• • 7

Reversible Cellular Automata

119

shows a switch gate module in the ETPCA 0137. We can construct inverse switch gate in a similar manner. Hence, ETPCA 0137 is computationally universal.

ETPCA 0347

The third ETPCA has the local function shown in Fig. 25. This ETPCA was proposed in Morita (2016a). It is easy to see ETPCA 0347 is reversible. It should be noted that ETPCAs 0157 and 0137 are conservative in the sense that the number of particles is conserved in each local rule. On the other hand, ETPCA 0347 is nonconservative. ETPCA 0347 shows quite complex and interesting behavior. In particular, a moving object called a glider exists (Fig. 26), which can be

c x

cx c cx

0

Reversible Cellular Automata, Fig. 19 Switch gate operation is realized by one cell of the reversible ETPCA 0157

•

c→

• • •• • 5 • • • • • •• •

• •• • • • • • • •• • •

51 49 5 50 6 7 7 6 8 49 50 9 10 43 15

• •• • • • • • • • 19 38• •• • •• • • • • 34• •• • 24 29 28

20

27 25 26 27 25 26 24

• •• • • •• • • • • • • • 10 • •• • • •• • 15

x→

• •• • • •• • • •• • • •• • 75 • • • • • • • • • • 78 →c • •• • • •• • • •• • • •• • • •• • • • • • • •• •

52 53

• • •• • 5 • • 8 • • • •• • • •• • • •• • • • • • • • • •• • • •• • • •• • • • • • • •• •

58

62

70

66

38

• •• • 43 • • • • 28 29 •• • • 47 • • •••• •• • • • • • • • ••• •• • • •• • • 52 • • • • • •• • 56 33

58

• •• • 63 • • • • • •• •

78

• •• • • • • • 68 • •• • 73

→ cx

• •• • • • • • • •• •

65

•

→ cx • •• • • •• • • •• • • •• • • •• • • •• • • •• • • • • • • • • • • • • • • • • • • •• • • •• • • •• • • •• • • •• • • •• • • •• •

Reversible Cellular Automata, Fig. 20 Switch gate module realized in the reversible ETPCA 0157. The cell that performs the switch gate operation is indicated by bold lines

120

Reversible Cellular Automata

Reversible Cellular Automata, Fig. 21 Fredkin gate module realized in the reversible ETPCA 0157

, 0

•

•

,

1

•

•

• • 3

,

•

• •

•• • 7

Reversible Cellular Automata, Fig. 22 The local function of reversible ETPCA 0137

c

x

cx cx c

0

Reversible Cellular Automata, Fig. 23 Switch gate operation is realized by one cell of the reversible ETPCA 0137

used to represent a signal. The moving direction of a glider is controlled by appropriately placing copies of the pattern block, which consists of nine particles in this ETPCA. As shown in Fig. 27, if a glider collides with a sequence of two blocks, it ﬁrst splits into two small objects (t = 56). But they are ﬁnally combined to form a glider again, and it goes to the south-west direction (t = 334). By this, a 120 right turn is realized. Sequences of three and ﬁve blocks also act as right-turn modules. It has been shown that left turn, backward turn, and U-turn are possible by the patterns composed of several blocks (Morita 2016a). Furthermore, it is known that the phase of a glider is adjusted by these turn modules. Colliding two gliders appropriately, switch gate operation is realized as shown in Fig. 28. Figure 29 is a switch gate module in the ETPCA 0347, where many turn modules are placed to control the move directions and phases of gliders.

Inverse switch gate is constructed likewise, and thus ETPCA 0347 is computationally universal. Simulating Reversible Counter Machines by 2-D RCAs Besides reversible logic gates like switch gate and Fredkin gate, there are also reversible logic elements with memory that have universality. A rotary element (RE) (Morita 2001) is typical one of such elements. An RE has four input lines {n, e, s, w} and four output lines {n0, e0, s0, w0} and has two states called state H and state V shown in Fig. 30 (hence it has a one-bit memory). All the values of inputs and outputs are either 0 or 1. Here, the input (and the output) is restricted as follows: at most one signal “1” appears as an input (output) at a time. The operation of an RE is undeﬁned for the cases that signals 1’s are given to two or more input lines. We employ the following intuitive interpretation for the operation of an RE. Signals 1 and 0 are interpreted as existence and nonexistence of a particle. An RE has a “rotatable bar” to control the moving direction of a particle. When no particle exists, nothing happens on the RE. If a particle comes from a direction parallel to the rotatable bar, then it goes out from the output line of the opposite side (i.e., it goes straight

Reversible Cellular Automata

x→

121

•

• • • • •5 • • •

• • •19 • • • 24

• •• • • •

12, 14

7

25

• • •39 • • • 44

• •• • • •

• •• • • •

→ cx

34

26

25

•

c→

23

27 26 28 29 27 28

• • • •5 • • • 10

• • •47 • • • 52

• • •13 • • • 18 • • •21 • • • 26 • • •29 • • •

53

54

• • •• • 116 • • 126

121

• • •75 • • • 80 70

65 53

• •• • • • 88 62

55 54 56 57 55

• • •57 56 • 42 • • 62 52

47

• • •65 36 • • 70 31 • • • • • • • • • •73 • • • 78 39

• •• • 108 • •

113

85

• • •91 • • •

• • •103 • • •

• •• • • •

98

93

105

•

• • •109 • 94 • •114 104

99

• • •85 • • •

• •• 116 • • •• • • • • •

• •• • • • 92

80

87

→ cx

124,126

119

→c

Reversible Cellular Automata, Fig. 24 Switch gate module in the reversible ETPCA 0137 (Morita 2016b)

, 0

•

• • 3

,

•

•

• 4

,

•

• •

•• • 7

Reversible Cellular Automata, Fig. 25 The local function of the reversible ETPCA 0347

ahead) without affecting the direction of the bar (Fig. 31a). If a particle comes from a direction orthogonal to the bar, then it makes a right turn and rotates the bar by 90 (Fig. 31b). It is clear its operation is reversible.

It has been shown that any reversible twocounter machine can be implemented in a quite simple way by using REs and some additional elements (Morita et al. 2002). Since a reversible two-counter machine is known to be universal

122

Reversible Cellular Automata

t =0 •

t =1 •

••

••

••

••

••

••

•

•

••

••

•

•

•

••

••

•

t =6

t =5

t =4 •

•

•

t =3

t =2

•

••

••

•

• ••

••

Reversible Cellular Automata, Fig. 26 Glider in the ETPCA 0347

•

•

••• • •• •• •

••

••

t = 334

t = 56

t =0 ••• • •• •• •

••

••

•• •• •• • • •• ••••

••• • •• •• • ••

••• • •• •• •

•

•• ••

••• • •• •• •

• •

Reversible Cellular Automata, Fig. 27 Right turn of a glider by a sequence of two blocks in the ETPCA 0347

t =0

c ••

t = 48 c

t = 24 c

• •

••

••

x

•

• ••

••

x

•

• • •

••

••

••

cx

x ••

cx

• ••

•

••

• •

••

c

Reversible Cellular Automata, Fig. 28 Switch gate operation in the ETPCA 0347

(Morita 1996), such a reversible PCA is also universal. A counter machine (CM) is a simple computation model consisting of a ﬁnite number of counters and a ﬁnite-state control (Minsky 1967).

In Morita (1996) a CM is deﬁned as a kind of multi-tape Turing machine whose heads are readonly ones and whose tapes are all blank except the leftmost squares as shown in Fig. 32 (P is a blank

Reversible Cellular Automata

123

t = 2232 • •• •• • • ••

••• • •• •• •

••• • •• •• •

••• • •• •• •

• •• •• • • ••

• •• •• • • ••

• •• •• • • ••

• ••• • •• •• • • •• •• •• • •• • • • • •• •• • • • •• •• ••• ••• • • ••

• •• •• • • •• ••• • •• •• •

• •• •• • • ••

• •• •• • • ••

• •• •• • • ••

••• • •• •• •

c

•

• ••

••• • • • ••• • •• • •• •• • • •• •• • • ••• • •• •• •• •• • • • •• •• •

•• • •• •• • • ••

• •• •• • • ••

• •• •• • • ••

• •• •• • • ••

••• • •• •• •

••• • •• •• •

••• • •• •• • ••• • •• •• • ••• • •• •• •

x

•

••

••• • •• •• •

• •• •• • • ••

• •• •• • • ••

• •• •• • • ••

• •• •• • • ••

• •• •• • • ••

• •• •• • • ••

• •• •• • • ••

• •• •• • • •• • •• •• • • ••

••• • •• •• •

•

• •• •• • • ••

•

••

c

•

••

cx

••

••• • •• •• •

••• • •• •• •

• •• •• • • ••

• •• •• • • ••

• •• •• • • •• • •• •• • • ••

••• • • • ••• • •• • ••• • •• •• •• •• • •

• •• •• • • •• • •• •• • • ••

• •• •• • • ••

• •• •• • • ••

••• • •• •• •

••• • •• •• •

••

• •• •• • • ••

••• • •• •• •

••• • •• •• • •

••• • •• •• •

••• • •• •• •

••• • •• •• •

• •• •• • • ••

•

••

••• • •• •• • • •• •• • • ••

••• • •• •• •

• •• •• • • ••

••• • •• •• •

••• • •• •• •

cx

• •• •• • • •• • •• •• • • •• ••• • •• •• •

• •• •• • • •• • •• •• • • ••

••• • •• •• • ••• • • • ••• • •• • ••• • •• •• •• •• • • • •• •• • • ••

••• • •• •• •

• •• •• • • ••

••• • •• •• •

• •• •• • • ••

Reversible Cellular Automata, Fig. 29 Switch gate module in the ETPCA 0347 (Morita 2016a). Switch gate operation (Fig. 28) is performed in the middle of this pattern

n

n

n

n

w

e

w

e

w

e

w

e

s

s

State V

s

t +1

t

s

n

n

w

e

w

e

State H

Reversible Cellular Automata, Fig. 30 Two states of a rotary element (RE)

symbol). This deﬁnition is convenient for giving the notion of reversibility on a CM. It is known that a CM with two counters is computationally universal (Minsky 1967). This result also holds even if the reversibility constraint is added as shown in the next theorem.

n

s

s

n

n e

w

e s

w

e

w

e

(a)

w

s

⇒

⇒ (b)

n

s

s

n

n

w

e

w

e s

s

Reversible Cellular Automata, Fig. 31 Operations of an RE: (a) the parallel case and (b) the orthogonal case

124

Reversible Cellular Automata

q 2 Z P P P P P P P ·

·

·

0 Z P P P P P P P ·

·

·

Element name

Pattern

LR-turn element

◦◦ ◦◦ ◦◦ ◦◦

R-turn element

◦◦ ◦◦ ◦◦ ◦◦ ◦◦ ◦◦• • ◦◦ ◦◦ • • •• ••• • • • • • ◦◦ ◦◦ • •◦◦ ◦◦ ◦◦ ◦◦ ◦◦ ◦◦

Reflector

◦◦ ◦◦ ◦◦ ◦◦ ◦◦ ◦◦ • •◦◦ ◦◦ • • ◦◦ ◦◦• • ◦◦ ◦◦ ◦◦ ◦◦ ◦◦ ◦◦

Rotary element

◦◦ ◦• •◦ ◦◦ ◦• ••◦ ◦ ◦ ◦•• •◦ ◦ ◦ ◦ ◦ ◦ ◦ ◦ ◦ ◦ ◦ ◦• ••◦ ◦ ◦ ◦•• •◦ ◦◦ ◦• •◦ ◦◦

Reversible Cellular Automata, Fig. 32 A counter machine with two counters

◦

◦

◦

•

• • •

•

•

•

•

◦ • ◦ • •

◦ •

•

•

•

•

• •

◦ ◦

•

◦ •

◦

◦ • •

z

◦

◦

•

• • ◦

•

• ◦ • •

◦

• ◦ •

x

w z x y

w

•

• ◦ ◦

◦ • ◦

◦ ◦

◦ ◦ •

y

◦ ◦ • ◦

Reversible Cellular Automata, Fig. 33 The local function of the 81-state rotation-symmetric reversible PCA P3 (Morita et al. 2002). The last rule scheme represents 33 rules not speciﬁed by the others, where w, x, y, z {blank, ○, ●}

Theorem 11 (Morita 1996) For any Turing machine T, there is a deterministic reversible CM with two counters M that simulates T. An 81-State Reversible PCA Model P3

Any reversible CM with two counters is embeddable in the model P3 with the local

Position marker

◦

Reversible Cellular Automata, Fig. 34 Basic elements realized in the reversible cellular space of P3 (Morita et al. 2002)

function shown in Fig. 33 (Morita et al. 2002). In P3, ﬁve kinds of signal processing elements shown in Fig. 34 can be realized. Here, a single ● acts as a signal. An LR-turn element, an R-turn element, and a reﬂector in Fig. 34 are used for signal routing. Figure 35 shows the operations of an RE in the P3 space. A position marker is used to keep a head position of a CM, and realized by a single ○, which rotates clockwise at a certain position by the ﬁrst rule in Fig. 33. Figure 36 shows the pushing and pulling operations of a position marker. Figure 37 shows an example of a whole conﬁguration for a reversible CM with two counters embedded in the P3 space. In this model, no

Reversible Cellular Automata

t =0

125

t =1

◦◦ ◦• •◦ ◦◦ ◦• ••◦ ◦ ◦ ◦•• •◦ ◦ ◦ ◦ ◦ ◦ ◦ ◦ ◦ ◦ ◦ ◦• ••◦ ◦ ◦ ◦•• •◦ ◦◦ ◦• • •◦ ◦◦

◦◦ ◦• •◦ ◦◦ ◦• ••◦ ◦ ◦ ◦•• •◦ ◦ ◦ ◦◦ ◦◦◦ ◦ ◦ ◦ ◦• ••◦ ◦ ◦ ◦•• •◦ ◦◦ ◦• •◦ ◦◦ •

t =2

◦◦ ◦• •◦ ◦◦ ◦• ••◦ ◦ ◦ ◦•• •◦ ◦ ◦ ◦◦ ◦◦◦ ◦ ◦ • ◦ ◦• ••◦ ◦ ◦ ◦•• •◦ ◦◦ ◦• •◦ ◦◦

t =3

◦◦ ◦• •◦ ◦◦ ◦• ••◦ ◦ ◦ ◦•• •◦ ◦ ◦ ◦ ◦•◦ ◦ ◦ ◦ ◦ ◦• ••◦ ◦ ◦ ◦•• •◦ ◦◦ ◦• •◦ ◦◦

t =4

t =5

t =4

t =5

◦◦ ◦• •◦ ◦◦ ◦• ••◦ ◦•◦ ◦•• •◦ ◦ ◦ ◦◦ ◦◦ ◦ ◦ ◦ ◦ ◦• ••◦ ◦ ◦ ◦•• •◦ ◦◦ ◦• •◦ ◦◦

• ◦◦ ◦◦ ◦• • ◦ ◦• ••◦ ◦ ◦ ◦•• •◦ ◦ ◦ ◦ ◦ ◦ ◦ ◦ ◦ ◦ ◦ ◦• ••◦ ◦ ◦ ◦•• •◦ ◦◦ ◦• •◦ ◦◦

(a) t =0

t =1

◦◦ ◦• •◦ ◦◦ ◦• ••◦ ◦ ◦ ◦•• •◦ ◦ ◦ ◦ ◦ ◦ ◦ ◦ ◦ ◦ ◦ ◦• ••◦ ◦ ◦ ◦•• •◦ ◦◦ ◦• •◦ ◦◦

◦◦ ◦• •◦ ◦◦ ◦• ••◦ ◦ ◦ ◦•• •◦ ◦ ◦ ◦ ◦ ◦ ◦ ◦ ◦ ◦ ◦ ◦• ••◦ ◦ ◦ ◦•• •◦ ◦◦ ◦• • •◦ ◦◦

•

t =2

◦◦ ◦• •◦ ◦◦ ◦• ••◦ ◦ ◦ ◦•• •◦ ◦ ◦ ◦ ◦ ◦ ◦ ◦ ◦ • ◦ ◦• ••◦ ◦ • ◦•• •◦ ◦◦ ◦• •◦ ◦◦

t =3

◦◦ ◦• •◦ ◦◦ ◦• ••◦ ◦ ◦ ◦•• •◦ ◦ ◦ ◦ ◦ • ◦ ◦ ◦ ◦ • ◦• ••◦ ◦ ◦ ◦•• •◦ ◦◦ ◦• •◦ ◦◦

◦◦ ◦• •◦ ◦◦ ◦• ••◦ ◦ ◦ ◦•• •◦ ◦ ◦ ◦◦ ◦◦ ◦ ◦• ◦ ◦ ◦• ••◦ ◦ ◦ ◦•• •◦ ◦◦ ◦• •◦ ◦◦

◦◦ ◦• •◦ ◦◦ ◦• ••◦ ◦ ◦ ◦•• •◦ ◦ ◦ ◦ ◦ ◦ ◦ • ◦ ◦ ◦ ◦ ◦• ••◦ ◦ ◦ ◦•• •◦ ◦◦ ◦• •◦ ◦◦

(b) Reversible Cellular Automata, Fig. 35 Operations of RE in P3: (a) the parallel case and (b) the orthogonal case

t =0 ◦

t =1 ◦

•

t =2 ◦•

•

t =3 ◦

t =4 ◦

•

•

(a) t =0

t =1

◦ •

•

◦

t =2 •◦ (b)

t =3

•

t =4

◦

◦ •

Reversible Cellular Automata, Fig. 36 Pushing and pulling operations to a position marker in P3

conventional logic elements like AND, OR, and NOT are used. Computation is simply carried out by a single signal that interacts with REs and position markers.

Future Directions In this section, we discuss future directions and open problems as well as topics not dealt with in the previous sections.

How Simple Can Universal RCAs Be? We have seen that there are many kinds of simple RCAs having computational universality. These RCAs with least number of states known so far are summed up as follows: One-dimensional case: Finite conﬁguration: 98-state reversible PCA (Morita 2007) Inﬁnite conﬁguration: 24-state reversible PCA (Morita 2011) Two-dimensional case: Finite conﬁguration: 81-state reversible PCA (Morita et al. 2002. Inﬁnite conﬁguration: Two-state RCA with Margolus neighborhood (Margolus 1984) Eight-state reversible triangular PCAs (Imai and Morita 2000; Morita 2016a, b) 16-state reversible square PCAs (Morita and Ueno 1992) We think the number of states for universal RCA can be reduced much more for each case of the above. Although the framework of PCA is useful for designing an RCA of a standard type, the number of states becomes relatively large

126

Reversible Cellular Automata

Begin →

End ←

Reversible Cellular Automata, Fig. 37 An example of a reversible counter machine, which computes the function 2 x + 2, embedded in P3 (Morita et al. 2002)

because the state set is the direct product of the sets of the states of the parts. Hence, we shall need some other technique to ﬁnd a universal RCA with a small number of states. How Can We Realize RCAs in Reversible Physical Systems?

This is a very difﬁcult problem. At present, there is no good solution. The billiard ball model (Fredkin and Toffoli 1982) is an interesting idea, but it is practically impossible to implement it perfectly. Instead of using a mechanical collision of balls, at least some quantum mechanical reversible phenomena should be used.

Furthermore, if we want to implement a CA in a real physical system, the following problem arises. In a CA, both time and space are discrete, and all the cells operate synchronously. On the other hand, in a real system, time and space are continuous, and no synchronizing clock is assumed beforehand. Hence, we need some novel theoretical framework for dealing with such problems. Self-reproduction in RCAs

von Neumann ﬁrst invented a self-reproducing cellular automata by using his famous 29-state CA (von Neumann 1966). In his model, the size of a self-reproducing pattern is quite huge,

Reversible Cellular Automata

127

Reversible Cellular Automata, Fig. 38 Selfreproduction of a pattern in a 3-D RCA

because the pattern has both computing and selfreproducing abilities. Later, Langton (1984) created a very simple self-reproducing CA by removing the condition that the pattern need not have computational universality. It was shown that self-reproduction of the Langton’s type is possible in two- or threedimensional reversible PCA (Imai et al. 2002; Morita and Imai 1996). Figure 38 shows a selfreproducing pattern in a three-dimensional reversible PCA (Imai et al. 2002). But it is left for the future study to design a simple and elegant RCA in which objects with computational universality can reproduce themselves.

Firing Squad Synchronization in RCAs

It is also possible to solve the ﬁring squad synchronization problem using RCAs. Imai and Morita (1996) gave a 99-state reversible PCA that synchronize an array of n cells in three n time steps. Though it seems possible to give an optimal time solution, i.e., a (2 n 2)-step solution, its concrete design has not yet done.

Bibliography Primary Literature Amoroso S, Cooper G (1970) The Garden of Eden theorem for ﬁnite conﬁgurations. Proc Am Math Soc 26:158–164 Amoroso S, Patt Y-N (1972) Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures. J Comput Syst Sci 6:448–464 Bennett C-H (1973) Logical reversibility of computation. IBM J Res Dev 17:525–532 Bennett C-H (1982) The thermodynamics of computation – a review. Int J Theor Phys 21:905–940 Bennett C-H, Landauer R (1985) The fundamental physical limits of computation. Sci Am 253:38–46 Boykett T (2004) Efﬁcient exhaustive listings of reversible one dimensional cellular automata. Theor Comput Sci 325:215–247 Cocke J, Minsky M (1964) Universality of tag systems with P = 2. J ACM 11:15–20 Cook M (2004) Universality in elementary cellular automata. Complex Syst 15:1–40 Fredkin E, Toffoli T (1982) Conservative logic. Int J Theor Phys 21:219–253 Gruska J (1999) Quantum computing. McGraw-Hill, London Hedlund G-A (1969) Endomorphisms and automorphisms of the shift dynamical system. Math Syst Theory 3:320–375 Imai K, Morita K (1996) Firing squad synchronization problem in reversible cellular automata. Theor Comput Sci 165:475–482

128 Imai K, Morita K (2000) A computation-universal two-dimensional 8-state triangular reversible cellular automaton. Theor Comput Sci 231:181–191 Imai K, Hori T, Morita K (2002) Self-reproduction in threedimensional reversible cellular space. Artif Life 8:155–174 Kari J (1994) Reversibility and surjectivity problems of cellular automata. J Comput Syst Sci 48:149–182 Kari J (1996) Representation of reversible cellular automata with block permutations. Math Syst Theory 29:47–61 Landauer R (1961) Irreversibility and heat generation in the computing process. IBM J Res Dev 5:183–191 Langton C-G (1984) Self-reproduction in cellular automata. Phys D 10:135–144 Margolus N (1984) Physics-like model of computation. Phys D 10:81–95 Maruoka A, Kimura M (1976) Condition for injectivity of global maps for tessellation automata. Inf Control 32:158–162 Maruoka A, Kimura M (1979) Injectivity and surjectivity of parallel maps for cellular automata. J Comput Syst Sci 18:47–64 Minsky M-L (1967) Computation: ﬁnite and inﬁnite machines. Prentice-Hall, Englewood Cliffs Moore E-F (1962) Machine models of self-reproduction. Proc Symp Appl Math Am Math Soc 14:17–33 Mora JCST, Vergara SVC, Martinez GJ, McIntosh HV (2005) Procedures for calculating reversible onedimensional cellular automata. Phys D 202:134–141 Morita K (1990) A simple construction method of a reversible ﬁnite automaton out of Fredkin gates, and its related problem. Trans IEICE Jpn E73:978–984 Morita K (1995) Reversible simulation of one-dimensional irreversible cellular automata. Theor Comput Sci 148:157–163 Morita K (1996) Universality of a reversible two-counter machine. Theor Comput Sci 168:303–320 Morita K (2001) A simple reversible logic element and cellular automata for reversible computing. In: Margenstern M, Rogozhin Y (eds) Proceedings of the MCU 2001. LNCS 2055, Springer, Berlin, Heidelberg, pp 102–113 Morita K (2007) Simple universal one-dimensional reversible cellular automata. J Cell Autom 2:159–166 Morita K (2008) Reversible computing and cellular automata – a survey. Theor Comput Sci 395:101–131 Morita K (2011) Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata. Theor Comput Sci 412:3856–3865 Morita K (2016a) An 8-state simple reversible triangular cellular automaton that exhibits complex behavior. In: Cook M, Neary T (eds) AUTOMATA 2016. LNCS 9664, Springer, Cham, pp 170–184. Slides with movies of computer simulation: Hiroshima University Institutional Repository. http://ir.lib.hiroshima-u.ac.jp/00039321 Morita K (2016b) Universality of 8-state reversible and conservative triangular partitioned cellular automaton. In: El Yacoubi S et al (eds) ACRI 2016. LNCS 9863, Springer, Cham, pp 45–54. Slides with movies of computer simulation: Hiroshima University Institutional Repository. http://ir.lib.hiroshima-u.ac.jp/00039997

Reversible Cellular Automata Morita K (2017a) Two small universal reversible Turing machines. In: Adamatzky A (ed) Advances in unconventional computing. Vol. 1: Theory. Springer, Cham, pp 221–237 Morita K, Harao M (1989) Computation universality of one-dimensional reversible (injective) cellular automata. Trans IEICE Jpn E72:758–762 Morita K, Imai K (1996) Self-reproduction in a reversible cellular space. Theor Comput Sci 168:337–366 Morita K, Ueno S (1992) Computation-universal models of two-dimensional 16-state reversible cellular automata. IEICE Trans Inf Syst E75-D:141–147 Morita K, Shirasaki A, Gono Y (1989) A 1-tape 2-symbol reversible Turing machine. Trans IEICE Jpn E72:223–228 Morita K, Tojima Y, Imai K, Ogiro T (2002) Universal computing in reversible and number-conserving two-dimensional cellular spaces. In: Adamatzky A (ed) Collision-based computing. Springer, London, pp 161–199 Myhill J (1963) The converse of Moore’s Garden-of-Eden theorem. Proc Am Math Soc 14:658–686 von Neumann J (1966) In: Burks AW (ed) Theory of selfreproducing automata. Urbana, The University of Illinois Press Richardson D (1972) Tessellations with local transformations. J Comput Syst Sci 6:373–388 Sutner K (2004) The complexity of reversible cellular automata. Theor Comput Sci 325:317–328 Toffoli T (1977) Computation and construction universality of reversible cellular automata. J Comput Syst Sci 15:213–231 Toffoli T (1980) Reversible computing. In: de Bakker JW, van Leeuwen J (eds) Automata, languages and programming. LNCS 85, Springer, Berlin, Heiderberg, pp 632–644 Toffoli T, Margolus N (1990) Invertible cellular automata: a review. Phys D 45:229–253 Toffoli T, Capobianco S, Mentrasti P (2004) How to turn a second-order cellular automaton into a lattice gas: a new inversion scheme. Theor Comput Sci 325:329–344 Watrous J (1995) On one-dimensional quantum cellular automata. In: Proceedings of the FOCS, IEEE Computer Society Press, pp 528–537

Books and Reviews Adamatzky A (ed) (2002) Collision-based computing. Springer, London Bennett CH (1988) Notes on the history of reversible computation. IBM J Res Dev 32:16–23 Burks A (ed) (1970) Essays on cellular automata. University of Illinois Press, Urbana Kari J (2005) Theory of cellular automata: a survey. Theor Comput Sci 334:3–33 Morita K (2017b) Theory of reversible computing. Springer, Tokyo Wolfram S (2001) A new kind of science. Wolfram Media, Champaign

Additive Cellular Automata Burton Voorhees Center for Science, Athabasca University, Athabasca, Canada

Article Outline Glossary Deﬁnition of the Subject Introduction Notation and Formal Deﬁnitions Additive Cellular Automata in One Dimension d-Dimensional Rules Future Directions Bibliography

Glossary Additive cellular automata An additive cellular automaton is a cellular automaton whose update rule satisﬁes the condition that its action on the sum of two states is equal to the sum of its actions on the two states separately. Alphabet of a cellular automaton The alphabet of a cellular automaton is the set of symbols or values that can appear in each cell. The alphabet contains a distinguished symbol called the null or quiescent symbol, usually indicated by 0, which satisﬁes the condition of an additive identity: 0 + x = x. Basins of attraction The basins of attraction of a cellular automaton are the equivalences classes of cyclic states together with their associated transient states, with two states being equivalent if they lie on the same cycle of the update rule. Cellular automata rule The rule, or update rule of a cellular automaton describes how any given state is transformed into its successor state. The update rule of a cellular automaton is described by a rule table, which deﬁnes a

local neighborhood mapping, or equivalently as a global update mapping. Cellular automata Cellular automata are dynamical systems that are discrete in space, time, and value. A state of a cellular automaton is a spatial array of discrete cells, each containing a value chosen from a ﬁnite alphabet. The state space for a cellular automaton is the set of all such conﬁgurations. Cyclic states A cyclic state of a cellular automaton is a state lying on a cycle of the automaton update rule, hence it is periodically revisited in the evolution of the rule. Garden-of-Eden A Garden-of-Eden state is a state that has no predecessor. It can be present only as an initial condition. Injectivity A mapping is injective (one-to-one) if every state in its domain maps to a unique state in its range. That is, if states x and y both map to a state z then x = y. Linear cellular automata A linear cellular automaton is a cellular automaton whose update rule satisﬁes the condition that its action on the sum of two states separately equals action on the sum of the two states plus its action on the state in which all cells contain the quiescent symbol. Note that some researchers reverse the deﬁnitions of additivity and linearity. Local maps of a cellular automaton The local mapping for a cellular automaton is a map from the set of all neighborhoods of a cell to the automaton alphabet. Neighborhood The neighborhood of a given cell is the set of cells that contribute to the update of value in that cell under the speciﬁed update rule. Predecessor state A state x is the predecessor of a state y if and only if x maps to y under application of the cellular automaton update rule. More speciﬁcally, a state x is an nth order predecessor of a state y if it maps to y under n applications of the update rule. Reversibility A mapping X is reversible if and only if a second mapping X 1 exists such that

# Springer-Verlag 2009 A. Adamatzky (ed.), Cellular Automata, https://doi.org/10.1007/978-1-4939-8700-9_4 Originally published in R. A. Meyers (ed.), Encyclopedia of Complexity and Systems Science, # Springer-Verlag 2009 https://doi.org/10.1007/978-0-387-30440-3_4

129

130

if X ðxÞ ¼ y then X 1 ðyÞ ¼ x: For ﬁnite state spaces reversibility and injectivity are identical. Rule table The rule table of a cellular automaton is a listing of all neighborhoods together with the symbol that each neighborhood maps to under the local update rule. State transition diagram The state transition diagram (STD) of a cellular automaton is a directed graph with each vertex labeled by a possible state and an edge directed from a vertex x to a vertex y if and only if the state labeling vertex x maps to the state labeling vertex y under application of the automaton update rule. Surjectivity A mapping is surjective (or onto) if every state has a predecessor. Transient states A transient state of a cellular automaton is a state that can at most appear only once in the evolution of the automaton rule.

Definition of the Subject Cellular automata are discrete dynamical systems in which an extended array of symbols from a ﬁnite alphabet is iteratively updated according to a speciﬁed local rule. Originally developed by John von Neumann (von Neumann 1963; von Neumann and Burk 1966) in 1948, following suggestions from Stanislaw Ulam, for the purpose of showing that self-replicating automata could be constructed. Von Neumann’s construction followed a complicated set of reproduction rules but later work showed that self-reproducing automata could be constructed with only simple update rules, e.g. (Arbib 1966). More generally, cellular automata are of interest because they show that highly complex patterns can arise from the application of very simple update rules. While conceptually simple, they provide a robust modeling class for application in a variety of disciplines, e.g. (Toffoli and Margolis 1987), as well as fertile grounds for theoretical research. Additive cellular automata are the simplest class of cellular automata. They have been extensively studied from both theoretical and practical perspectives.

Additive Cellular Automata

Introduction A wide variety of cellular automata applications, in a number of differing disciplines, has appeared in the past 50 years, see, e.g. (Codd 1968; Duff and Preston 1984; Sarkar 2000; Chopard and Droz 1998). Among other things, cellular automata have been used to model growth and aggregation processes (Lindenmayer and Rozenberg 1976; Mackay 1976; Langer 1980; Lin and Goldenfeld 1990); discrete reaction-diffusion systems (Greenberg and Hastings 1978; Greenberg et al. 1978; Madore and Freedman 1983; Adamatzky et al. 2005; Oono and Kohmoto 1985); spin exchange systems (Falk 1986; Canning and Droz 1991); biological pattern formation (Vitanni 1973; Young 1984); disease processes and transmission (Dutching and Vogelsaenger 1985; Moreira and Deutsch 2002; Sieburg et al. 1991; Santos and Continho 2001; Beauchemin et al. 2005); DNA sequences, and gene interactions (Burks and Farmer 1984; Moore and Hahn 2002); spiral galaxies (Gerola and Seiden 1978); social interaction networks (Flache and Hegselmann 1998); and forest ﬁres (Chen et al. 1990; Drossel and Schwabl 1992). They have been used for language and pattern recognition (Smith 1972; Sommerhalder and van Westrhenen 1983; Ibarra et al. 1985; Morita and Ueno 1994; Jen 1986a; Raghavan 1993; Chattopadhyay et al. 2000); image processing (Rosenfeld 1979; Sternberg 1980); as parallel computers (Hopcroft and Ullman 1972; Cole 1969; Benjamin and Johnson 1997; Carter 1984; Hillis 1984; Manning 1977); parallel multipliers (Atrubin 1965); sorters (Nishio 1981); and prime number sieves (Fischer 1965). In recent years, cellular automata have become important for VLSI logic circuit design (Pries et al. 1986). Circuit designers need “simple, regular, modular, and cascadable logic circuit structure to realize a complex function” and cellular automata, which show a signiﬁcant advantage over linear feedback shift registers, the traditional circuit building block, satisfy this need (see Chaudhuri et al. 1997 for an extensive survey). Cellular automata, in particular additive cellular automata, are of value for producing high-quality

Additive Cellular Automata

pseudorandom sequences (Bardell and McAnney 1986; Hortensius et al. 1989; Tsalides et al. 1991; Matsumoto 1998; Tomassini et al. 2000); for pseudoexhaustive and deterministic pattern generation (Das and Chaudhuri 1989, 1993; Serra 1990; Tziones et al. 1994; Mrugalski et al. 2000; Sikdar et al. 2002); for signature analysis (Hortensius et al. 1990; Serra et al. 1990; Dasgupta et al. 2001); error correcting codes (Chowdhury et al. 1994, 1995a); pseudoassociative memory (Chowdhury et al. 1995b); and cryptography (Nandi et al. 1994). In this discussion, attention focuses on the subclass of additive cellular automata. These are the simplest cellular automata, characterized by the property that the action of the update rule on the sum of two states is equal to the sum of the rule acting on each state separately. Hybrid additive rules (i.e., with different cells evolving according to different additive rules) have proved particularly useful for generation of pseudorandom and pseudoexhaustive sequences, signature analysis, and other circuit design applications, e.g. (Chaudhuri et al. 1997; Cattell and Muzio 1996; Cattell et al. 1999). The remainder of this article is organized as follows: section “Notation and Formal Deﬁnitions” introduces deﬁnitions and notational conventions. In section “Additive Cellular Automata in One Dimension”, consideration is restricted to onedimensional rules. The inﬂuence of boundary conditions on the evolution of one-dimensional rules, conditions for rule additivity, generation of fractal space-time outputs, equivalent forms of rule representation, injectivity and reversibility, transient lengths, and cycle periods are discussed using several approaches. TakingX as the global operator for an additive cellular automata, a method for analytic solution of equations of the form X ðmÞ ¼ b is described. Section “d-Dimensional Rules” describes work on d-dimensional rules deﬁned on tori. The discrete baker transformation is deﬁned and used to generalize one-dimensional results on transient lengths, cycle periods, and similarity of state transition diagrams. Extensive references to the literature are provided throughout and a set of general references is provided at the end of the bibliography.

131

Notation and Formal Definitions Let S ðLÞ ¼ fsi g be the set of lattice sites of a d-dimensional lattice L with nr equal to the number of lattice sites on dimension r. Denote by A a ﬁnite symbols set with jA j ¼ p (usually prime). An A -conﬁguration on L is a surjective map v : A 7! S ðLÞ that assigns a symbol from A to each site in S ðLÞ. In this way, every A-conﬁguration deﬁnes a size n1 nd, d-dimensional matrix m of symbols drawn from A. Denote the set of all A-conﬁgurations on L by E ðA,LÞ. Each si S ðLÞ is labeled by an integer vector ! i ¼ ði1 , . . . , id Þ where ir is the number of sites along the rth dimension separating s i from the assigned origin in L . The shift operator on the rth dimension of L is the map sr : L 7! L deﬁned by !

sr ðsi Þ ¼ sj , j ¼ ði1 , . . . , ir 1, . . . , id Þ:

(1) !

Equivalently, the shift maps the value at site i ! to the value at site j . Let mðsi ;t Þ ¼ mði1 , . . . , id ;t Þ A be the entry of m corresponding to site si at iteration t for any discrete dynamical system having E ðA,LÞ as state space. Given a ﬁnite set of integer d-tuples N ¼ fðk 1 , . . . , k d Þg deﬁne the N -neighborhood of a site si S ðLÞ as n ! ! ! ! o N ðsi Þ ¼ sj j ¼ i þ k , k N

(2)

A neighborhood conﬁguration is a surjective map v : A 7! N ðs0 Þ. Denote the set of all neighborhood conﬁgurations by E N ðA Þ. The rule table for a cellular automata acting on the state space E ðA,LÞ with standard neighborhood N ðs0 Þ is deﬁned by a map x : E N ðA Þ 7! A (note that this map need not be surjective or injective). The value of x for a given neighborhood conﬁguration is called the (value of the) rule component of that conﬁguration. The map x : E N ðA Þ 7! A induces a global map X : E ðA,LÞ 7! E ðA,LÞ as follows: For any given mðt Þ E ðA,LÞ, element the set Cðs i Þ ¼ m sj ;t sj N ðsi Þ is a

132

Additive Cellular Automata

neighborhood conﬁguration for the site si , hence the map mðsi ;t Þ 7! xðCðsi ÞÞ for all si produces a new symbol m(si; t + 1). The site si is called the mapping site. When taken over all mapping sites, this produces a matrix m( t + 1) that is the representation of X ðmðt ÞÞ: A cellular automaton is indicated by reference to its rule table or to the global map deﬁned by this rule table. A cellular automaton with global map X is additive if and only if, for all pairs of states m and b, X ðm þ bÞ ¼ X ðmÞ þ X ðbÞ

(3)

Addition of states is carried out site-wise mod(p) on the matrix representations of m and b; for example, for a one-dimensional six-site lattice with p = 3 the sum of 120112 and 021212 is 111021. The deﬁnition for additivity given in Chaudhuri et al. (1997) differs slightly from this standard deﬁnition. There, a binary valued cellular automaton is called “linear” if its local rule only involves the XOR operation and “additive” if it involves XOR and/or XNOR. A rule involving XNOR can be written as the binary complement of a rule involving only XOR. In terms of the global operator of the rule, this means that it has the form 1 þ X where X satisﬁes Eq. (1) and 1 represents the rule that maps every site to 1. Thus, ð1 þ X Þðm þ bÞ equals 1 . . . 1 þ X ðm þ bÞ while ð1 þ X ÞðmÞ þ ð1 þ X ÞðbÞ ¼ 1 . . . 1 þ 1 . . . 1 þ X ðmÞ þ X ðbÞ ¼ X ðmÞ þ X ðbÞ modð2Þ: In what follows, an additive rule is deﬁned strictly as one obeying Eq. (3), corresponding to rules that are “linear” in Chaudhuri et al. (1997). Much of the formal study of cellular automata has focused on the properties and forms of representation of the map X : E ðA,LÞ 7! E ðA,LÞ . The structure of the state transition diagram ðSTDðX ÞÞ of this map is of particular interest.

Example 1 (Continuous Transformations of the Shift Dynamical System) Let L be isomorphic to the set of integers Z. Then E ðA,Z Þ is the set of inﬁnite sequences with entries from A. With the product topology induced by the discrete topology on A and s as the left shift map, the system ðE ðA,Z Þ,sÞ is the shift dynamical system on A. The set of cellular automata maps X : E ðA,Z Þ 7! E ðA,Z Þ constitutes the class of continuous shift-commuting transformations of ðE ðA,Z Þ,sÞ , a fundamental result of Hedlund (1969). Example 2 (Elementary Cellular Automata) Let L be isomorphic to L with A ¼ f0,1g and N ¼ f1,0,1g . The neighborhood of site si is fsi1 , si , siþ1 g andE N ðA Þ ¼ f000,001,010 ,011, 100,101,110,111g: In this one-dimensional case, the rule table can be written as xi = x(i0i1i2) where i0i1i2 is the binary form of the index i. Listing this gives the standard form for the rule table of an elementary cellular automata. 000 001 x0 x1

010 x2

011 x3

100 x4

101 x5

110 111 x6 x7

The standard labeling scheme for elementary cellular automata was introduced by Wolfram (1983), who observed that the rule table for elemenP tary rules deﬁnes the binary number 71¼0 xi 2i and used this number to label the corresponding rule. Example 3 (The Game of Life) This simple 2-dimensional cellular automata was invented by John Conway to illustrate a selfreproducing system. It was ﬁrst presented in 1970 by Martin Gardner (1970, 1971). The game takes place on a square lattice, either inﬁnite or toridal. The neighborhood of a cell consists of the eight cells surrounding it. The alphabet is {0, 1}: a 1 in a cell indicates that cell is alive, a 0 indicates that it is dead. The update rules are: (a) If a cell contains a 0, it remains 0 unless exactly three of its neighbors contain a 1; (b) If a cell contains a 1 then it remains a 1 if and only if two or three of its neighbors are 1. This cellular automata produces a number of interesting patterns including a variety of ﬁxed points

Additive Cellular Automata

133

(still life); oscillators (period 2); and moving patterns (gliders, spaceships); as well as more exotic patterns such as glider guns which generate a stream of glider patterns.

where all indices are taken mod(n) in the case of Z n . In the remaining cases, 8 > < m1 ½dðmÞi ¼ mi1 þ miþ1 > : mn2

Additive Cellular Automata in One Dimension

½dðmÞi ¼

Much of the work on cellular automata has focused on rules in one dimension (d = 1). This section reviews some of this work. Boundary Conditions and Additivity In the case of one-dimensional cellular automata, the lattice L can be isomorphic to the integers; to the non-negative integers; to the ﬁnite set f0, . . . , n 1g Z; or to the integers modulo an integer n. In the ﬁrst case, there are no boundary conditions; in the remaining three cases, different boundary conditions apply. If L is isomorphic to Z n , the integers mod(n), the boundary conditions are periodic and the lattice is circular (it is a p-adic necklace). This is called a cylindrical cellular automata (Jen 1988a) because evolution of the rule can be represented as taking place on a cylinder. If the lattice is isomorphic to {0, . . ., n 1}, null, or Dirchlet boundary conditions are set (Tadaki and Matsufuji 1993; Nandi and Pal Chaudhuri 1996; Chin et al. 2001). That is, the symbol assigned to all sites in L outside of this set is the null symbol. When the lattice is isomorphic to the non-negative integers Z þ , null boundary conditions are set at the left boundary. In these latter two cases, the neighborhood structure assumed may inﬂuence the need for null conditions. Example 4 (Elementary Rule 90) Let d represent the global map for the elementary cellular automata rule 90, with rule table

i¼0 0 0 s¼0 (29) where all sums are taken mod(2), xr = 0 for r < 0, and dxe indicates the greatest integer less than or equal to x. The solution for m(0) is substituted into the second equation of (27) yielding a solution for m(1). These are recombined to get the general solution for m. This technique of reducing a single equation to a set of coupled equations involving simpler additive rules works in general although the form for partitioning of sequences is speciﬁc to the particular case. Computation of predecessors involves inversion of operators of the form I + Brss. The general form for the inverse of this operator is I + C(r, s) where C(r, s) is the lower triangular matrix that is the solution of the equation jþr X m¼j

From Theorem 8, Eq. (26) can be formally solved to obtain mð0Þ ¼ a0 B að0Þ þ Bs1 mð1Þ þ bð0Þ (27) mð1Þ ¼ a1 B að0Þ þ Bs1 smð0Þ þ bð1Þ Substituting the second equation of (27) into the ﬁrst, making use of the identity s2 s mð0Þ ð0Þ ¼ s1 mð0Þ þ m0 að0Þ , rearranging terms and

rþ1 C ðr,sÞ im þ C ðr,sÞ i,jþs mjþ1

¼ di,jþs

(30)

d-Dimensional Rules Both (Martin et al. 1984; Guan and He 1986) discuss the extension from one-dimensional to d-dimensional rules deﬁned on tori. In Martin et al. (1984) this discussion uses a formalism of multinomials deﬁned over ﬁnite ﬁelds. In Guan and He

Additive Cellular Automata

143

(1986), the one-dimensional analysis based on circulant matrices is generalized. The matrix formulism of state transitions is retained by deﬁning a d-fold “circulant of circulants,” which is not, of itself, necessarily a circulant. Computation of the non-zero eigenvalues of this matrix yields results on transient lengths and cycle periods. More recently, an extensive analysis of additive rules deﬁned on multi-dimensional tori has appeared (Bulitko et al. 2006). A d-dimensional ! integer vector n¼ ðn1 , . . . , nd Þ deﬁnes a discrete ! toridal lattice L n . Every d-dimensional matrix ! of size n with entries in A , jA j ¼ p (prime), ! deﬁnes an additive rule acting on E A, L n asfollows: Let T and m(t) be elements of ! E A, L n with X the rule deﬁned by T and m(t) a state at time t. The state transition deﬁned by X is mðt þ 1Þ ¼ X ðmðt ÞÞ and this is given by ½mðt þ 1Þi1 ...id X ...k d ...k d ¼ ½CðT Þki11...i ½mðt Þk 1 ...k d ½CðT Þki11...i d d k 1 ,...,k d ¼ T j1 ...jd js ¼ k s is modðns Þ (31) The matrix CðT Þ is the d-dimensional generalization of a circulant matrix with T as the equivalent of its ﬁrst row. For example, if d = 1 and p = 2 with T ¼ ð0,1,0,0,0,1Þ this deﬁnes the additive rule s + s5 (rule 90) and the matrix C ðT Þ is given in Eq. (10a). ! Let S and T be elements of E A, L n and ! deﬁne the binary operation c : E A, L n ! ! E A, L n 7! E A, L n by

½cðS,T Þi1 ...id ¼

X

S k 1 ...k d T i1 k 1 ...id k d

k 1 ,...,k d 0k s ι and any T E A, L n , Bp is a permutation on

Brp T

.

Theorem 11 (Bulitko et al. 2006) Let q be prime and let ordmq be the order of q in m when this is deﬁned and 1 otherwise. Write ns ¼ pk s ms and set c ¼ lcmðord m1 p, . . . , ord md pÞ . Then, for any rule X deﬁned by a matrix T E ! A, L n the following are true:

a01 þ a21 þ a41 0 0 a31 þ a11 þ a51 0 0

3 a03 þ a23 þ a43 7 0 7 7 0 7 a33 þ a13 þ a53 7 7 5 0 0

The baker transformation is a linear transformation on the space of d-dimensional matrices with entries from A . Since each element of this space deﬁnes an additive cellular automata rule, the vertices of the state transition diagram for the baker transformation can be labeled by these rules, and this is exhaustive. Deﬁnitions: 1. An oriented graph G = (V, E) is a set V of vertices together with an edge set E V V. If (v, w) E then there is an edge directed from vertex v to vertex w. 2. An oriented graph G1 = (V1, E1) reduces to an oriented graph G2 = (V2, E2) modulo p(G1 a3 = 0.61805, the memory mechanism turns out to be that of selecting the mode of the ðT Þ ðT 2Þ ðT Þ ðT 1Þ last three states:si ¼ mode si , s i , si , i.e. the elementary rule 232. Figure 7 shows the effect of this kind of memory on legal rules. As is known, history has a dramatic effect on Rules 18, 90, 146 and 218 as their pattern dies out as early as at T = 4. The case of Rule 22 is particular: two branches are generated at T = 17 in the historic model; the patterns of the remaining rules in the historic model are much reminiscent of the ahistoric ones, but, let us say, compressed. Figure 7 shows also the effect of memory on some relevant quiescent asymmetric rules. Rule 2 shifts a single site live cell one space at every timestep in the ahistoric model; with the pattern dying at T = 4. This evolution is common to all rules that just shift a single site cell without increasing the number of living cells at T = 2, this is the case of the important rules

184 and 226. The patterns generated by rules 6 and 14 are rectiﬁed (in the sense of having the lines in the spatio-temporal pattern slower slope) by memory in such a way that the total number of live cells in the historic and ahistoric spatio-temporal patterns is the same. Again, the historic patterns of the remaining rules in Fig. 7 seem, as a rule, like the ahistoric ones compressed (Alonso-Sanz and Martin 2005). Elementary rules (ER, noted f) can in turn act as memory rules: ðT Þ

si

ðT 2Þ ðT Þ ðT1Þ ¼ f si , s i , si

Figure 8 shows the effect of ER memories up to R = 125 on rule 150 starting from a single site live cell up to T = 13. The effect of ER memories with R > 125 on rule 150 as well as on rule 90 is shown in Alonso-Sanz and Martin (2006a). In the latter case, complementary memory rules (rules whose rule number adds 255) have the same effect on rule 90 (regardless of the role played by the three last states in f and the initial conﬁguration). In the ahistoric scenario, Rules 90 and 150 are linear (or additive): i.e., any initial pattern can be

Cellular Automata with Memory

Cellular Automata with Memory, Fig. 8 The Rule 150 with elementary rules up to R = 125 as memory

165

166

Cellular Automata with Memory

Cellular Automata with Memory, Fig. 9 The parity rule with elementary rules as memory. Evolution from T = 4 15 in the Neumann neighborhood starting from a singe site live cell

decomposed into the superposition of patterns from a single site seed. Each of these conﬁgurations can be evolved independently and the results superposed (module two) to obtain the ﬁnal complete pattern. The additivity of rules 90 and 150 remains in the historic model with linear memory rules. Figure 9 shows the effect of elementary rules on the 2D parity rule with von Neumann neighborhood from a singe site live cell. This ﬁgure shows patterns from T = 4, being the three ﬁrst patterns: . The consideration of CA rules as memory induces a fairly unexplored explosion of new patterns.

CA with Three Statesk This section deals with CAwith three possible values at each site (k = 3), noted {0, 1, 2}, so the rounding mechanism is implemented by comparing the unrounded weighted mean m to the hallmarks 0.5 and 1.5, assigning the last state in case on an equality to any of these values. Thus, sT ¼ 0 if mT < 0:5, sT ¼ 1 if 0:5 < mT < 1:5, sT ¼ 2 if mT > 1:5, and sT ¼ sT if mT ¼ 0:5 or mT ¼ 1:5:

Cellular Automata with Memory

167

Cellular Automata with Memory, Fig. 10 Parity k = 3 rules starting from a single s = 1 seed. The red cells are at state 1, the blue ones at state

In the most unbalanced cell dynamics, historic memory takes effect after time step T only if a > aT, with 3aTT 4aT þ 1 ¼ 0 , which in the temporal limit becomes 4a + 1 = 0 , a = 0.25. In general, in CA with k states (termed from 0 to k 1), the characteristic equation at T is ð2k 3ÞaTT ð2k 1ÞaT þ 1 ¼ 0, which becomes 2(k 1)a + 1 = 0 in the temporal limit. It is then concluded that memory does not affect the scenario if a a(k) = 1/(2(k 1)). ðT þ1Þ ðT Þ We study ﬁrst totalistic rules:si ¼ f si1 þ ðT Þ

ðT Þ

si þ siþ1 Þ , characterized by a sequence of ternary values (bs) associated with each of the seven possible values of the sum (s) of the neighbors: (b6, b5, b4, b3P , b2, b1, b0), with associated rule number R ¼ 6s¼0 bs 3s ½0,2186 : Figure 10 shows the effect of memory on quiescent (b0 = 0) parity rules, i.e. rules with b1, b3 and b5 non null, and b2 = b4 = b6 = 0. Patterns are shown up to T = 26. The pattern for a = 0.3 is shown to test its proximity to the ahistoric one (recall that if a 0.25 memory takes no effect). Starting with a single site seed it can be concluded, regarding proper three-state rules such as those in Fig. 10, that: (i) as an overall rule the patterns become more expanded as less historic memory is

retained (smaller a). This characteristic inhibition of growth effect of memory is traced on rules 300 and 543 in Fig. 10, (ii) the transition from the fully historic to the ahistoric scenario tends to be gradual in regard to the amplitude of the spatio-temporal patterns, although their composition can differ notably, even at close a values, (iii) in contrast to the two-state scenario, memory ﬁres the pattern of some three-state rules that die out in the ahistoric model, and no rule with memory dies out. Thus, the effect of memory on rules 276, 519, 303 and 546 is somewhat unexpected: they die out at a 0.3 but at a = 0.4 the pattern expands, the expansion being inhibited (in Fig. 10) only at a 0.8. This activation under memory of rules that die at T = 3 in the ahistoric model is unfeasible in the k = 2 scenario. The features in the evolving patterns starting from a single seed in Fig. 10 are qualitatively reﬂected starting at random as shown with rule 276 in Fig. 11, which is also activated (even at a = 0.3) when starting at random. The effect of average memory (a and integer-based models, unlimited and limited trailing memory, even t = 2) and that of the mode of the last three states has been studied in Alonso-Sanz and Martin (2004b). When working with more than three states, it is an inherent consequence of averaging the

168

Cellular Automata with Memory

Cellular Automata with Memory, Fig. 11 The k ¼ 3,R ¼ 276 rule starting at random

tendency to bias the featuring state to the mean value: 1. That explains the redshift in the previous ﬁgures. This led us to focus on a much more fair memory mechanism: the mode, in what follows. Mode memory allows for manipulation of pure symbols, avoiding any computing/ arithmetics. In excitable CA, the three states are featured: resting 0, excited 1 and refractory 2. State transitions from excited to refractory and from refractory to resting are unconditional, they take place independently on a cell’s neighborhood state: ðT Þ ðT þ1Þ ðT Þ ðTþ1Þ si ¼ 1 ! si ¼ 2, si ¼ 2 ! si ¼ 0. In Alonso-Sanz and Adamatzky (2008) the excitation rule adopts a Pavlovian phenomenon of defensive inhibition: when strength of stimulus applied exceeds a certain limit the system ‘shuts down’, this can be naively interpreted as an inbuilt protection of energy loss and exhaustion. To simulate the phenomenon of defensive inhibition we adopt interval excitation rules (Adamatzky 2001), and a resting cell becomes excited only if one or two ðT Þ ðT Þ of its neighbors si ¼ 0 ! si ¼ 1 are excited: P ðT Þ if ¼ 1 f1,2g (Adamatzky and j N i sj Holland 1998).

Figure 12 shows the effect of mode of the last three time steps memory on the defensiveinhibition CA rule with the Moore neighborhood, starting from a simple conﬁguration. At T = 3 the outer excited cells in the actual pattern are not featured as excited but as resting cells (twice resting versus one excited), and the series of evolving patterns with memory diverges from the ahistoric evolution at T = 4, becoming less expanded. Again, memory tends to restrain the evolution. The effect of memory on the beehive rule, a totalistic two-dimensional CA rule with three states implemented in the hexagonal tessellation (Wuensche 2005) has been explored in AlonsoSanz (2006b).

Reversible CA The second-order in time implementation based on the subtraction modulo of states of the number ðT þ1Þ ðT Þ ðT 1Þ ¼ f sj N i si , read(noted ): si ðT 1Þ ðT Þ ðT þ1Þ ily reverses as: si ¼ f s j N i si . To preserve the reversible feature, memory has to be endowed only in the pivotal component of the rule ðT 1Þ ðT Þ ðTþ1Þ transition, so: si ¼ f s j N i si .

Cellular Automata with Memory

169

Cellular Automata with Memory, Fig. 12 Effect of mode memory on the defensive inhibition CA rule

For reversing from T it is necessary to know ðT Þ ðT þ1Þ ðT Þ but also oi to be not only si and si compared to O(T), to obtain:

ðT Þ si

8 > : 1

if if if

ðT Þ

2oi < OðT Þ ðT Þ 2oi ¼ OðT Þ ðT Þ 2oi > OðT Þ:

Then to progress in the reversing, to obtain ðT 1Þ ¼ round oi =OðT 1Þ , it is neces ðT 1Þ ðT Þ ðT Þ ¼ oi si =a. But sary to calculate oi in order to avoid dividing by the memory factor (recall that operations with real numbers are not exact in computer arithmetic), it is preferable ðT1Þ ðT Þ ðT Þ to work with gi ¼ oi si , and to comP 1 Tt pare these values to GðT 1Þ ¼ Tt¼1 a . This leads to: 8 ðT1Þ > if 2gi < GðT 1Þ : ðT1Þ > GðT 1Þ: 1 if 2gi ðT 1Þ si

ðT tÞ

ðT tþ1Þ

ðT tþ1Þ

In general: gi ¼ gi at1 si , t1 GðT tÞ ¼ GðT t þ 1Þ a . Figure 13 shows the effect of memory on the reversible parity rule starting from a single site live cell, so the scenario of Figs. 2 and 3, with the reversible qualiﬁcation. As expected, the simulations corresponding to a = 0.6 or below shows the ahistoric pattern at T = 4, whereas memory leads to a pattern different from a = 0.7, and the pattern at T = 5 for a = 0.54 and a = 0.55 differ. Again, in the reversible formulation with memory, (i) the conﬁguration of the patterns is notably altered, (ii) the

speed of diffusion of the area affected are notably reduced, even by minimal memory (a = 0.501), (iii) high levels of memory tend to freeze the dynamics since the early time-steps. We have studied the effect of memory in the reversible formulation of CA in many scenarios, e.g., totalistic, k = r = 2 rules (Alonso-Sanz 2004a), or rules with three states (Alonso-Sanz and Martin 2004b). Reversible systems are of interest since they preserve information and energy and allow unambiguous backtracking. They are studied in computer science in order to design computers which would consume less energy (Toffoli and Margolus 1987). Reversibility is also an important issue in fundamental physics (Fredkin 1990; Margolus 1984; Toffoli and Margolus 1990; Vichniac 1984). Geraldt’t Hooft, in a speculative paper (Hooft 1988), suggests that a suitably deﬁned deterministic, local reversible CA might provide a viable formalism for constructing ﬁeld theories on a Planck scale. Svozil (1986) also asks for changes in the underlying assumptions of current ﬁeld theories in order to make their discretization appear more CA-like. Applications of reversible CA with memory in cryptography are being scrutinized (Alvarez et al. 2005; Martin del Rey et al. 2005).

Heterogeneous CA CA on networks have arbitrary connections, but, as proper CA, the transition rule is identical for all cells. This generalization of the CA paradigm addresses the intermediate class between CA and

170

Cellular Automata with Memory

Cellular Automata with Memory, Fig. 13 The reversible parity rule with memory

Boolean networks (BN, considered in the following section) in which, rules may be different at each site. In networks two topological ends exist, random and regular networks, both display totally opposite geometric properties. Random networks have

lower clustering coefﬁcients and shorter average path length between nodes commonly known as small world property. On the other hand, regular graphs, have a large average path length between nodes and high clustering coefﬁcients.

Cellular Automata with Memory

171

Cellular Automata with Memory, Fig. 14 The parity rule with four inputs: effect of memory and random rewiring. Distance between two consecutive patterns in

the ahistoric model (red) and memory models of a levels: 0.6,0.7.0.8, 0.9 (dotted) and 1.0 (blue)

In an attempt to build a network with characteristics observed in real networks, a large clustering coefﬁcient and a small world property, Watts and Strogatz (WS, (Watts and Strogatz 1998)) proposed a model built by randomly rewiring a regular lattice. Thus, the WS model interpolates between regular and random networks, taking a single new parameter, the random rewiring degree, i.e.: the probability that any node redirects a connection, randomly, to any other. The WS model displays the high clustering coefﬁcient common to regular lattices as well as the small world property (the small world property has been related to faster ﬂow in the information transmission). The longrange links introduced by the randomization procedure dramatically reduce the diameter of the network, even when very few links are rewired. Figure 14 shows the effect of memory and topology on the parity rule with four inputs in a lattice of size 65 65 with periodic boundary conditions, starting at random. As expected, memory depletes the Hamming distance between two consecutive patterns in relation to the ahistoric model,

particularly when the degree of rewiring is high. With full memory, quasi-oscillators tend to appear. As a rule, the higher the curve the lower the memory factor a, but in the particular case of a regular lattice (and lattice with 10% of rewiring), the evolution of the distance in the full memory model turns out rather atypical, as it is maintained over some memory models with lower a parameters. Figure 15 shows the evolution of the damage spread when reversing the initial state of the 3 3 central cells in the initial scenario of Fig. 14. The fraction of cells with the state reversed is plotted in the regular and 10% of rewiring scenarios. The plots corresponding to higher rates of rewiring are very similar to that of the 10% case in Fig. 15. Damage spreads fast very soon as rewiring is present, even in a short extent. Boolean Networks In Boolean Networks (BN, (Kauffman 1993)), instead of what happens in canonical CA, cells may have arbitrary connections and rules may be

172

Cellular Automata with Memory

Cellular Automata with Memory, Fig. 15 Damage up to T = 100 in the parity CA of Fig. 14

Cellular Automata with Memory, Fig. 16 Relative Hamming distance between two consecutive patterns. Boolean network with totalistic, K = 4 rules in the scenario of Fig. 14

different at each P site. Working with totalistic rules: ðTþ1Þ ðT Þ si ¼ fi . j N i sj The main features on the effect of memory in Fig. 14 are preserved in Fig. 16: (i) the ordering of the historic networks tends to be stronger with a high memory factor, (ii) with full memory, quasioscillators appear (it seems that full memory tends to induce oscillation), (iii) in the particular case of the regular graph (and a lesser extent in the networks with low rewiring), the evolution of the full memory model turns out rather atypical, as it is maintained

over some of those memory models with lower a parameters. The relative Hamming distance between the ahistoric patterns and those of historic rewiring tends to be fairly constant around 0.3, after a very short initial transition period. Figure 17 shows the evolution of the damage when reversing the initial state of the 3 3 central cells. As a rule in every frame, corresponding to increasing rates of random rewiring, the higher the curve the lower the memory factor a. The damage vanishing effect induced by memory does result apparently in the regular scenario of Fig. 17, but

Cellular Automata with Memory

173

Cellular Automata with Memory, Fig. 17 Evolution of the damage when reversing the initial state of the 3 3 central cells in the scenario of Fig. 16

only full memory controls the damage spreading when the rewiring degree is not high, the dynamics with the remaining a levels tend to the damage propagation that characterizes the ahistoric model. Thus, with up to 10% of connections rewired, full memory notably controls the spreading, but this control capacity tends to disappear with a higher percentage of rewiring connections. In fact, with rewiring of 50% or higher, neither full memory seems to be very effective in altering the ﬁnal rate of damage, which tends to reach a plateau around 30% regardless of scenario. A level notably coincident with the percolation threshold in site percolation in the simple cubic lattice, and the critical point for the nearest neighbor Kaufmann model on the square lattice (Stauffer and Aharony 1994): 0.31.

conventional CA. This means that given certain conditions, speciﬁed by the link transition rules, links between rules may be created and destroyed; the neighborhood of each cell is dynamic, so, state and link conﬁgurations of an SDCA are both dynamic and continually interacting. If cells are numbered 1 to N, their connectivity is speciﬁed by an N N connectivity matrix in which li j = 1 if cells i and j are n connected; o ðT Þ

ðT Þ

NN i

Structurally Dynamic CA Structurally dynamic cellular automata (SDCA) were suggested by Ilachinski and Halpern (1987). The essential new feature of this model was that the connections between the cells are allowed to change according to rules similar in nature to the state transition rules associated with the

ðT Þ

0 otherwise. So, now: N i ¼ j=lij ¼ 1 ðT þ1Þ ðT Þ ðT Þ and si ¼ f sj N i . The geodesic distance between two cells i and j, dij, is deﬁned as the number of links in the shortest path between i and j. Thus, i and j are direct neighbors if dij = 1, and are next-nearest neighbors if dij = 2, so n o ðT Þ

¼ j=dij ¼ 2 . There are two types of

link transition functions in an SDCA: couplers and decouplers, the former add new links, the latter remove links. The coupler and decoupler ðT þ1Þ set determines the ¼ link transition rule: lij ðT Þ

ðT Þ

ðT Þ

c l ij , si , sj

.

Instead of introducing the formalism of the SDCA, we deal here with just one example in which the decoupler rule removes all links

174

Cellular Automata with Memory

Cellular Automata with Memory, Fig. 18 The SDCA described in text up to T = 6

connected to cells in which both values are zero ðT Þ ðT þ1Þ ðT Þ ðT Þ ¼ 0 iff si þ sj ¼ 0) and (lij ¼ 1 ! lij the coupler rule adds links between all nextnearest neighbor sites in which both values are ðT Þ ðT þ1Þ ðT Þ ðT Þ one (lij ¼ 0 ! li j ¼ 1 iff si þ sj ¼ 2 ðT Þ and j NN i ). The SDCA with these transition rules for connections, together with the parity rule for mass states, is implemented in Fig. 18, in which the initial Euclidean lattice with four neighbors (so the generic cell ☐ has eight next-nearest neighbors: ) is seeded with a 3 3 block of ones. After the ﬁrst iteration, most of the lattice structure has decayed as an effect of the decoupler rule, so that the active value cells and links are conﬁned to a small region. After T = 6, the link and value structures become periodic, with a periodicity of two. Memory can be embedded in links in a similar manner as in state values, so the link between any two cells is featured by a mapping of ðT Þ ð1Þ ðT Þ its previous link values: l ij ¼ l lij , . . . , lij . The distance between two cells in the historic model (dij), is deﬁned in terms of l instead of l values, so that i and j are direct neighbors if dij = 1, and are nnext-nearest o ðT Þ ðT Þ neighbors if dij n= 2. Now: N oi ¼ j=d ij ¼ 1 , ðT Þ ðT Þ and NN i ¼ j=d ij ¼ 2 . Generalizing the approach to embedded memory applied to states, the unchanged transition rules (f and c) operate ðT þ1Þ on the featured link and cell state values: si ðT Þ ðT þ1Þ ðT Þ ðT Þ ðT Þ ¼ f sj N i , lij ¼ c l i j, si , sj . Figure 19 shows the effect of a-memory on the cellular automaton above introduced starting as in Fig. 18. The effect of memory on SDCA in the hexagonal and triangular tessellations is scrutinized in Alonso-Sanz (2006a).

A plausible wiring dynamics when dealing with excitable CA is that in which the decoupler rule removes all links connected to cells in which both values are at refractory state (lðijT Þ ¼ 1 ! lðijT þ1Þ ¼ 0 ðT Þ ðT Þ iff si ¼ sj =2) and the coupler rule adds links between all next-nearest neighbor sites in which ðT Þ ðT þ1Þ both values are excited (lij ¼ 0 ! lij ¼ 1 iff ðT Þ ðT Þ ðT Þ si ¼ sj ¼ 1 and j NN i ). In the SDCA in Fig. 20, the transition rule for cell states is that of the generalized defensive inhibition rule: resting cell is excited if its ratio of excited and connected to the cell neighbors to total number of connected neighbors lies in the interval [1/8,2/8]. The initial scenario of Fig. 20 is that of Fig. 12 with the wiring network revealed, that of an Euclidean lattice with eight neighbors, in which, the generic cell ☐ has 16 next-nearest neighbors: . No decoupling is veriﬁed at the ﬁrst iteration in Fig. 20, but the excited cells generate new connections, most of them lost, together with some of the initial ones, at T = 3. The excited cells at T = 3 generate a crown of new connections at T = 4. Figure 21 shows the ahistoric and mode memory patterns at T = 20. The ﬁgure makes apparent the preserving effect of memory. The Fredkin’s reversible construction is feasible in the SDCA scenario extending the operation ðT 1Þ also to links: lðijT þ1Þ ¼ c lðijT Þ , sði T Þ , sðj T Þ lij . These automata with memory may be endowed ðTþ1Þ ðT Þ ðT Þ ðT 1Þ ðT þ1Þ as: si ¼ f sj N i ,lij ¼c

si ðT Þ ðT Þ ðT Þ ðT 1Þ (Alonso-Sanz 2007a). l ij , si , sj

lij The SDCA seems to be particularly appropriate for modeling the human brain function – updating links between cells imitates variation of synaptic connections between neurons represented by the cells – in which the relevant

Cellular Automata with Memory

175

Cellular Automata with Memory, Fig. 19 The SD cellular automaton introduced in text with weighted memory of factor a. Evolution from T = 4 up to T = 9 starting as in Fig. 18

Cellular Automata with Memory, Fig. 20 The k = 3 SD cellular automaton described in text, up to T = 4

role of memory is apparent. Models similar to SDCA have been adopted to build a dynamical network approach to quantum space-time physics (Requardt 1998, 2006b). Reversibility is an important issue at such a fundamental physics level. Technical applications of SDCA may also be traced (Ros et al. 1994). Anyway, besides their potential applications, SDCA with memory have an aesthetic and mathematical interest on their own (Adamatzky 1994; Ilachinski 2000). Nevertheless, it seems plausible that further study on SDCA (and Lattice Gas Automata with dynamical geometry (Love et al. 2004)) with memory should turn out to be proﬁtable.

Memory in Other Discrete Time Contexts Continuous-Valued CA The mechanism of implementation of memory adopted here, keeping the transition rule unaltered but applying it to a function of previous states, can be adopted in any spatialized dynamical system. Thus, historic memory can be embedded in: • Continuous-valued CA (or Coupled Map Lattices in which the state variable ranges in R, and the transition rule ’ is a continuous function (Kaneko 1986)), just by considering m instead of s in the application of the updating

176

Cellular Automata with Memory

Cellular Automata with Memory, Fig. 21 The SD cellular automaton starting as in Fig. 20 at T = 20, with no memory (left) and mode memory in both cell states and links

ðTþ1Þ ðT Þ ðT Þ rule: si ¼ ’ mj N i . An elementary CA of this kind with memory would ðT þ1Þ be (Alonso-Sanz and Martin 2004a): si ¼ ðT Þ ðT Þ ðT Þ 1 þ miþ1 . 3 mi1 þ mi • Fuzzy CA, a sort of continuous CA with states ranging in the real [0,1] interval. An illustration of the effect of memory in fuzzy CA is given in Alonso-Sanz and Martin (2002a). The illustration operates on the elementary rule ðT þ1Þ ðT Þ ðT Þ ðT Þ ðT Þ 90 : si ¼ si1 ^ :siþ1 _ :si1 ^ siþ1 , which after fuzziﬁcation (a _ b ! min (1, a + b), ðT þ1Þ a ^ b ! ab, : a ! 1 a) yields: si ¼ ðT Þ

ðT Þ

ðT Þ ðT Þ

si1 þ siþ1 2si1 siþ1 ; thus incorporating ðT þ1Þ

ðT Þ

ðT Þ

ðT Þ

ðT Þ

memory: si ¼ mi1 þ miþ1 2mi1 miþ1 . • Quantum CA, such, for example, as the simple 1D quantum CA models introduced in Grössing and Zeilinger (1988): ðTþ1Þ

sj

¼

N

1 ðT Þ ðT Þ ðT Þ ids þ s þ id s j j1 jþ1 , 1=2

which would become with memory (Alonso-Sanz and Martin 2004a): ðTþ1Þ

sj

¼

1 N 1=2

ðT Þ

ðT Þ

idmj1 þ mj

ðT Þ þ id mjþ1 :

Spatial Prisoner’s Dilemma The Prisoner’s Dilemma (PD) is a game played by two players (A and B), who may choose either to cooperate (C or 1) or to defect (D or 0). Mutual cooperators each score the reward R, mutual defectors score the punishment P; D scores the temptation T against C, who scores S (sucker’s payoff) in such an encounter. Provided that T > R > P > S, mutual defection is the only equilibrium strategy pair. Thus, in a single round both players are to be penalized instead of both rewarded, but cooperation may be rewarded in an iterated (or spatial) formulation. The game is simpliﬁed (while preserving its essentials) if P = S = 0. Choosing R = 1, the model will have only one parameter: the temptation T=b. In the spatial version of the PD, each player occupies at a site (i, j) in a 2D lattice. In each ðT Þ generation the payoff of a given individual (pi,j ), is the sum over all interactions with the eight nearest neighbors and with its own site. In the next generation, an individual cell is assigned ðT Þ the decision (d i,j ) that received the highest payoff among all the cells of its Moore’s neighborhood. In case of a tie, the cell retains its choice. The spatialized PD (SPD for short) has proved to be a promising tool to explain how cooperation can hold out against the ever-present threat of

Cellular Automata with Memory

exploitation (Nowak and May 1992). This is a task that presents problems in the classic struggle for survival Darwinian framework. When dealing with the SPD, memory can be embedded not only in choices but also in rewards. Thus, in the historic model we dealt with, at T: (i) the payoffs coming from previous rounds ðT Þ are accumulated ( pi,j ), and (ii) players are feaðT Þ tured by a summary of past decisions ( di,j ). Again, in each round or generation, a given cell plays with each of the eight neighbors and itself, the decision d in the cell of the neighborhood with the highest p being adopted. This approach to modeling memory has been rather neglected, the usual being that of designing strategies that specify the choice for every possible outcome in the sequence of historic choices recalled (Hauert and Schuster 1997; Lindgren and Nordahl 1994). Table 1 shows the initial scenario starting from a single defector if 8b > 9 , b > 1.125, which means that neighbors of the initial defector become defectors at T = 2. Nowak and May paid particular attention in their seminal papers to b = 1.85, a high but not excessive temptation value which leads to complex dynamics. After T = 2, defection can advance to a 5 5 square or be restrained as a 3 3 square, depending on the comparison of 8a + 5 1.85 (the maximum p value of the recent defectors) with 9a + 9 (the p value of the non-affected players). As 8a + 5 1.85 = 9a + 9 ! a = 0.25, i.e., if a > 0.25, defection remains conﬁned to a 3 3 square at T = 3. Here we see the paradigmatic effect of memory: it tends to avoid the spread of defection. If memory is limited to the last three iterations: ðT 2Þ ðT Þ ðT2Þ ðT 1Þ ðT Þ ðT Þ pi,j ¼ a2 pi,j þ api,j þ pi,j ,mi,j ¼ ða2 d i,j ðT 1Þ ðT Þ ðT Þ þad i,j þ d i,j =ða2 þ a þ 1Þ, ) di,j ¼ round ðT Þ ð2Þ ð1Þ mi,j , with assignations at T = 2: pi,j ¼ api,j ð2Þ

ð2Þ

ð2Þ

177

conditions when b = 1.85. When starting from a single defector, f at time step T is computed as the frequency of cooperators within the square of size (2(T 1) + 1)2 centered on the initial D site. The ahistoric plot reveals the convergence of f to 0.318, (which seems to be the same value regardless of the initial conditions (Nowak and May 1992)). Starting from a single defector (a), the model with small memory (a = 0.1) seems to reach a similar f value, but sooner and in a smoother way. The plot corresponding to a = 0.2 still shows an early decay in f that leads it to about 0.6, but higher memory factor values lead f close to or over 0.9 very soon. Starting at random (b), the curves corresponding to 0.1 a 0.6 (thus with no memory of choices) do mimic the ahistoric curve but with higher f, as a 0.7 (also memory of choices) the frequency of cooperators grows monotonically to reach almost full cooperation: D persists as scattered unconnected small oscillators (D-blinkers), as shown in Fig. 23. Similar results are found for any temptation value in the parameter region 0.8 < b < 2.0, in which spatial chaos is characteristic in the ahistoric model. It is then concluded that short-type memory supports cooperation. As a natural extension of the described binary model, the 0-1 assumption underlying the model can be relaxed by allowing for degrees of cooperation in a continuous-valued scenario. Denoting by x the degree of cooperation of player A and by y the degree of cooperation of the player B, a consistent way to specify the pay-off for values of x and y other than zero or one is to simply interpolate between the extreme payoffs of the binary case. Thus, the payoff that the player A receives is:

R GA ðx,yÞ ¼ ðx, 1 xÞ T

S P

y : 1y

þpi,j ,di,j ¼ d i,j . Memory has a dramatic restrictive effect on In the continuous-valued historic the advance of defection as shown in Fig. 22. formulation ð2Þ ð 1Þ ð2Þ This ﬁgure shows the frequency of cooperators it is d m, including di,j ¼ ad i,j þ d i,j = (f) starting from a single defector and from a ða þ 1Þ . Table 2 illustrates the initial scenario random conﬁguration of defectors in a lattice of starting from a single (full) defector. Unlike in size 400 400 with periodic boundary the binary model, in which the initial defector

178 Cellular Automata with Memory, Table 1 Choices at T = 1 and T = 2; accumulated payoffs after T = 1 and T = 2 starting from a single defector in the SPD. b > 9/8

Cellular Automata with Memory d(1) = d(1) 1 1 1 1 1 1 1 1 1 1 p(1) = p(1) 9 9 9 8 9 8 9 8 9 9 d(2) = d(2) 1 1 1 1 1 1 1 1 1 1 1 1 1 1 p(2) = ap(1) + p(2) 9a + 9 9a + 9 9a + 9 9a + 8 9a + 9 9a + 9 9a + 9 9a + 9 9a + 9 9a + 9 9a + 9 9a + 8 9a + 9 9a + 9

1 1 0 1 1

1 1 1 1 1

1 1 1 1 1

9 8 8b 8 9

9 8 8 8 9

9 9 9 9 9

1 1 0 0 0 1 1

1 1 0 0 0 1 1

1 1 0 0 0 1 1

1 1 1 1 1 1 1

1 1 1 1 1 1 1

9a + 9 9a + 7 8a + 5b 8a + 3b 8a + 5b 9a + 7 9a + 9

9a + 9 9a + 6 8a + 3b 8a 8a + 3b 9a + 6 9a + 9

9a + 9 9a + 7 8a + 5b 8a + 3b 8a + 5b 9a + 7 9a + 9

9a + 9 9a + 8 9a + 9 9a + 9 9a + 9 9a + 8 9a + 9

9a + 9 9a + 9 9a + 9 9a + 9 9a+ 9 9a + 9 9a + 9

never becomes a cooperator, the initial defector cooperates with degree a/(1 + a) at T = 3: its neighbors which received the highest accumulated payoff (those in the corners with p(2) = 8a + 5b > 8ba), achieved this mean degree of cooperation after T = 2. Memory dramatically constrains the advance of defection in a smooth way, even for the low level a = 0.1. The effect appears much more homogeneous compared to the binary model, with no special case for high values of a, as memory on decisions is always operative in the continuous-valued model (Alonso-Sanz and Martin 2006b). The effect of unlimited trailing memory on the SPD has been studied in Alonso-Sanz (1999, 2003, 2004a, b, 2005a, b).

Discrete-Time Dynamical Systems Memory can be embedded in any model in which time plays a dynamical role. Thus, Markov chains p0T þ1 ¼ p0T M become with memory: p0T þ1 ¼ ı0T M with ıT being a weighted mean of the probability distributions up to T: ıT = p(p1, . . ., pT). In such scenery, even a minimal incorporation of memory notably alters the evolution of p (Alonso-Sanz and Martin 2006a). Last but not least, conventional, non-spatialized, discrete dynamical systems become with memory: xT + 1 = f(mT) with mT being an average of past values. As an overall rule, memory leads the dynamics a ﬁxed point of the map f (Aicardi and Invernizzi 1982). We will introduce an example of this in the context of the PD game in which players follow

Cellular Automata with Memory

Cellular Automata with Memory, Fig. 22 Frequency of cooperators (f) with memory of the last three iterations. a starting from a single defector, b starting at random (f(1) = 0.5). The red curves correspond to the ahistoric Cellular Automata with Memory, Fig. 23 Patterns at T = 200 starting at random in the scenario of Fig. 22b

179

model, the blue ones to the full memory model, the remaining curves to values of a from 0.1 to 0.9 by 0.1 intervals, in which, as a rule, the higher the a the higher the f for any given T

180 Cellular Automata with Memory, Table 2 Weighted mean degrees of cooperation after T = 2 and degree of cooperation at T = 3 starting with a single defector in the continuousvalued SPD with b = 1.85

Cellular Automata with Memory d(2) 1 1 1 1

1

1

1

a 1þa a 1þa a 1þa

a 1þa

a 1þa

a 1þa a 1þa a 1þa

1

1

1

1 1 d(3)(a < 0.25) 1 1 a 1 1þa 1 1 1 1

a 1þa a 1þa a 1þa a 1þa

1 1 d(3)(a < 0.25) 1 1 1 1 1 1

0

1 1

1

1

1

1

a 1þa a 1þa a 1þa a 1þa a 1þa

a 1þa a 1þa a 1þa a 1þa a 1þa

a 1þa a 1þa a 1þa a 1þa a 1þa

a 1þa a 1þa a 1þa a 1þa a 1þa

1

1

1

1

1

1 1

1 1

1 1

1 1

a 1þa a 1þa a 1þa

a 1þa a 1þa a 1þa

1 1 1

1 1

1 1

1

1

1

1

a 1þa a 1þa a 1þa

1 1

1 1

1 1

the so-called Paulov strategy: a Paulov player cooperates if and only if both players opted for the same alternative in the previous move. The name Paulov stems from the fact that this strategy embodies an almost reﬂex-like response to the payoff: it repeats its former move if it was rewarded by T or R, but switches behavior if it was punished by receiving only P or S. By coding cooperation as 1 and defection as 0, this strategy can be formulated in terms of the choices x of Player A (Paulov) and y of Player B as: x(T+1) = 1 j x(T) y(T)j. The Paulov strategy has proved to be very successful in its contests with other strategies (Nowak and Sigmund 1993). Let us give a simple example of this: suppose that Player B adopts an Anti-Paulov strategy (which cooperates to the extent Paulov defects) with y(T+1) = 1 j 1 x(T) y(T)j. Thus, in an iterated Paulov-Anti-Paulov (PAP) contest, with T(x, y) = (1 |x y|, 1 |1 x y|), it is T(0, 0) = T(1, 1) = (1, 0), T(1, 0) = (0, 1), and T(0, 1) = (0, 1), so that (0,1) turns out to be

1 1

1 1 1 1 1 1

1 1 1 1

1 1

immutable. Therefore, in an iterated PAP contest, Paulov will always defect, and Anti-Paulov will always cooperate. Relaxing the 0-1 assumption in the standard formulation of the PAP contest, degrees of cooperation can be considered in a continuous-valued scenario. Now x and y will denote the degrees of cooperation of players A and B respectively, with both x and y lying in [0,1]. In this scenario, not only (0,1) is a ﬁxed point, but also T(0.8, 0.6) = (0.8, 0.6). Computer implementation of the iterated PAP tournament turns out to be fully disrupting of the theoretical dynamics. The errors caused by the ﬁnite precision of the computer ﬂoating point arithmetics (a common problem in dynamical systems working modulo 1) make the ﬁnal fate of every point to be (0,1). With no exceptions: even the theoretically ﬁxed point (0.8,0.6) ends up as (0,1) in the computerized implementation. A natural way to incorporate older choices in the strategies of decision is to feature players by a

Cellular Automata with Memory

181

Cellular Automata with Memory, Fig. 24 Dynamics of the mean values of x (red) and y (blue) starting from any of the points of the 1 1 square

summary (m) of their own choices farther back in time. The PAP contest becomes in this way: xðT þ1Þ ¼ 1 j mðxT Þ mðyT Þ j , yðT þ1Þ ¼ 1 j 1 mðxT Þ mðyT Þ j. The simplest historic extension results in considering only the two last choices: m(z(T 1), z(T)) = (az(T 1) + z(T))/(a + 1) (z stands for both x and y) (Alonso-Sanz 2005b). Figure 24 shows the dynamics of the mean values of x and y starting from any of the 101 101 lattice points of the 1 1 square with sides divided by 0.01 intervals. The dynamics in the ahistoric context are rather striking: immediately, at T = 2, both x and y increase from 0.5 up to app. 0.66( ’ 2/3), a value which remains stable up to app. T = 100, but soon after Paulov cooperation plummets, with the corresponding ﬁring of cooperation of Anti-Paulov: ﬁnite precision arithmetics leads every point to (0,1). With memory, Paulov not only keeps a permanent mean degree cooperation but it is higher than that of AntiPaulov; memory tends to lead the overall dynamics to the ahistoric (theoretically) ﬁxed point (0.8, 0.6).

Future Directions Embedding memory in states (and in links if wiring is also dynamic) broadens the spectrum of CA as a tool for modeling, in a fairly natural way of easy computer implementation. It is likely that in some contexts, a transition rule with memory could match the correct behavior of the CA system of a given complex system (physical, biological, social and so on). A major impediment in modeling with CA stems from the difﬁculty of utilizing the CA complex behavior to exhibit a particular behavior

or perform a particular function. Average memory in CA tends to inhibit complexity, inhibition that can be modulated by varying the depth of memory, but memory not of average type opens a notable new perspective in CA. This could mean a potential advantage of CAwith memory over standard CA as a tool for modeling. Anyway, besides their potential applications, CA with memory (CAM) have an aesthetic and mathematical interest on their own. Thus, it seems plausible that further study on CA with memory should turn out proﬁtable, and, maybe that as a result of a further rigorous study of CAM it will be possible to paraphrase T. Toffoli in presenting CAM – as an alternative to (rather than an approximation of) integro-differential equations in modeling – phenomena with memory.

Bibliography Primary Literature Adamatzky A (1994) Identiﬁcation of cellular automata. Taylor and Francis, London Adamatzky A (2001) Computing in nonlinear media and automata collectives. IoP Publishing, London Adamatzky A, Holland O (1998) Phenomenology of excitation in 2-D cellular automata and swarm systems. Chaos, Solitons Fractals 9:1233–1265 Aicardi F, Invernizzi S (1982) Memory effects in discrete dynamical systems. Int J Bifurc Chaos 2(4):815–830 Alonso-Sanz R (1999) The historic prisoner’s dilemma. Int J Bifurc Chaos 9(6):1197–1210 Alonso-Sanz R (2003) Reversible cellular automata with memory. Phys D 175:1–30 Alonso-Sanz R (2004a) One-dimensional, r = 2 cellular automata with memory. Int J Bifurc Chaos 14:3217–3248 Alonso-Sanz R (2004b) One-dimensional, r = 2 cellular automata with memory. Int J BifurcChaos 14:3217–3248

182 Alonso-Sanz R (2005a) Phase transitions in an elementary probabilistic cellular automaton with memory. Phys A 347:383–401 Alonso-Sanz R (2005b) The Paulov versus Anti-Paulov contest with memory. Int J Bifurc Chaos 15(10):3395–3407 Alonso-Sanz R (2006a) A structurally dynamic cellular automaton with memory in the triangular tessellation. Complex Syst 17(1):1–15 Alonso-Sanz R (2006b) The beehive cellular automaton with memory. J Cell Autom 1:195–211 Alonso-Sanz R (2007a) Reversible structurally dynamic cellular automata with memory: a simple example. J Cell Autom 2:197–201 Alonso-Sanz R (2007b) A structurally dynamic cellular automaton with memory. Chaos, Solitons Fractals 32:1285–1295 Alonso-Sanz R, Adamatzky A (2008) On memory and structurally dynamism in excitable cellular automata with defensive inhibition. Int J Bifurc Chaos 18(2):527–539 Alonso-Sanz R, Cardenas JP (2007) On the effect of memory in Boolean networks with disordered dynamics: the K = 4 case. Int J Modrn Phys C 18:1313–1327 Alonso-Sanz R, Martin M (2002a) One-dimensional cellular automata with memory: patterns starting with a single site seed. Int J Bifurc Chaos 12:205–226 Alonso-Sanz R, Martin M (2002b) Two-dimensional cellular automata with memory: patterns starting with a single site seed. Int J Mod Phys C 13:49–65 Alonso-Sanz R, Martin M (2003) Cellular automata with accumulative memory: legal rules starting from a single site seed. Int J Mod Phys C 14:695–719 Alonso-Sanz R, Martin M (2004a) Elementary probabilistic cellular automata with memory in cells. In: Sloot PMA et al (eds) LNCS, vol 3305. Springer, Berlin, pp 11–20 Alonso-Sanz R, Martin M (2004b) Elementary cellular automata with memory. Complex Syst 14:99–126 Alonso-Sanz R, Martin M (2004c) Three-state one-dimensional cellular automata with memory. Chaos, Solitons Fractals 21:809–834 Alonso-Sanz R, Martin M (2005) One-dimensional cellular automata with memory in cells of the most frequent recent value. Complex Syst 15:203–236 Alonso-Sanz R, Martin, M (2006a) A structurally dynamic cellular automaton with memory in the hexagonal tessellation. In: El Yacoubi S, Chopard B, Bandini S (eds) LNCS, vol 4774. Springer, Berlin, pp 30–40 Alonso-Sanz R, Martin M (2006b) Elementary cellular automata with elementary memory rules in cells: the case of linear rules. J Cell Autom 1:70–86 Alonso-Sanz R, Martin M (2006c) Memory boosts cooperation. Int J Mod Phys C 17(6):841–852 Alonso-Sanz R, Martin MC, Martin M (2000) Discounting in the historic prisoner’s dilemma. Int J Bifurc Chaos 10(1):87–102 Alonso-Sanz R, Martin MC, Martin M (2001a) Historic life. Int J Bifurc Chaos 11(6):1665–1682

Cellular Automata with Memory Alonso-Sanz R, Martin MC, Martin M (2001b) The effect of memory in the spatial continuous-valued prisoner’s dilemma. Int J Bifurc Chaos 11(8):2061–2083 Alonso-Sanz R, Martin MC, Martin M (2001c) The historic strategist. Int J Bifurc Chaos 11(4):943–966 Alonso-Sanz R, Martin MC, Martin M (2001d) The historic-stochastic strategist. Int J Bifurc Chaos 11(7):2037–2050 Alvarez G, Hernandez A, Hernandez L, Martin A (2005) A secure scheme to share secret color images. Comput Phys Commun 173:9–16 Fredkin E (1990) Digital mechanics. An informal process based on reversible universal cellular automata. Physica D 45:254–270 Grössing G, Zeilinger A (1988) Structures in quantum cellular automata. Physica B 15:366 Hauert C, Schuster HG (1997) Effects of increasing the number of players and memory steps in the iterated prisoner’s dilemma, a numerical approach. Proc R Soc Lond B 264:513–519 Hooft G (1988) Equivalence relations between deterministic and quantum mechanical systems. J Stat Phys 53(1/2):323–344 Ilachinski A (2000) Cellular automata. World Scientiﬁc, Singapore Ilachinsky A, Halpern P (1987) Structurally dynamic cellular automata. Complex Syst 1:503–527 Kaneko K (1986) Phenomenology and characterization of coupled map lattices. In: Dynamical systems and sigular phenomena. World Scientiﬁc, Singapore Kauffman SA (1993) The origins of order: selforganization and selection in evolution. Oxford University Press, Oxford Lindgren K, Nordahl MG (1994) Evolutionary dynamics of spatial games. Physica D 75:292–309 Love PJ, Boghosian BM, Meyer DA (2004) Lattice gas simulations of dynamical geometry in one dimension. Phil Trans R Soc Lond A 362:1667 Margolus N (1984) Physics-like models of computation. Physica D 10:81–95 Martin del Rey A, Pereira Mateus J, Rodriguez Sanchez G (2005) A secret sharing scheme based on cellular automata. Appl Math Comput 170(2):1356–1364 Nowak MA, May RM (1992) Evolutionary games and spatial chaos. Nature 359:826 Nowak MA, Sigmund K (1993) A strategy of win-stay, lose-shift that outperforms tit-for-tat in the Prisoner’s Dilemma game. Nature 364:56–58 Requardt M (1998) Cellular networks as models for Plankscale physics. J Phys A 31:7797 Requardt M (2006a) The continuum limit to discrete geometries. arxiv.org/abs/math-ps/0507017 Requardt M (2006b) Emergent properties in structurally dynamic disordered cellular networks. J Cell Autom 2:273 Ros H, Hempel H, Schimansky-Geier L (1994) Stochastic dynamics of catalytic CO oxidation on Pt(100). Pysica A 206:421–440

Cellular Automata with Memory Sanchez JR, Alonso-Sanz R (2004) Multifractal properties of R90 cellular automaton with memory. Int J Mod Phys C 15:1461 Stauffer D, Aharony A (1994) Introduction to percolation theory. CRC Press, London Svozil K (1986) Are quantum ﬁelds cellular automata? Phys Lett A 119(41):153–156 Toffoli T, Margolus M (1987) Cellular automata machines. MIT Press, Cambridge, MA Toffoli T, Margolus N (1990) Invertible cellular automata: a review. Physica D 45:229–253 Vichniac G (1984) Simulating physics with cellular automata. Physica D 10:96–115 Watts DJ, Strogatz SH (1998) Collective dynamics of small-world networks. Nature 393:440–442

183 Wolf-Gladrow DA (2000) Lattice-gas cellular automata and lattice Boltzmann models. Springer, Berlin Wolfram S (1984) Universality and complexity in cellular automata. Physica D 10:1–35 Wuensche A (2005) Glider dynamics in 3-value hexagonal cellular automata: the beehive rule. Int J Unconv Comput 1:375–398 Wuensche A, Lesser M (1992) The global dynamics of cellular automata. Addison-Wesley, Reading

Books and Reviews Alonso-Sanz R (2008) Cellular automata with memory. Old City Publising, Philadelphia

Classification of Cellular Automata Klaus Sutner Carnegie Mellon University, Pittsburgh, PA, USA

Article Outline Glossary Deﬁnition of the Subject Introduction Reversibility and Surjectivity Deﬁnability and Computability Computational Equivalence Conclusion Bibliography

Glossary Cellular automaton For our purposes, a (one-dimensional) cellular automaton (CA) is given by a local map r : Sw ! S where S is the underlying alphabet of the automaton and w is its width. As a data structure, suitable as input to a decision algorithm, a CA can thus be speciﬁed by a simple lookup table. We abuse notation and write r(x) for the result of applying the global map of the CA to conﬁguration x Sℤ. Finite conﬁgurations One often considers CA with a special quiescent state: the homogeneous conﬁguration where all cells are in the quiescent state is required to be ﬁxed point under the global map. Inﬁnite conﬁgurations where all but ﬁnitely many cells are in the quiescent state are often called ﬁnite conﬁgurations. This is somewhat of a misnomer; we prefer to speak about conﬁgurations with ﬁnite support. Reversibility A discrete dynamical system is reversible if the evolution of the system incurs

no loss of information: the state at time t can be recovered from the state at time t + 1. For CAs this means that the global map is injective. Semi-decidability A problem is said to be semidecidable or computably enumerable if it admits an algorithm that returns “yes” after ﬁnitely many steps if this is indeed the correct answer. Otherwise the algorithm never terminates. The Halting Problem is the standard example for a semi-decidable problem. A problem is decidable if, and only if, the problem itself and its negation are semidecidable. Surjectivity The global map of a CA is surjective if every conﬁguration appears as the image of another. By contrast, a conﬁguration that fails to have a predecessor is often referred to as a Garden-of-Eden. Undecidability It was recognized by logicians and mathematicians in the ﬁrst half of the 20th century that there is an abundance of well-deﬁned problems that cannot be solved by means of an algorithm, a mechanical procedure that is guaranteed to terminate after ﬁnitely many steps and produce the appropriate answer. The best known example of an undecidable problem is Turing’s Halting Problem: there is no algorithm to determine whether a given Turing machine halts when run on an empty tape. Universality A computational device is universal it is capable of simulating any other computational device. The existence of universal computers was another central insight of the early days of computability theory and is closely related to undecidability. Wolfram classes Wolfram proposed a heuristic classiﬁcation of cellular automata based on observations of typical behaviors. The classiﬁcation comprises four classes: evolution leads to trivial conﬁgurations, to periodic conﬁgurations, evolution is chaotic, evolution leads to complicated, persistent structures.

# Springer-Verlag 2009 A. Adamatzky (ed.), Cellular Automata, https://doi.org/10.1007/978-1-4939-8700-9_50 Originally published in R. A. Meyers (ed.), Encyclopedia of Complexity and Systems Science, # Springer-Verlag 2009 https://doi.org/10.1007/978-0-387-30440-3_50

185

186

Definition of the Subject Cellular automata display a large variety of behaviors. This was recognized clearly when extensive simulations of cellular automata, and in particular one-dimensional CA, became computationally feasible around 1980. Surprisingly, even when one considers only elementary CA, which are constrained to a binary alphabet and local maps involving only nearest neighbors, complicated behaviors are observed in some cases. In fact, it appears that most behaviors observed in automata with more states and larger neighborhoods already have qualitative analogues in the realm of elementary CA. Careful empirical studies lead Wolfram to suggest a phenomenological classiﬁcation of CA based on the long-term evolution of conﬁgurations, see Wolfram (1984b, 2002b) and section “Introduction”. While Wolfram’s four classes clearly capture some of the behavior of CA it turns out that any attempt at formalizing this taxonomy meets with considerable difﬁculties. Even apparently simple questions about the behavior of CA turn out to be algorithmically undecidable and it is highly challenging to provide a detailed mathematical analysis of these systems.

Introduction In the early 1980s Wolfram published a collection of 20 open problems in the theory of CA, see Wolfram (1985). The ﬁrst problem on his list is “What overall classiﬁcation of cellular automata behavior can be given?” As Wolfram points out, experimental mathematics provides a ﬁrst answer to this problem: one performs a large number of explicit simulations and observes the patterns associated with the long term evolution of a conﬁguration, see Wolfram (1984a, 2002b). Wolfram proposed a classiﬁcation that is based on extensive simulations in particular of one-dimensional cellular automata where the evolution of a conﬁguration can be visualized naturally as a two-dimensional image. The classiﬁcation involves four classes that can be described as follows:

Classification of Cellular Automata

• W1: Evolution leads to homogeneous ﬁxed points. • W2: Evolution leads to periodic conﬁgurations. • W3: Evolution leads to chaotic, aperiodic patterns. • W4: Evolution produces persistent, complex patterns of localized structures. Thus, Wolfram’s ﬁrst three classes follow closely concepts from continuous dynamics: ﬁxed point attractors, periodic attractors and strange attractors, respectively. They correspond roughly to systems with zero temporal and spatial entropy, zero temporal entropy but positive spatial entropy, and positive temporal and spatial entropy, respectively. W4 is more difﬁcult to associate with a continuous analogue except to say that transients are typically very long. To understand this class it is preferable to consider CA as models of massively parallel computation rather than as particular discrete dynamical systems. It was conjectured by Wolfram that W4 automata are capable of performing complicated computations and may often be computationally universal. Four examples of elementary CA that are typical of the four classes are shown in Fig. 1. Li and Packard (1990), Li et al. (1990) proposed a slightly modiﬁed version of this hierarchy by reﬁning the low classes and in particular Wolfram’s W2. Much like Wolfram’s classiﬁcation, the Li–Packard classiﬁcation is concerned with the asymptotic behavior of the automaton, the structure and behavior of the limiting conﬁgurations. Here is one version of the Li–Packard classiﬁcation, see Li et al. (1990). • LP1: Evolution leads to homogeneous ﬁxed points. • LP2: Evolution leads to non-homogeneous ﬁxed points, perhaps up a to a shift. • LP3: Evolution leads to ultimately periodic conﬁgurations. Regions with periodic behavior are separated by domain walls, possibly up to a shift. • LP4: Conﬁgurations produce locally chaotic behavior. Regions with chaotic behavior are separated by domain walls, possibly up to a shift.

Classification of Cellular Automata

187

Classification of Cellular Automata, Fig. 1 Typical examples of the behavior described by Wolfram’s classes among elementary cellular automata

• LP5: Evolution leads to chaotic patterns that are spatially unbounded. • LP6: Evolution is complex. Transients are long and lead to complicated space-time patterns which may be non-monotonic in their behavior. By contrast, a classiﬁcation closer to traditional dynamical systems theory was introduced by Kůrka, see Kůrka (1997, 2003). The classiﬁcation rests on the notions of equicontinuity, sensitivity to initial conditions and expansivity. Suppose x is a point in some metric space and f a map on that space. Then f is equicontinuous at x if 8e > 0∃d > 08y Bd ðxÞ, n ℕðd ðf n ðxÞ, f n ðyÞÞ < eÞ where d(., .) denotes a metric. Thus, all points in a sufﬁciently small neighborhood of x remain close to the iterates of x for the whole orbit. Global equicontinuity is a fairly strong condition, it implies that the limit set of the automaton is

reached after ﬁnitely many steps. The map is sensitive (to initial conditions) if 8x,e > 0∃d > 08y Bd ðxÞ∃n ℕðd ðf n ðxÞ, f n ðyÞÞ eÞ: Lastly, the map is positively expansive if ∃e > 08x 6¼ y∃n ℕðd ðf n ðxÞ, f n ðyÞÞ eÞ: Kůrka’sclassiﬁcation then takes the following form. • K1: All points are equicontinuous under the global map. • K2: Some but not all points are equicontinuous under the global map. • K3: The global map is sensitive but not positively expansive. • K4: The global map is positively expansive. This type of classiﬁcation is perfectly suited to the analysis of uncountable spaces such as the Cantor space {0, 1}ℕ or the full shift space Sℤ

188

which carry a natural metric structure. For the most part we will not pursue the analysis of CA by topological and measure theoretic means here and refer to ▶ “Topological Dynamics of Cellular Automata” in this volume for a discussion of these methods. See section “Deﬁnability and Computability” for the connections between topology and computability. Given the apparent complexity of observable CA behavior one might suspect that it is difﬁcult to pinpoint the location of an arbitrary given CA in any particular classiﬁcation scheme with any precision. This is in contrast to simple parameterizations of the space of CA rules such as Langton’s l parameter that are inherently easy to compute. Brieﬂy, the l value of a local map is the fraction of local conﬁgurations that map to a nonzero value, see Langton (1990), Li et al. (1990). Small l values result in short transients leading to ﬁxed points or simple periodic conﬁgurations. As l increases the transients grow longer and the orbits become more and more complex until, at last, the dynamics become chaotic. Informally, sweeping the l value from 0 to 1 will produce CA in W1, then W2, then W4 and lastly in W3. The last transition appears to be associated with a threshold phenomenon. It is unclear what the connection between Langton’s l-value and computational properties of a CA is, see Mitchell et al. (1994), Packard (1988). Other numerical measures that appear to be loosely connected to classiﬁcations are the mean ﬁeld parameters of Gutowitz (1996a, b), the Z-parameter by Wuensche (1999), see also Oliveira et al. (2001). It seems doubtful that a structured taxonomy along the lines of Wolfram or Li–Packard can be derived from a simple numerical measure such as the l value alone, or even from a combination of several such values. However, they may be useful as empirical evidence for membership in a particular class. Classiﬁcation also becomes signiﬁcantly easier when one restricts one’s attention to a limited class of CA such as additive CA, see ▶ “Additive Cellular Automata”. In this context, additive means that rule of the automaton has the form the local P ! r x ¼ i ci xi where the coefﬁcients as well as the states are modular numbers. A number of

Classification of Cellular Automata

properties starting with injectivity and surjectivity as well as topological properties such as equicontinuity and sensitivity can be expressed in terms of simple arithmetic conditions on the rule coefﬁcients. For example, equicontinuity is equivalent to all prime divisors of the modulus m dividing all coefﬁcients ci, i > 1, see Manzini and Margara (1999) and the references therein. It is also noteworthy that in the linear case methods tend to carry over to arbitrary dimensions; in general there is a signiﬁcant step in complexity from dimension one to dimension two. No claim is made that the given classiﬁcations are complete; in fact, one should think of them as prototypes rather than deﬁnitive taxonomies. For example, one might add the class of nilpotent CA at the bottom. A CA is nilpotent if all conﬁgurations evolve to a particular ﬁxed point after ﬁnitely many steps. Equivalently, by compactness, there is a bound n such that all conﬁgurations evolve to the ﬁxed point in no more than n steps. Likewise, we could add the class of intrinsically universal CA at the top. A CA is intrinsically universal if it is capable of simulating all other CA of the same dimension in some reasonable sense. For a fairly natural notion of simulation see Ollinger (2003). At any rate, considerable effort is made in the references to elaborate the characteristics of the various classes. For many concrete CA visual inspection of the orbits of a suitable sample of conﬁgurations readily suggests membership in one of the classes.

Reversibility and Surjectivity A ﬁrst tentative step towards the classiﬁcation of a dynamical systems is to determine its reversibility or lack thereof. Thus we are trying to determine whether the evolution of the system is associated with loss of information, or whether it is possible to reconstruct the state of the system at time t from its state at time t + 1. In terms of the global map of the system we have to decide injectivity. Closely related is the question whether the global map is surjective, i. e., whether there is no Garden-ofEden: every conﬁguration has a predecessor under the global map. As a consequence, the limit set of

Classification of Cellular Automata

the automaton is the whole space. It was shown of Hedlund that for CA the two notions are connected: every reversible CA is also surjective, see Hedlund (1969), ▶ “Reversible Cellular Automata”. As a matter of fact, reversibility of the global map of a CA implies openness of the global map, and openness implies surjectivity. The converse implications are both false. By a well-known theorem by Hedlund (1969) the global maps of CA are precisely the continuous maps that commute with the shift. It follows from basic topology that the inverse global map of a reversible CA is again the global map of a suitable CA. Hence, the predecessor conﬁguration of a given conﬁguration can be reconstructed by another suitably chosen CA. For results concerning reversibility on the limit set of the automaton see Taati (2007). From the perspective of complexity the key result concerning reversible systems is the work by Lecerf (1963) and Bennett (1973). They show that reversible Turing machines can compute any partial recursive function, modulo a minor technical problem: In a reversible Turing machine there is no loss of information; on the other hand even simple computable functions are clearly irreversible in the sense that, say, the sum of two natural numbers does not determine these numbers uniquely. To address this issue one has to adjust the notion of computability slightly in the context of reversible computation: given a partial recursive function f : ℕ ! ℕ the function f^ðxÞ ¼ hx, f ðxÞi can be computed by a reversible Turing machine where h., .i is any effective pairing function. If f itself happens to be injective then there is no need for the coding device and f can be computed by a reversible Turing machine directly. For example, we can compute the product of two primes reversibly. Morita demonstrated that the same holds true for one-dimensional cellular automata (Morita 1994; Morita and Harao 1989; Toffoli and Margolus 1990), ▶ “Tiling Problem and Undecidability in Cellular Automata”: reversibility is no obstruction to computational universality. As a matter of fact, any irreversible cellular automaton can be simulated by a reversible one, at least on conﬁgurations with ﬁnite support.

189

Thus one should expect reversible CA to exhibit fairly complicated behavior in general. For inﬁnite, one-dimensional CA it was shown by Amoroso and Patt (1972) that reversibility is decidable. Moreover, it is decidable if the global map is surjective. An efﬁcient practical algorithm using concepts of automata theory can be found in Sutner (1991), see also Culik (1987), Delorme and Mazoyer (1999), Head (1989). The fast algorithm is based on interpreting a one-dimensional CA as a deterministic transducer, see Beal and Perrin (1997), Rozenberg and Salomaa (1997) for background. The underlying semi-automaton of the transducer is a de Bruijn automaton B whose states are words in Sw 1 where S is the alphabet of the CA and w is its width. The transitions are c given by ax! xb where a, b, c S, x Sw2 and c = r(axb), r being the local map of the CA. Since B is strongly connected, the product automaton of B will contain a strongly connected component C that contains the diagonal D, an isomorphic copy of B . The global map of the CA is reversible if, and only if, C = D is the only non-trivial component. It was shown by Hedlund (1969) that surjectivity of the global map is equivalent with local injectivity: the restriction of the map to conﬁgurations with ﬁnite support must be injective. The latter property holds if, and only if, C = D and is thus easily decidable. Automata theory does not readily generalize to words of dimensions higher than one. Indeed, reversibility and surjectivity in dimensions higher than one are undecidable, see Kari (1990) and ▶ “Tiling Problem and Undecidability in Cellular Automata” in this volume for the rather intricate argument needed to establish this fact. While the structure of reversible onedimensional CA is well-understood, see ▶ “Tiling Problem and Undecidability in Cellular Automata”, (Durand-Lose 2001), and while there is an efﬁcient algorithm to check reversibility, few methods are known that allow for the construction of interesting reversible CA. There is a noteworthy trick due to Fredkin that exploits the reversibility of the Fibonacci equation Xn+1 = Xn + Xn1. When addition is interpreted as exclusive or this can be used to construct a second-order CA from any given binary CA; the former can then be recoded

190

as a ﬁrst-order CA over a 4-letter alphabet. For example, for the open but irreversible elementary CA number 90 we obtain the CA shown in Fig. 2. Another interesting class of reversible onedimensional CA, the so-called partitioned cellular automata (PCA), is due to Morita and Harao, see Morita (1994, 1995), Morita and Harao (1989). One can think of a PCA as a cellular automaton whose cells are divided into multiple tracks; speciﬁcally Morita uses an alphabet of the form S = S1 S2 S3. The conﬁgurations of the automaton can be written as (X, Y, Z) where X S1ℤ, Y S2ℤ and Z S3ℤ. Now consider the shearing map s deﬁned by s(X, Y, Z) = (RS (X), Y, LS(Z)) where RS and LS denote the right and left shift, respectively. Given any function f : S ! S we can deﬁne a global map f ∘ s where f is assumed to be applied point-wise. Since the shearing map is bijective, the CA will be reversible if, and only if, the map f is bijective. It is relatively easy to construct bijections f that cause the CA to perform particular computational tasks, even when a direct construction appears to be entirely intractable. Classification of Cellular Automata, Fig. 2 A reversible automaton obtained by applying Fredkin’s construction to the irreversible elementary CA 77

Classification of Cellular Automata

Definability and Computability Formalizing Wolfram’s Classes Wolfram’s classiﬁcation is an attempt to categorize the complexity of the CA by studying the patterns observed during the long-term evolution of all conﬁgurations. The ﬁrst two classes are relatively easy to observe, but it is difﬁcult to distinguish between the last two classes. In particular W4 is closely related to the kind of behavior that would be expected in connection with systems that are capable of performing complicated computations, including the ability to perform universal computation; a property that is notoriously difﬁcult to check, see Soare (1987). The focus on the full conﬁguration space rather than a signiﬁcant subset thereof corresponds to the worst-case approach well-known in complexity theory and is somewhat inferior to an average case analysis. Indeed, Baldwin and Shelah point out that a product construction can be used to design a CA whose behavior is an amalgamation of the behavior of two given CA, see Baldwin (2002), Baldwin and Shelah (2000). By

Classification of Cellular Automata

combining CA in different classes one obtains striking examples of the weakness of the worstcase approach. A natural example of this mixed type of behavior is elementary CA 184 which displays class II or class III behavior, depending on the initial conﬁguration. Another basic example for this type of behavior is the well-studied elementary CA 30, see section “Conclusion”. Still, for many CA a worst-case classiﬁcation seems to provide useful information about the structural properties of the automaton. The ﬁrst attempt at formalizing Wolfram’s class was made by Culik and Yu who proposed the following hierarchy, given here in cumulative form, see Culik and Sheng (1988): • CY1: All conﬁgurations evolve to a ﬁxed point. • CY2: All conﬁgurations evolve to a periodic conﬁguration. • CY3: The orbits of all conﬁgurations are decidable. • CY4: No constraints. The Culik–Yu classiﬁcation employs two rather different methods. The ﬁrst two classes can be deﬁned by a simple formula in a suitable logic whereas the third (and the fourth in the disjoint version of the hierarchy) rely on notions of computability theory. As a general framework for both approaches we consider discrete dynamical systems, structures of the form A ¼ hC, !i where C Sℤ is the space of conﬁgurations of the system and ! is the “next conﬁguration” relation on C. We will only consider the deterministic case where for each conﬁguration x there exists precisely one conﬁguration y such that x ! y. Hence we are really dealing with algebras with one unary function, but iteration is slightly easier to deal with in the relational setting. The structures most important in this context are the ones arising from a CA. For any local map r we consider the structure A r ¼ hC, !i where the next conﬁguration relation is determined by x ! r(x). Using the standard language of ﬁrst order logic we can readily express properties of the CA in terms of the system A r . For example, the system is reversible, respectively surjective, if the following assertions are valid over A:

191

8 x,y,zðx ! z and y ! z implies x ¼ yÞ, 8 x∃yðy ! xÞ: As we have seen, both properties are easily decidable in the one-dimensional case. In fact, one can express the basic predicate x ! y (as well as equality) in terms of ﬁnite state machines on inﬁnite words. These machines are deﬁned like ordinary ﬁnite state machines but the acceptance condition requires that certain states are reached inﬁnitely and co-inﬁnitely often, see Börger et al. (2001), Grädel et al. (2002). The emptiness problem for these automata is easily decidable using graph theoretic algorithms. Since regular languages on inﬁnite words are closed under union, complementation and projection, much like their ﬁnite counterparts, and all the corresponding operations on automata are effective, it follows that one can decide the validity of ﬁrst order sentences over A r such as the two examples above: the modelchecking problem for these structures and ﬁrst order logic is decidable, see Libkin (2004). For example, we can decide whether there is a conﬁguration that has a certain number of predecessors. Alternatively, one can translate these sentences into monadic second order logic of one successor, and use well-known automata-based decision algorithms there directly, see Börger et al. (2001). Similar methods can be used to handle conﬁgurations with ﬁnite support, corresponding to weak monadic second order logic. Since the complexity of the decision procedure is non-elementary one should not expect to be able to handle complicated assertions. On the other hand, at least for weak monadic second order logic practical implementations of the decision method exist, see Elgaard et al. (1998). There is no hope of generalizing this approach as the undecidability of, say, reversibility in higher dimensions demonstrates. t Write x! t if x evolves to y in exactly t steps, þ x! y if x evolves to y in any positive number of steps and x! y if x evolves to y in any number of t steps. Note that ! is deﬁnable for each ﬁxed t, but ! fails to be so deﬁnable in ﬁrst order logic. This is in analogy to the undeﬁnability of path existence problems in the ﬁrst order theory of graphs, see Libkin (2004). Hence it is natural to

192

Classification of Cellular Automata

extend our language so we can express iterations of the global map, either by adding transitive closures or by moving to some limited system of higher order logic over A r where ! is deﬁnable, see Börger et al. (2001). Arguably the most basic decision problem associated with a system A that requires iteration of the global map is the Reachability Problem: given two conﬁgurations x and y, does the evolution of x lead to y? A closely related but different question is the Conﬂuence Problem: will two conﬁgurations x and y evolve to the same limit cycle? Conﬂuence is an equivalence relation and allows for the decomposition of conﬁguration space into limit cycles together with their basins of attraction. The Reachability and Conﬂuence Problem amount to determining, given conﬁgurations x and y, whether

x! y, ∃z x! z and y! z , respectively. As another example, the ﬁrst two Culik–Yu class can be deﬁned like so: 8x∃z x! z and z ! z , þ 8x∃z x! z and z! z : It is not difﬁcult to give similar deﬁnitions for the lower Li–Packard classes if one extends the language by a function symbol denoting the shift operator. The third Culik–Yu class is somewhat more involved. By deﬁnition, a CA lies in the third class if it admits a global decision algorithm to determine whether a given conﬁguration x evolves to another given conﬁguration y in a ﬁnite number of steps. In other words, we are looking for automata where the Reachability Problem is algorithmically solvable. While one can agree that W4 roughly translates into undecidability and is thus properly situated in the hierarchy, it is unclear how chaotic patterns in W3 relate to decidability. No method is known to translate the apparent lack of tangible, persistent patterns in rules such as elementary CA

30 into decision algorithms for Reachability. There is another, somewhat more technical problem to overcome in formalizing classiﬁcations. Recall that the full conﬁguration space is C = Sℤ. Intuitively, given x C we can effectively determine the next conﬁguration y = r(x). However, classical computability theory does not deal with inﬁnitary objects such as arbitrary conﬁguration so a bit of care is needed here. The key insight is that we can determine arbitrary ﬁnite segments of r(x) using only ﬁnite segments of x (and, of course, the lookup table for the local map). There are several ways to model computability on Sℤ based on this idea of ﬁnite approximations, we refer to Weihrauch (2000) for a particularly appealing model based on so-called type-2 Turing machines; the reference also contains many pointers to the literature as well as a comparison between the different approaches. It is easy to see that for any CA the global map r as well as all its iterates rt are computable, the latter uniformly in t. However, due to the ﬁnitary nature of all computations, equality is not decidable in type-2 computability: the unequal operator U0(x, y) = 0 if x 6¼ y, U0(x, y) undeﬁned otherwise, is computable and thus unequality is semidecidable, but the stronger U0(x, y) = 0 if x 6¼ y, U0(x, y) = 1, otherwise, is not computable. The last result is perhaps somewhat counterintuitive, but it is inevitable if we strictly adhere to the ﬁnite approximation principle. In order to avoid problems of this kind it has become customary to consider certain subspaces of the full conﬁguration space, in particular Cﬁn, the collection of conﬁgurations with ﬁnite support, Cper, the collection of spatially periodic conﬁgurations and Cap, the collection of almost periodic conﬁgurations of the form . . .uuuwvvv. . . where u, v and w are all ﬁnite words over the alphabet of the automaton. Thus, an almost periodic conﬁguration differs from a conﬁguration of the form ouvo in only ﬁnitely many places. Conﬁgurations with ﬁnite support correspond to the special case where u = v = 0 is a special quiescent symbol and spatially periodic conﬁgurations correspond to u = v, w = e. The most general type of conﬁguration that admits a ﬁnitary description is the class Crec of recursive conﬁgurations, where

Classification of Cellular Automata

the assignment of state to a cell is given by a computable function. It is clear that all these subspaces are closed under the application of a global map. Except for Cﬁn there are also closed under inverse maps in the following sense: given a conﬁguration y in some subspace that has a predecessor x in Call there already exists a predecessor in the same subspace, see Sutner (1991, 2003a). This is obvious except in the case of recursive conﬁgurations. The reference also shows that the recursive predecessor cannot be computed effectively from the target conﬁguration. Thus, for computational purposes the dynamics of the cellular automaton are best reﬂected in Cap: it includes all conﬁguration with ﬁnite support and we can effectively trace an orbit in both directions. It is not hard to see that Cap is the least such class. Alas, it is standard procedure to avoid minor technical difﬁculties arising from the inﬁnitely repeated spatial patterns and establish classiﬁcations over the subspace Cﬁn. There is a arguably not much harm in this simpliﬁcation since Cﬁn is a dense subspace of Call and compactness can be used to lift properties from Cﬁn to the full conﬁguration space. The Culik–Yu hierarchy is correspondingly deﬁned over Cﬁn, the class of all conﬁgurations of ﬁnite support. In this setting, the ﬁrst three classes of this hierarchy are undecidable and the fourth is undecidable in the disjunctive version: there is no algorithm to test whether a CA admits undecidable orbits. As it turns out, the CA classes are complete in their natural complexity classes within the arithmetical hierarchy (Shoenﬁeld 1967; Soare 1987). Checking membership in the ﬁrst two classes comes down to performing an inﬁnite number of potentially unbounded searches and can be described logically by a P2 expression, a formula of type 8 x ∃ y R(x, y) where R is a decidable predicate. Indeed, CY1 and CY2 are both P2-complete. Thus, deciding whether all conﬁgurations on a CA evolve to a ﬁxed point is equivalent to the classical problem of determining whether a semi-decidable set is inﬁnite. The third class is even less amenable to algorithmic attack; one can show that CY3 is S3-complete, see Sutner (1989). Thus, deciding whether all orbits are decidable is as difﬁcult as determining whether

193

any given semi-decidable set is decidable. It is not difﬁcult to adjust these undecidability results to similar classes such as the lower levels of the Li–Packard hierarchy that takes into account spatial displacements of patterns. Effective Dynamical Systems and Universality The key property of CA that is responsible for all these undecidability results is the fact that CA are capable of performing arbitrary computations. This is unsurprising when one deﬁnes computability in terms of Turing machines, the devices introduced by Turing in the 1930s, see Rogers (1967), Turing (1936). Unlike the Gödel–Herbrand approach using general recursive functions or Church’s l-calculus, Turing’s devices are naturally closely related to discrete dynamical systems. For example, we can express an instantaneous description of a Turing machine as a ﬁnite sequence al alþ1 . . . a1 p a1 a2 . . . ar where the ai are tape symbols and p is a state of the machine, with the understanding that the head is positioned at a1 and that all unspeciﬁed tape cells contain the blank symbol. Needless to say, these Turing machine conﬁgurations can also be construed as ﬁnite support conﬁgurations of a one-dimensional CA. It follows that a onedimensional CA can be used to simulate an arbitrary Turing machine, hence CA are computational universal: any computable function whatsoever can already be computed by a CA. Note, though, that the simulation is not entirely trivial. First, we have to rely on input/output conventions. For example, we may insist that objects in the input domain, typically tuples of natural numbers, are translated into a conﬁguration of the CA by a primitive recursive coding function. Second, we need to adopt some convention that determines when the desired output has occurred: we follow the evolution of the input conﬁguration until some “halting” condition applies. Again, this condition must be primitive recursively decidable though there is considerable leeway as to how the end of a computation should be signaled by the CA. For example, we could insist that a particular

194

cell reaches a special state, that an arbitrary cell reaches a special state, that the conﬁguration be a ﬁxed point and so forth. Lastly, if and when a halting conﬁguration is reached, we a apply a primitive recursive decoding function to obtain the desired output. Restricting the space to conﬁgurations that have ﬁnite support, that are spatially periodic, and so forth, produces an effective dynamical system: the conﬁgurations can be coded as integers in some natural way, and the next conﬁguration relation is primitive recursive in the sense that the corresponding relation on code numbers is so primitive recursive. A classical example for an effective dynamical system is given by selecting the instantaneous descriptions of a Turing machine M as conﬁgurations, and one-step relation of the Turing machine as the operation of C. Thus we obtain a system A M whose orbits represent the computations of the Turing machine. Likewise, given the local map r of a CA we obtain a system A r whose operation is the induced global map. While the full conﬁguration space Call violates the effectiveness condition, any of the spaces Cper, Cﬁn, Cap and Crec will give rise to an effective dynamical system. Closure properties as well as recent work on the universality of elementary CA 110, see section “Conclusion”, suggests that the class of almost periodic conﬁgurations, also known as backgrounds or wallpapers, see Cook (2004), Sutner (2003a), is perhaps the most natural setting. Both Cﬁn and Cap provide a suitable setting for a CA that simulates a Turing machine: we can interpret A M as a subspace of A r for some suitably constructed one-dimensional CA r; the orbits of the subspace encode computations of the Turing machine. It follows from the undecidability of the Halting Problem for Turing machines that the Reachability Problem for these particular CA is undecidable. Note, though, that orbits in A M may well be ﬁnite, so some care must be taken in setting up the simulation. For example, one can translate halting conﬁgurations into ﬁxed points. Another problem is caused by the worst-case nature of our classiﬁcation schemes: in Turing machines and their associated systems A M it is only behavior on specially prepared initial conﬁgurations that matters, whereas the behavior of a CA depends on all

Classification of Cellular Automata

conﬁgurations. The behavior of a Turing machine on all instantaneous descriptions, rather than just the ones that can occur during a legitimate computation on some actual input, was ﬁrst studied by Davis, see Davis (1956, 1957), and also Hooper (1966). Call a Turing machine stable if it halts on any instantaneous description whatsoever. With some extra care one can then construct a CA that lies in the ﬁrst Culik–Yu class, yet has the same computational power as the Turing machine. Davis showed that every total recursive function can already be computed by a stable Turing machine, so membership in CY1 is not an impediment to considerable computational power. The argument rests on a particular decomposition of recursive functions. Alternatively, one directly manipulate Turing machines to obtain a similar result, see Shepherdson (1965), Sutner (1989). On the other hand, unstable Turing machines yield a natural and codingfree deﬁnition of universality: a Turing machine is Davis-universal if the set of all instantaneous description on which the machine halts is S1complete. The mathematical theory of inﬁnite CA is arguably more elegant than the actually observable ﬁnite case. As a consequence, classiﬁcations are typically concerned with CA operating on inﬁnite grids, so that even a conﬁguration with ﬁnite support can carry arbitrarily much information. If we restrict our attention to the space of conﬁgurations on a ﬁnite grid a more ﬁne-grained analysis is required. For a ﬁnite grid of size n the conﬁguration space has the form Cn = [n] ! S and is itself ﬁnite, hence any orbit is ultimately periodic and the Reachability Problem is trivially decidable. However, in practice there is little difference between the ﬁnite and inﬁnite case. First, computational complexity issues make it practically impossible to analyze even systems of modest size. The Reachability Problem for ﬁnite CA, while decidable, is PSPACE-complete even in the one-dimensional case. Computational hardness appears in many other places. For example, if we try to determine whether a given conﬁguration on a ﬁnite grid is a Garden-of-Eden the problem turns out to be NLOG-complete in dimension one and ℕℙ-complete in all higher dimensions, see Sutner (1995).

Classification of Cellular Automata

Second, it stands to reason that the more interesting classiﬁcation problem in the ﬁnite case takes the following parameterized form: given a local map together with boundary conditions, determine the behavior of r on all ﬁnite grids. Under periodic boundary conditions this comes down to the study of Cper and it seems that there is little difference between this and the ﬁxed boundary case. Since all orbits on a ﬁnite grid are ultimately periodic one needs to apply a more ﬁnegrained classiﬁcation that takes into account transient lengths. It is undecidable whether all conﬁgurations on all ﬁnite grids evolve to a ﬁxed point under a given local map, see Sutner (1990). Thus, there is no algorithm to determine whether hC n , !i8x∃z x ! z and z ! z for all grid sizes n. The transient lengths are trivially bounded by kn where k is the size of the alphabet of the automaton. It is undecidable whether the transient lengths grow according to some polynomial bound, even when the polynomial in question is constant. Restrictions of the conﬁguration space are one way to obtain an effective dynamical system. Another is to interpret the approximation-based notion of computability on the full space in terms of topology. It is well-known that computable maps Call ! Call are continuous in the standard product topology. The clopen sets in this topology are the ﬁnite unions of cylinder sets where a cylinder set is determined by the values of a conﬁguration in ﬁnitely many places. By a celebrated result of Hedlund the global maps of a CA on the full space are characterized by being continuous and shift-invariant. Perhaps somewhat counterintuitively, the decidable subsets of Call are quite weak, they consist precisely of the clopen sets. Now consider a partition of Call into ﬁnitely many clopen sets C0, C2, . . ., Cn1. Thus, it is decidable which block of the partition a given point in the space belongs to. Moreover, Boolean operations on clopen sets as well as application of the global map and the inverse global map are all computable. The partition affords a natural projection p : Call ! Sn where Sn = {0, 1, . . ., n 1} and

195

p(x) = i iff x Ci. Hence the projection translates orbits in the full space Call into a class W of o-words over Sn, the symbolic orbits of the system. The Cantor space Sℤn together with the shift describes all logically possible orbits with respect to the given partition and W describes the symbolic orbits that actually occur in the given CA. The shift operator corresponds to an application of the global map of the CA. The ﬁnite factors of W provide information about possible ﬁnite traces of an orbit when ﬁltered through the given partition. Whole orbits, again ﬁltered through the partition, can be described by o-words. To tackle the classiﬁcation of the CA in terms of W it was suggested by Delvenne et al., see Delvenne et al. (2006), to refer to the CA as decidable if there it is decidable whether W has non-empty intersection with a o-regular language. Alas, decidability in this sense is very difﬁcult, its complexity being S11 -complete and thus outside of the arithmetical hierarchy. Likewise it is suggested to call a CA universal if the problem of deciding whether the cover of W, the collection of all ﬁnite factors, is S1-complete, in analogy to Davis-universality.

Computational Equivalence In recent work, Wolfram suggests a so-called Principle of Computational Equivalence, or PCE for short, see Wolfram (2002b, p. 717). PCE states that most computational processes come in only two ﬂavors: they are either of a very simple kind and avoid undecidability, or they represent a universal computation and are therefore no less complicated than the Halting Problem. Thus, Wolfram proposes a zero-one law: almost all computational systems, and thus in particular all CA, are either as complicated as a universal Turing machine or are computationally simple. As evidence for PCE Wolfram adduces a very large collection of simulations of various effective dynamical systems such as Turing machines, register machines, tag systems, rewrite systems, combinators, and cellular automata. It is pointed out in Chap. 3 of Wolfram (2002b), that in all these classes of systems there are surprisingly small examples that exhibit exceedingly complicated behavior – and

196

Classification of Cellular Automata

presumably are capable of universal computation. Thus it is conceivable that universality is a rather common property, a property that is indeed shared by all systems that are not obviously simple. Of course, it is often very difﬁcult to give a complete proof of the computational universality of a natural system, as opposed to carefully constructed one, so it is not entirely clear how many of Wolfram’s examples are in fact universal. As a case in point consider the universality proof of Conway’s Game of Life, or the argument for elementary CA 110. If Wolfram’s PCE can be formally established in some form it stands to reason that it will apply to all effective dynamical systems and in particular to CA. Hence, classiﬁcations of CA would be rather straightforward: at the top there would be the class of universal CA, directly preceded by a class similar to the third Culik–Yu class, plus a variety of subclasses along the lines of the lower Li–Packard classes. The corresponding problem in classical computability theory was ﬁrst considered in the 1930s by Post and is now known as Post’s Problem: is there a semi-decidable set that fails to be decidable, yet is not as complicated as the Halting Set? In terms of Turing degrees the problem thus is to construct a semi-decidable set A such that 0 0?

Problem TOPOLOGICAL ENTROPY is undecidable for every constant c > 0, even in the one-dimensional case. This can be proven using a direct reduction from NILPOTENCY (Hurd et al. 1992). Also, direct reductions from NILPOTENCY prove the undecidability of the following two problems (Durand et al. 2003; Kari 2008): EQUICONTINUITY Input: Question:

Cellular automaton A. Is A equicontinuous?

SENSITIVITY TO INITIAL CONDITIONS Input: Question:

Cellular automaton A. Is A sensitive to initial conditions?

The Tiling Problem and Its Variants Introduction Several decision problems concerning cellular automata are known to be undecidable, that is, no algorithm exists that solves them. Some undecidability results easily follow from the universal computation capabilities of cellular automata, while others require more elaborate proofs. Reductions from the tiling problem and its variants turn out to be useful in proving various questions concerning CA undecidable. We consider the problems of determining if a given two-dimensional CA

In this section, we discuss the tiling problem and several of its variants.

Definition of Tiles For our purposes, it is convenient to define tiles in a way that most closely resembles cellular automata. In the d-dimensional cellular space, the cells are indexed by ℤd. A neighborhood vector

206

a

Tiling Problem and Undecidability in Cellular Automata

b

a

c

a′

d

a′

q′

q′

a

qa

qa

e

qa

q

qa

q

a

a

Tiling Problem and Undecidability in Cellular Automata, Fig. 1 Machine tiles associated to a Turing machine

N¼

!

!

!

n 1, n 2, . . . , n m

Computations and Tilings

!

!

consists of m distinct elements n i ℤd . Each n i specifies the relative location of a neighbor of each cell. More precisely, the ith neighbor of the cell in ! ! ! position x ℤd is located at x þ n i . A tile set is a finite set T whose elements are called tiles. A local matching rule tells which patterns of tiles are allowed in valid tilings. The matching rule is given as an m-ary relation R Tm where m is the size of the neighborhood. Tilings are assignments t : ℤd ! T !

of tiles into cells. Tiling t is valid at x ℤd if ! ! ! ! t x þ n 1, x þ n 2, ! ! . . . , x þ x m R: Tiling t is called valid if it is valid at every ! position x ℤd . A convenient – and historically earlier – way of defining tiles is in terms of edge labelings. A Wang tile is a two-dimensional unit square with colored edges. The local matching rule is determined by these colors: A tiling is valid at ! position x ℤ2 if each of the four edges of ! the tile in position x has the same color as the abutting edge in the adjacent tile. Clearly, this is a two-dimensional tile set with the neighborhood vector ½ð1, 0Þ, ð1, 0Þ, ð0, 1Þ, ð0, 1Þ and a particular way of defining the local relation R.

The basic observation in establishing undecidability results concerning tilings is the fact that valid tilings can be forced to contain a complete simulation of a computation by a given Turing machine. To any given Turing machine M ¼ ðQ, G, d, q0 , qh , bÞ , we associate the Wang tiles shown in Fig. 1, and we call these tiles the machine tiles of M . Note that in the illustrations, instead of colors, we use labeled arrows on the sides of the tiles. Two adjacent tiles match if and only if an arrowhead meets an arrow tail with the same label. Such arrow representation can be converted into the usual coloring representation of Wang tiles by assigning to each arrow direction and label a unique color. The machine tiles of M contain the following tiles: 1. For every tape letter a G a tape tile of Fig. 1a. 2. For every tape letter a G and every state q Q an action tile of Fig. 1b or c. Tile (b) is used if dðq, aÞ ¼ ðq0 , a0 , 1Þ; and tile (c) is used if dðq, aÞ ¼ ðq0 , a0 þ 1Þ: 3. For every tape letter a G and non-halting state q Qnfqh g, two merging tiles shown in Fig. 1d. The idea of the tiles is that a configuration of the Turing machine M is represented as a row of tiles in such a way that the cell currently scanned by M is represented by an action tile, its neighbor

Tiling Problem and Undecidability in Cellular Automata

207

where the machine moves into has a merging tile and all other tiles on the row are tape tiles. If this row is part of a valid tiling, then it is clear that the rows above must be similar representations of subsequent configurations in the Turing machine computation, until the machine halts. The machine tiles above are the basic tiles associated to Turing machine M: Additional tiles will be added depending on the actual variant of the tiling problem.

until (if ever) a region is found that cannot be properly tiled. Note also that a semi-algorithm exists for those tile sets that admit a valid, totally periodic tiling: All totally periodic tilings can be effectively enumerated, and it is a simple matter to test each for validity of the tiling constraint. Combining the two semialgorithms above yields a semi-algorithm that correctly identifies tile sets that (i) do not admit any valid tiling or (ii) admit a valid periodic tiling. Only aperiodic tile sets fail to satisfy either (i) or (ii), so we see that the existence of aperiodic tile sets is implied by Theorem 1. In the following sections, we consider some variants of the tiling problem whose undecidability is easier to establish.

The Tiling Problem The tiling problem is the decision problem of determining if at least one valid tiling is admitted by the given set of tiles. TILING PROBLEM

Variants of the Tiling Problem Input: Question:

Tile set T. Does T admit a valid tiling? TILING PROBLEM WITH A SEED TILE

The tiling problem is easily seen decidable if the input is restricted to one-dimensional tile sets. It is a classical result by R. Berger that the tiling problem of two-dimensional tiles is undecidable, even if the input consists of Wang tiles (Berger 1966; Robinson 1971). Theorem 1 TILING PROBLEM is undecidable for Wang tile set T. The complement problem (nonexistence of valid tilings) is semi-decidable. We do not prove this result here. The undecidability proofs in (Berger 1966; Robinson 1971) are based on an explicit construction of an aperiodic tile set such that additional tiles implementing Turing machine simulations can be embedded in valid tilings. The aperiodic set is needed to force the presence of tiles that initiate Turing machine simulation in arbitrarily large regions. Note that semi-decidability of the complement problem is apparent: a semi-algorithm simply tries to tile larger and larger regions

Input: Question:

Tile set T and one tile s. Does T admit a valid tiling such that tile 5 is used at least once?

The seeded version was shown undecidable by H. Wang (1961). We present the proof here because the proof is quite simple and shows the general idea of how Turing machine halting problem can be reduced to problems concerning tiles. Theorem 2 TILING PROBLEM WITH A SEED TILE is undecidable for Wang tile sets. The complement problem is semi-decidable. Proof The semi-decidability of the complement problem follows from the following semi-algorithm: For r = 1,2,3,. . ., try all tilings of the radius r square around the origin to see if there is a valid tiling of the square such that the origin contains the seed tile s. If for some r such a tiling

208

a

Tiling Problem and Undecidability in Cellular Automata

b

q b

b

0

b

Tiling Problem and Undecidability in Cellular Automata, Fig. 2 (a) The blank tile and (b) three initialization tiles

is not found, then halt and report that there is no tiling containing the seed tile. Consider then undecidability. We reduce the decision problem TURING MACHINE HALTING ON BLANK TAPE, a problem that is well known to be undecidable. For any given Turing machine M, we can effectively construct a tile set and a seed tile in such a way that they form a positive instance of TILING PROBLEM WITH A SEED TILE if and only if M is a negative instance of TURING MACHINE HALTING ON BLANK TAPE. For the given Turing machine M, we construct the machine tiles of Fig. 1 as well as the four tiles shown in Fig. 2. These are the blank tile and three initialization tiles. They initialize all tape symbols to be equal to blank b and the Turing machine to be in the initial state q0. The middle initialization tile is chosen as the seed tile s. Let us prove that a valid tiling containing a copy of the seed tile exists if and only if the Turing machine M does not halt when started on the blank tape: “(”: Suppose that the Turing machine M does not halt on the blank tape. Then a valid tiling exists where one horizontal row is formed with the initialization tiles, all tiles below this row are blank, and the rows above the initialization row contain consecutive configurations of the Turing machine. “)”: Suppose that a valid tiling containing the middle initialization tile exists. The seed tile forces its row to be formed by the initialization tiles, representing the initial configuration of the Turing machine on the blank tape. The machine tiles force the following horizontal rows above

the seed row to contain the consecutive configurations of the Turing machine. There is no merge tile containing a halting state, so the Turing machine does not halt – otherwise, a valid tiling could not be formed. Conclusion: Suppose we had an algorithm that solves TILING PROBLEM WITH A SEED TILE. Then we also have an algorithm (which simply constructs the tile set as above and determines if a tiling with seed tile exists) that solves TURING MACHINE HALTING ON BLANK TAPE. This contradicts the fact that this problem is known to be undecidable. In the following tiling problem variant, we are given a Wang tile set T and specify one tile B T as the blank tile. The blank tile has all four sides colored by the same color. A finite tiling is a tiling where only a finite number of tiles are non-blank. A finite tiling where all tiles are blank is called trivial. FINITE TILING PROBLEM Instance: Problem:

A finite set T of Wang tiles and a blank tile B T. Does there exist a valid finite tiling that is not trivial?

Theorem 3 The FINITE TILING PROBLEM is undecidable. It is semi-decidable while its complement is not semi-decidable.

Tiling Problem and Undecidability in Cellular Automata

209

c

L

b a

a

L

a

L

a

L

R

a

R

qh R b

q b 0

b

R

qh

a

Tiling Problem and Undecidability in Cellular Automata, Fig. 3 (a) The blank tile B, (b) halting tiles, and (c) border tiles

Proof For semi-decidability, notice that we can try all valid tilings of larger and larger squares until we find a tiling of a square where all tiles on the boundary are blank, while some interior tile is different from the blank tile. If such a tiling is found, then the semi-algorithm halts, indicating that a valid, finite, nontrivial tiling exists. To prove the undecidability, we reduce the problem TURING MACHINE HALTING ON BLANK TAPE. For any given Turing machine M, we construct the machine tiles of Fig. 1 as well as the blank tile, boundary tiles, and the halting tiles shown in Fig. 3. The halting tiles of Fig. 3b are constructed for all tape letters a G and the halting state qh. The purpose of the halting tiles is to erase the Turing machine from the configuration once it halts. The lower border tiles of Fig. 3c initialize the configuration to consist of the blank tape symbol b and the initial state q0. The top border tiles are made for every tape symbol a G. They allow the absorption of the configuration as long as the Turing machine has been erased. The border tiles on the sides are labeled with symbols L and R to identify the left and the right border of the computation area.

Let us prove that the tile set admits a valid, finite, nontrivial tiling if and only if the Turing machine halts on the empty tape. “(”: Suppose that the Turing machine halts on the blank tape. Then a tiling exists where the boundary tiles isolate a finite portion of the plane (a “board”) for the simulation of the Turing machine, the bottom tiles of the board initialize the Turing machine on the blank tape, and inside the board the Turing machine is simulated until it halts. After halting, only tape tiles are used until they are absorbed by the topmost row of the board. If the board is made sufficiently large, the entire computation fits inside the board, so the tiling is valid. All tiles outside the board are blank, so the tiling is finite. “)”: Suppose then that a finite, nontrivial tiling exists. The only non-blank tiles with a blank bottom edge are the lower border tiles of Fig. 3c, so the tiling must contain a lower border tile. Horizontal neighbors of lower border tiles are lower border tiles, so we see that the only way to have a finite tiling is to have a contiguous lower border that ends at both sides in a corner tile where the border turns upwards. The vertical borders must

210

Tiling Problem and Undecidability in Cellular Automata

Tiling Problem and Undecidability in Cellular Automata, Fig. 4 NW-deterministic sets of Wang tiles: (a) there is at most one matching tile z for any x and y and (b) diagonals of NW-deterministic tilings interpreted as configurations of one-dimensional CA

b

a y x

z

again – due to the finiteness of the tiling – end at corners where the top border starts. All in all, we see that the boundary tiles are forced to form a rectangular board. The lower boundary of the board initializes the Turing machine configuration on the blank tape, and the rows above it are forced by the machine tiles to simulate consecutive configurations of the Turing machine. Because the Turing machine state symbol is not allowed to touch the side or the upper boundary of the board, the Turing machine must be erased by a halting tile, i.e., the Turing machine must halt. The third variation of the tiling problem we consider is the PERIODIC TILING PROBLEM where we ask whether a given set of tiles admits a valid periodic tiling. PERIODIC TILING PROBLEM Input: Question:

Tile set T. Does T admit a valid periodic tiling?

Theorem 4 The PERIODIC TILING PROBLEM is undecidable for Wang tile sets. It is semi-decidable, while its complement is not semi-decidable. For a proof, see Gurevich and Koryakov (1972).

Deterministic Tiles The tiling problem of one-dimensional tiles is decidable. However, tiles can provide undecidability results for one-dimensional CA when we use the trick that we view space-time diagrams as two-dimensional tilings. But not every tiling can be a space-time diagram of a CA: the tiling must be locally deterministic in the direction that corresponds to time. This leads to the consideration of determinism in Wang tiles. Consider a set T of Wang tiles, i.e., squares with colored edges. We say that T is NW-deterministic if for all a, b T, a 6¼ b; either the upper (northern) edges of a and b or the left (western) edges of a and b have different colors. See Fig. 4a for an illustration. Consider now a valid tiling of the plane by NW-deterministic tiles. Each tile is uniquely determined by its left and upper neighbors. Then, tiles on each diagonal in the NE-SW direction locally determine the tiles on the next diagonal below it. If we interpret these diagonals as configurations of a CA, then there is a local rule such that valid tilings are space-time diagrams of the CA; see Fig. 4b. We define analogously NE-, SW-, and SE-deterministic tile sets. Finally, we call a tile set four-way deterministic if it is deterministic in all four directions simultaneously.

Tiling Problem and Undecidability in Cellular Automata

211

The tiling problem is undecidable among NW-deterministic tile sets (Kari 1992), even among four-way deterministic tile sets (Lukkarila 2009).

A set of two-dimensional directed tiles is said to have the plane-filling property if it satisfies the following two conditions: 1. There exists t T ℤ and a one-way infinite path ! ! ! p 1 , p 2 , p 3 , . . . such that the tiling in t is valid ! at p i for all i ¼ 1, 2, 3, ::::. ! ! ! 2. For all t and p 1 , p 2 , p 3 , . . . as in (a), there are arbitrarily large n n squares of cells such that all cells of the squares are on the path. 2

Theorem 5 The decision problem tiling problem is undecidable among four-way deterministic sets of Wang tiles. As discussed at the end of section “The Tiling Problem,” the theorem also means that four-way deterministic aperiodic tile sets exist. In fact, the proof of Theorem 5 in Lukkarila (2009) uses one such aperiodic set that was reported in Kari and Papasoglu (1999).

Plane-Filling Directed Tiles A d-dimensional directed tile is a tile that is associated with a follower vector f ℤd : Let T ¼ ðd, T, N, RÞ be a tile set, and let F : T ! ℤd be a function that assigns tiles their follower vectors. We call D = (d,T,N,R,F) a set of directed d tiles. Let t T ℤ be an assignment oftiles to cells. ! ! ! For every p ℤd ; we call p þF t p the ! follower of p in t. In other words, the follower of ! ! p is the cell whose position relative to p is given ! by the follower vector of the tile in cell p . ! ! ! ! Sequence p 1 , p 2 , . . . , p k where all p i ℤd is a (finite) path in t if ! ! p iþ1 ¼ p i

! þ F t pi

for all 1 i < k: In other words, a path is a sequence of cells such that the next cell is always the follower of the previous cell. One-way infinite and two-way infinite paths are defined analogously. In the following, we only discuss the two-dimensional case (d = 2), and the follower of each tile is one of the four adjacent positions: FðaÞ fð 1, 0Þ, ð0 1Þg for all a T: In this case, the follower is indicated in drawings as a horizontal or vertical arrow over the tile.

Intuitively, the plane-filling property means that the simple device that moves over tiling t repeatedly verifies the correctness of the tiling in its present location and moves on to the follower, necessarily eventually either finds a tiling error or covers arbitrarily large squares. Note that the plane-filling property does not assume that the tiling t is correct everywhere: as long as it is correct along a path, the path must snake through larger and larger squares. Note that conditions (a) and (b) imply that the tile set is aperiodic. There exist tile sets that satisfy the plane-filling property, as proved in Kari (1994a). Theorem 6 There exists a set of directed Wang tiles that has the plane-filling property. The proof of Theorem 6 in Kari (1994a) constructs a set of Wang tiles such that the path that does not find any tiling errors is forced to follow the well-known Hilbert curve shown in Fig. 5.

Undecidability in Cellular Automata Let us begin with one-step properties of two-dimensional CA. Theorem 7 Injectivity is undecidable among two-dimensional CA. It is semi-decidable in any dimension. Proof The semi-decidability follows from the fact that injective CA has an inverse CA. One can effectively enumerate all CA and check them one by one until (if ever) the inverse CA is found.

212

Tiling Problem and Undecidability in Cellular Automata

Tiling Problem and Undecidability in Cellular Automata, Fig. 5 Fractions of the plane-filling Hilbert curve through 4 4 and 16 16 squares

Let us next prove injectivity undecidable by reducing the tiling problem into it. In the reduction, a set D of directed tiles that has the planefilling property is used. The existence of such D was stated in Theorem 6. Let T be a given set of Wang tiles that is an instance of the tiling problem. One can effectively construct a two-dimensional CA whose state set is S ¼ T D f0, 1g and the local rule updates the bit component of a cell as follows: • If either the T or the D components contain a tiling error at the cell, then the state of the cell is not changed. • If the tilings according to both T and D components are valid at the cell, then the bit of the follower cell (according to the direction in the D component) is added to the present bit value modulo 2. The tile components are not changed. Let us prove that this CA G is not injective if and only if T admits a valid tiling.

“(”: Suppose a valid tiling exists. Construct two configurations c0 and c1 where the T and D components form the same valid 2 2 tilings t T ℤ and d Dℤ : respectively. In c0, all bits are 0 while in c1 they are all 1. Since the tilings are everywhere valid, every cell performs modulo 2 addition of two bits, which means that every bit becomes 0. Hence, Gðc0 Þ ¼ Gðc1 Þ ¼ c0 , and G is not injective. “)”: Suppose then that G is not injective. There are two different configurations c0 and c1 such that Gðc0 Þ ¼ Gðc1 Þ. Tile components are not modified by the CA, so they are identical in c0 ! and c1. There is a cell p 1 such that c0 and c1 ! have different bits at cell p 1 . Since these bits become identical in the next configuration, the ! D tiling must be correct at p 1 , and c0 and c1 must have different bits in the follower posi! tion p 2. We repeat the reasoning and obtain an ! ! ! infinite sequence of positions p 1 , p 2 , p 3 , . . . ! ! such that each p iþ1 is the follower of p i and ! the D tiling is correct at each p i . It follows from the plane-filling property of ! ! ! D that path p 1 , p 2 , p 3 , . . . covers arbitrarily large squares. Also, the tiling according to the T components must be valid at each cell of the

Tiling Problem and Undecidability in Cellular Automata Tiling Problem and Undecidability in Cellular Automata, Fig. 6 Tiles used in the proof of the undecidability of surjectivity

A

213

B

A

B

A

A

NW

NE

NW

NE

NW

NE

NW

NE

SW

SE

SW

SE

SW

C

SW

C

path. Hence, tile set T admits valid tilings of arbitrarily large squares, and, therefore, it admits a valid tiling of the entire plane. Analogously, we can prove the undecidability of surjectivity. It is convenient to use the well-known Garden of Eden theorem of Moore and Myhill to convert the surjectivity property into injectivity on finite configurations. Theorem 8 (Garden of Eden Theorem) A cellular automaton is non-surjective if and only if there are two distinct configurations that differ in a finite number of cells and that have the same successor (Moore 1962; Myhill 1963). Theorem 9 Surjectivity is undecidable among two-dimensional CA. Its complement is semi-decidable in any dimension.

C

SE SE

Proof A semi-algorithm for non-surjectivity enumerates all finite patterns one by one until a pattern is found that cannot appear in G(c) for any configuration c. To prove undecidability, we reduce the finite tiling problem, using the set D of 23 directed tiles shown in Fig. 6. These directed tiles are used in an analogous way as in the proof of Theorem 7. The topmost tile in Fig. 6 is called blank. All other tiles have a unique incoming and outgoing arrow. In valid tilings, arrows and labels must match. The non-blank tiles are considered directed: the follower of a tile is the neighbor directed to by the outgoing arrow on the tile. Since each non-blank tile has exactly one incoming arrow, it is clear that if the tiling is valid at a tile, then the tile is the follower of exactly one of its four neighbors. The tile at the center in Fig. 6 where the dark and light thick horizontal lines meet is called the cross. It has a special role in the forthcoming

214

Tiling Problem and Undecidability in Cellular Automata

Tiling Problem and Undecidability in Cellular Automata, Fig. 7 A rectangular loop of size 12 7

proof. A rectangular loop is a valid tiling of a rectangle using tiles in D where the follower path forms a loop that visits every tile of the rectangle and the outside border of the rectangle is colored blank. See Fig. 7 for an example of a rectangular loop through a rectangle of size 12 7. (The edge labels are not shown for the sake of clarity of the figure.) It is easy to see that a rectangular loop of size 2n m exists for all n 2 and m 3. Any tile in an even column in the interior of the rectangle can be made to contain the unique cross of the rectangular loop. It is easy to see that the tile set D has the following property: Finite plane-filling property. Let t Dℤ be a ! ! ! tiling and p 1 , p 2 , p 3 , . . . a path in t such ! that the tiling t is valid at p i for all i ¼ 1, 2, 3, . . .. If the path covers only a finite number of different cells, then the cells on the path form a rectangular loop. 2

Let b and c be the blank and the cross of set D. For any given tile set T with blank tile B, we construct the following two-dimensional cellular automaton. The state set S contains triplets

ðd, t, xÞ D T f0, 1g

under the following constraints: • If d = c, then t 6¼ B. • If d = b or d is any tile containing label SW, SE, NW, NE, A, B, or C, then t = B. In other words, the cross must be associated with a non-blank tile in T, while the blank of D and all the tiles on the boundary of a rectangular loop are forced to be associated with the blank tile of T. The triplet (b, B, 0) where both tile components are blank and the bit is 0 is the quiescent state of the CA. The local rule is as follows: Let (d, t, x) be the current state of a cell. • If d = b, then the state is not changed. • If d 6¼ b, then the cell verifies the validity of the tilings according to both D and T at the cell. If either tile component has a tiling error, then the state is not changed. If both tilings are valid, then the cell modifies its bit component by adding the bit of its follower modulo 2.

Tiling Problem and Undecidability in Cellular Automata

215

Let us prove that this CA is not surjective if and only if T admits a valid, finite, nontrivial tiling.

in a finite number of cells, we see that the path can only contain a finite number of distinct cells. It follows then from the finite plane-filling property of D that the path must form a valid rectangular loop.

“(”: Suppose a valid, finite, nontrivial tiling t T ℤ exists. Consider a configuration of the CA whose T components form the valid tiling t and the D components form a rectangular loop whose interior covers all non-blank elements of t. Tiles outside the rectangle are all blank and have bit 0. The cross can be positioned so that it is in the same cell as some non-blank tile in t. In such a configuration, both T and D tilings are everywhere valid. The CA updates the bits of all tiles in the rectangular loop by performing modulo 2 addition with their followers, while the bits outside the rectangle remain 0. We get two different configurations that have the same image: In c0, all bits in the rectangle are equal to 0, while, in c1, they are all equal to 1. The local rule updates the bits so that Gðc0 Þ ¼ Gðc1 Þ ¼ c0 . Configurations c0 and c1 only differ in a finite number of cells, so it follows from the Garden of Eden theorem that G is not surjective. “)”: Suppose then that the CA is not surjective. According to the Garden of Eden theorem, there are two finitely different configurations c0 and c1 such that G(c0) = G(c1). Since only bit components of states are changed, the tilings in c0 and c1 according to D and T components of the ! states are identical. There is a cell p 1 such ! that c0 and c1 have different bits at cell p 1 : Since these bits become identical in the next configuration, the D tiling must be correct at ! p 1 , and c0 and c1 must have different bits in ! the follower position p 2 .We repeat the reasoning and obtain an infinite sequence of ! ! ! positions p 1 , p 2 , p 3 , . . . such that each ! ! p iþ 1 is the follower of p i and the D tiling ! is correct at each p i . Moreover, c0 and c1 ! have different bits in each position p i : Because configurations c0 and c1 only differ 2

Also, the tiling according to the T components must be valid at each cell of the path. Because of the constraints on the allowed triplets, the T components on the boundary of the rectangle are the blank B, while the cross in the interior contains a non-blank element of T. Hence, there is a valid tiling of a rectangle according to T that contains a non-blank tile and has a blank boundary. This means that a finite, valid, and nontrivial tiling is possible.

Undecidable Properties of OneDimensional CA Using deterministic Wang tiles and interpreting space-time diagrams as tilings, one obtains undecidability results for long-term behavior of one-dimensional CA. Theorem 10 Nilpotency is undecidable among one-dimensional CA. It is undecidable even among one-dimensional CA that have a spreading state q, i.e., a state that spreads to all neighbors. Nilpotency is semi-decidable in any dimension. Proof For semi-decidability, notice that, for n = 1,2,3. . ., we can effectively construct a cellular automaton whose global function is Gn and check whether the local rule of the CA maps everything into the same state. If that happens for some n, then we halt and report that the CA is nilpotent. To prove undecidability, we reduce the tiling problem of NW-deterministic Wang tiles. Let

216

Tiling Problem and Undecidability in Cellular Automata

T be a given NW-deterministic tile set. One can effectively construct a one-dimensional CA whose state set is S ¼ T [ fqg , and the local rule turns a cell into the quiescent state q except in the case that the cell and its right neighbor are in states x, y T, respectively, and tile z T exists so that tiles x□y, □z match as in Fig. 4a. In this case, z is the new state of the cell. Note that state q is a spreading state. Let us prove that the CA is not nilpotent if and only if T admits a valid tiling.

G is not nilpotent, then there is a configuration c Sℤ such that no cell ever turns into the spreading state q. But then the second components form a left shift over the alphabet {1,2,. . .,n}, so the topological entropy is at least log2n > c. It also follows that it is undecidable to determine if a given one-dimensional CA is ultimately periodic (Durand et al. 2003).

“(”: Suppose a valid tiling exists. If c T ℤ is a diagonal of this tiling, then the configurations Gn (c) in its orbit are subsequent diagonals of the same tiling, for all n ¼ 1, 2, . . . . This means that c never becomes quiescent, and the CA is not nilpotent. “)”: Suppose no valid tiling exists. Then there is number n such that no valid tiling of an n n square exists. This means that for every initial configuration c Sℤ, the configuration G2n (c) is quiescent: If it is not quiescent, then a valid tiling of an n n square can be read from the spacetime diagram of configurations c, G(c),. . .,G2n (c) . We conclude that the CA is nilpotent. Undecidability of nilpotency has some interesting corollaries. First, it implies that the topological entropy of a one-dimensional CA cannot be calculated, not even approximated (Hurd et al. 1992). Theorem 11 Topological entropy is undecidable. Proof Let us reduce nilpotency. Let c > 0 be any constant, and let n > 2C be an integer. For any given one-dimensional CA G with state set S and a spreading state q S, construct a new CA whose state set is S {1,2,. . .,n}, and the local rule applies G in the first components of the states and shifts the second components one cell to the left. In addition, state (q, i) is turned into state (q,1). If G is nilpotent, then also the new CA is nilpotent, and its topological entropy is 0. If

Theorem 12 Equicontinuity is one-dimensional CA.

undecidable

among

Proof Among one-dimensional CA with a spreading state, equicontinuity is equivalent to nilpotency.

Theorem 13 Sensitivity to initial conditions is undecidable among one-dimensional CA.

Proof Originally, the result was proved in Durand et al. (2003) using an elaborate reduction of the Turing machine halting problem. However, undecidability of nilpotency provides the result directly, as pointed out in Kari (2008). Namely, a one-dimensional cellular automaton whose neighborhood vector contains only strictly positive numbers is either nilpotent or sensitive. Adding a constant to all elements of the neighborhood vector does not affect the nilpotency status of a CA. So, for any given one-dimensional CA, we proceed as follows: add a positive constant to the elements of the neighborhood vector so that they all become positive. The new CA is sensitive if and only if the original CA was not nilpotent. The result then follows from Theorem 10. As a final application of undecidability of nilpotency consider other questions concerning the limit set (maximal attractor) of one-dimensional CA. One can show that nilpotency can be reduced to any nontrivial question (Kari 1994b). More precisely, let PROB be a

Tiling Problem and Undecidability in Cellular Automata

decision problem that takes arbitrary one-dimensional CA as input. Suppose that PROB always has the same answer for any two CA that have the same limit set. Then, we say that PROB is a decision problem concerning the limit sets of CA. We call PROB nontrivial if there exist both positive and negative instances. Theorem 14 Let PROB be any nontrivial decision problem concerning the limit sets of CA. Then, PROB is undecidable (Kari 1994b).

Other Undecidability Results In the previous sections, we only considered decision problems that have been proved undecidable using reductions from the tiling problem or its variant. There are many other decision problems that have been proved undecidable using other techniques. Below are a few, with literature references. We call a CA G periodic if there is number n such Gn is the identity function. This is equivalent to saying that every configuration is periodic, that is, every configuration returns back to itself. Clearly, a periodic CA is necessarily injective. In fact, periodic CA are exactly those CA that are injective and equicontinuous.

217

! ! ! time t 0 such that e x ¼ d x for all x A ! ! ! but Gt ðeÞ x 6¼ Gt ðcÞ x for some x B. SENSITIVITY TO INITIAL CONDITIONS Input: Question:

Cellular automaton A. Is A sensitive to initial conditions?

Theorem 16 Sensitivity to initial conditions is undecidable among one-dimensional CA (Durand et al. 2003). The following problems deal with dynamics on finite configuration. We, hence, suppose that the given CA has a quiescent state, i.e., a state q such that f (q,q,. . .,q) = q where f is the local d update rule of the CA. A configuration c Sℤ is called finite (w.r.t. q) if all but a finite number of cells are in state q. Questions similar to nilpotency and equicontinuity can be asked in the space of finite configurations: NILPOTENCY ON FINITE CONFIGURATIONS Input: Question:

Cellular automaton A with a quiescent state. Does every finite configuration evolve into the quiescent configuration?

PERIODICITY Input: Question:

Cellular automaton A Is A periodic?

EVENTUAL PERIODICITY CONFIGURATIONS Input:

The question is undecidable among two-dimensional CA (the construction in the proof of Theorem 7 shows it) but also with one-dimensional inputs. Theorem 15 Periodicity is undecidable among one-dimensional CA (Kari and Ollinger in press). A CA is called sensitive to initial conditions if there exists a finite set B ℤd of cells such that, for every configuration c and every finite set A ℤ of cells, there exists a configuration e and

Question:

ON

FINITE

Cellular automaton A with a quiescent state. Does every finite configuration evolve into a temporally periodic configuration?

Theorem 17 Nilpotency on finite configurations and eventual periodicity on finite configurations are undecidable for one-dimensional CA (Culik and Yu 1988; Sutner 1989).

218

Tiling Problem and Undecidability in Cellular Automata

Future Directions

Berger R (1966) The undecidability of the domino problem. Mem Am Math Soc 66:1–72 Culik K II (1996) An aperiodic set of 13 Wang tiles. Discret Math 160:245–251 Culik K II, Yu S (1988) Undecidability of CA classification schemes. Complex Syst 2:177–190 Durand B, Formenti E, Varouchas G (2003) On undecidability of equicontinuity classification for cellular automata. In: Proceedings of discrete models for complex systems, Lyon, 16–19 June 2003, pp 117–128 Finelli M, Manzini G, Margara L (1998) Lyapunov exponents versus expansivity and sensitivity in cellular automata. J Complex 14:210–233 Gurevich YS, Koryakov IO (1972) Remarks on Berger’s paper on the domino problem. Sib Math J 13:319–321 Hurd LP, Kari J, Culik K (1992) The topological entropy of cellular automata is uncomputable. Ercodic Theor Dyn Syst 12:255–265 Jeandel E, Rao M (2015) An aperiodic set of 11 Wang tiles. Preprint arXiv 1506.06492 Kari J (1990) Reversibility of 2D cellular automata is undecidable. Phys D 45:379–385 Kari J (1992) The nilpotency problem of one-dimensional cellular automata. SIAM J Comput 21:571–586 Kari J (1994a) Reversibility and surjectivity problems of cellular automata. J Comput Syst Sci 48:149–182 Kari J (1994b) Rice’s theorem for the limit sets of cellular automata. Theor Comput Sci 127:229–254 Kari J (1996) A small aperiodic set of Wang tiles. Discret Math 160:259–264 Kari J (2008) Undecidable properties on the dynamics of reversible one-dimensional cellular automata. In: Proceedings of Journe´es Automates Cellulaires, Uze´s, 21–25 April 2008 Kari J, Ollinger N (2008) Periodicity and immortality in reversible computing. In: Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 5162, pp 419–430 Kari J, Papasoglu P (1999) Deterministic aperiodic tile sets. J Geom Funct Anal 9:353–369 Kurka P (1997) Languages, equicontinuity and attractors in cellular automata. Ergod Theory Dyn Syst 17:417–433 Lukkarila V (2009) The 4-way deterministic tiling problem is undecidable. Theoretical Computer Science 410(16):1516–1533 Moore EF (1962) Machine models of self-reproduction. Proc Symp Appl Math 14:17–33 Myhill J (1963) The converse to Moore’s garden-of-Eden theorem. Proc Am Math Soc 14:685–686 Robinson RM (1971) Undecidability and nonperiodicity for tilings of the plane. Invent Math 12:177209 Shereshevsky MA (1993) Expansiveness, entropy and polynomial growth for groups acting on subshifts by automorphisms. Indag Math 4: 203–210 Sutner K (1989) A note on the Culik-Yu classes. Compl Syst 3:107–115

Some interesting and challenging open questions remain. In particular, the decidability status of the decision problem concerning expansivity (a strong type of sensitivity) is unknown. We call a one-dimensional CA G positively expansive if there exists a finite set A ℤ of cells such that for any two distinct configurations c and e there exists t 0 such that Gt(c) and Gt(e) differ in some cell in A. We call an injective CA G expansive for some finite A if it holds the following: for any two distinct configurations c and e, there exists t ℤ such that Gt(c) and Gt(e) differ in some cell in A. It is known that a two- and higher-dimensional CA cannot be expansive or positively expansive (Finelli et al. 1998; Shereshevsky 1993), so the following decision problems are only asked for one-dimensional CA: Positive Expansivity Input: Question:

One-dimensional cellular automaton A. Is A positively expansive?

EXPANSIVITY Input: Question:

One-dimensional cellular automaton A. Is A expansive?

The decidability status of both positive expansivity and expansivity is unknown. Acknowledgments This research is supported by the Academy of Finland grants 211967 and 131558.

Bibliography Primary Literature Amoroso S, Patt Y (1972) Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures. J Comput Syst Sci 6:448–464

Tiling Problem and Undecidability in Cellular Automata Wang H (1961) Proving theorems by recognition – II. Bell Syst Techn J 40:1–42

pattern

Books and Reviews Codd EF (1968) Cellular automata. Academic, New York Garzon M (1995) Models of massive parallelism: analysis of cellular automata and neural networks. Springer, New York Hedlund G (1969) Endomorphisms and automorphisms of shift dynamical systems. Math Syst Theory 3:320–375

219 Kari J (2005) Theory of cellular automata: a survey. Theor Comput Sci 334:3–33 Toffoli T, Margolus N (1987) Cellular automata machines. MIT Press, Cambridge Wolfram S (ed) (1986) Theory and applications of cellular automata. World Scientific Press, Singapore Wolfram S (2002) A new kind of science. Wolfram Media, Champaign

Cellular Automata and Groups Tullio Ceccherini-Silberstein1 and Michel Coornaert2 1 Dipartimento di Ingegneria, Università del Sannio, Benevento, Italy 2 Institut de Recherche Mathématique Avancée, Université Louis Pasteur et CNRS, Strasbourg, France

Article Outline Glossary Deﬁnition of the Subject Introduction Cellular Automata Cellular Automata with a Finite Alphabet Linear Cellular Automata Group Rings and Kaplansky Conjectures Future Directions Bibliography

Glossary Groups A group is a set G endowed with a binary operation G G 3 (g, h) 7! gh G, called the multiplication, that satisﬁes the following properties: (i) for all g, h and k in G, (gh)k = g(hk) (associativity); (ii) there exists an element 1G G (necessarily unique) such that, for all g in G, 1Gg = g1G = g (existence of the identity element); (iii) for each g in G, there exists an element g1 G (necessarily unique) such that gg1 = g1g = 1G (existence of the inverses). A group G is said to be Abelian (or commutative) if the operation is commutative, that is, for all g, h G one has gh = hg. A group F is called free if there is a subset S F such that any element g of F can be uniquely written as a reduced word on S, i.e. in the form g ¼ sa11 sa22 sann , where n 0, si S and ai ℤ ∖ {0} for 1 i n, and such that

si 6¼ si+1 for 1 i n 1. Such a set S is called a free basis for F. The cardinality of S is an invariant of the group F and it is called the rank of F. A group G is ﬁnitely generated if there exists a ﬁnite subset S G such that every element g G can be expressed as a product of elements of S and their inverses, that is, g ¼ sϵ11 sϵ22 sϵnn, where n 0 and si S, ϵ i = 1 for 1 i n. The minimal n for which such an expression exists is called the word length of g with respect to S and it is denoted by ‘(g). The group G is a (discrete) metric space with the distance function d : G G ! ℝ+ deﬁned by setting d(g, g0) = ‘(g1g0) for all g, g0 G. The set S is called a ﬁnite generating subset for G and one says that S is symmetric provided that s S implies s1 S. The Cayley graph of a ﬁnitely generated group G w.r. to a symmetric ﬁnite generating subset S G is the (undirected) graph Cay(G, S) with vertex set G and where two elements g, g0 G are joined by an edge if and only if g1g0 S. A group G is residually ﬁnite if the intersection of all subgroups of G of ﬁnite index is trivial. A group G is amenable if it admits a rightinvariant mean, that is, a map m : P ðGÞ ! ½0,1 , where P ðGÞ denotes the set of all subsets of G, satisfying the following conditions: (i) m(G) = 1 (normalization); (ii) m(A [ B) = m(A) + m(B) for all A,B P ðGÞsuch that A \ B = ∅ (ﬁnite additivity); (iii) m(Ag) = m(A) for all g G and A P(G) (right-invariance). Rings A ring is a set R equipped with two binary operations R R 3 (a, b) 7! a + b R and R R 3 (a, b) 7! ab R, called the addition and the multiplication, respectively, such that the following properties are satisﬁed: (i) R, with the addition operation, is an Abelian group with identity element 0, called the zero element, (the inverse of an element a R is denoted by a); (ii) the multiplication is

# Springer-Verlag 2009 A. Adamatzky (ed.), Cellular Automata, https://doi.org/10.1007/978-1-4939-8700-9_52 Originally published in R. A. Meyers (ed.), Encyclopedia of Complexity and Systems Science, # Springer-Verlag 2009 https://doi.org/10.1007/978-0-387-30440-3_52

221

222

Cellular Automata and Groups

associative and admits an identity element 1, called the unit element; (iii) multiplication is distributive with respect to addition, that is, a(b + c) = ab + ac and (b + c)a = ba + ca for all a, b and c R. A ring R is commutative if ab = ba for all a, b R. A ﬁeld is a commutative ring 6¼ f0g where every non-zero element a is invertible, that is there exists a1 such that aa1 = 1. In a ring R a non-trivial element a is called a zero-divisor if there exists a non-zero element b R such that either ab = 0 or ba = 0. A ring R is directly ﬁnite if whenever ab = 1 then necessarily ba = 1, for all a, b R. If the ring Md(R) of d d matrices with coefﬁcients in R is directly ﬁnite for all d 1 one says that R is stably ﬁnite. Let R be a ring and let G be a group. Denote by R[G] the set of all formal sums g Gagg where ag R and ag = 0 except for ﬁnitely many elements g G. We deﬁne two binary operations on R[G], namely the addition, by setting X

! þ

ag g

gG

X

! ¼

bh h

X

ag þbg Þg,

gG

hG

and the multiplication, by setting X gG

! ag g

X

! bh h

¼

hG

k ¼ gh

X

ag bh gh

g ,h G

X

ag bg1 k k:

g ,h G

Then, with these two operations, R[G] becomes a ring; it is called the group ring of G with coefﬁcients in R. Cellular automata Let G be a group, called the universe, and let A be a set, called the alphabet. A conﬁguration is a map x : G ! A. The set AG of all conﬁgurations is equipped with the right action of G deﬁned by AG G 3 (x, g) 7! xg AG, where xg(g0) = x(gg0) for all g0 G. A cellular automaton over G with coefﬁcients in A is a map t : AG ! AG satisfying the

following condition: there exists a ﬁnite subset M G and a map m : AM ! A such that t(x)(g) = m(xg|M) for all x AG, g G, where xg|M denotes the restriction of xg to M. Such a set M is called a memory set and m is called a local deﬁning map for t. If A = V is a vector space over a ﬁeld , then a cellular automaton t : VG ! VG, with memory set M G and local deﬁning map m : VM ! V, is saito be linear provided that m is linear. Two conﬁgurations x, x0 AG are said to be almost equal if the set {g G; x(g) 6¼ x0(g)} at which they differ is ﬁnite. A cellular automaton is called pre-injective if whenever t(x) = t(x0) for two almost equal conﬁgurations x, x0 AG one necessarily has x = x0. A Garden of Eden conﬁguration is a conﬁguration x AG ∖ t(AG). Clearly, GOE conﬁgurations exist if and only if t is not surjective.

Definition of the Subject A cellular automaton is a self-mapping of the set of conﬁgurations of a group deﬁned from local and invariant rules. Cellular automata were ﬁrst only considered on the n-dimensional lattice group ℤn and for conﬁgurations taking values in a ﬁnite alphabet set but they may be formally deﬁned on any group and for any alphabet. However, it is usually assumed that the alphabet set is endowed with some mathematical structure and that the local deﬁning rules are related to this structure in some way. It turns out that general properties of cellular automata often reﬂect properties of the underlying group. As an example, the Garden of Eden theorem asserts that if the group is amenable and the alphabet is ﬁnite, then the surjectivity of a cellular automaton is equivalent to its pre-injectivity (a weak form of injectivity). There is also a linear version of the Garden of Eden theorem for linear cellular automata and ﬁnitedimensional vector spaces as alphabets. It is an amazing fact that famous conjectures of Kaplansky about the structure of group rings can be reformulated in terms of linear cellular automata.

Cellular Automata and Groups

Introduction The goal of this paper is to survey results related to the Garden of Eden theorem and the surjunctivity problem for cellular automata. The notion of a cellular automaton goes back to John von Neumann (1966) and Stan Ulam (1952). Although cellular automata were ﬁrstly considered only in theoretical computer science, nowadays they play a prominent role also in physics and biology, where they serve as models for several phenomena (▶ “Cellular Automata Modeling of Physical Systems” and ▶ “Chaotic Behavior of Cellular Automata”), and in mathematics. In particular, cellular automata are studied in ergodic theory (“Entropy in Ergodic Theory”, and “Ergodic Theory: Basic Examples and Constructions, ▶ “Ergodic Theory of Cellular Automata”, and “Ergodicity and Mixing Properties”) and in the theory of dynamical systems (▶ “Topological Dynamics of Cellular Automata”, and “Symbolic Dynamics”), in functional and harmonic analysis (“Spectral Theory of Dynamical Systems”), and in group theory. In the classical framework, the universe U is the lattice ℤ2 of integer points in Euclidean plane and the alphabet A is a ﬁnite set, typically A = {0, 1}. The set AU = {x : U ! A} is the conﬁguration space, a map x : U ! A is a conﬁguration and a point (n, m) U is called a cell. One is given a neighborhood M of the origin (0, 0) U, typically, for some r > 0, M = {(n, m) ℤ2 : |n| + |m| r} (von Neumann r-ball) or M = {(n, m) ℤ2 : |n|, |m| r} (Moore’s r-ball) and a local map m : AM ! A. One then “extends” m to the whole universe obtaining a map t : AU ! AU, called a cellular automaton, by setting t(x)(n, m) = m(x(n + s, m + t) (s, t) M). This way, the value t(x)(n, m) A of the conﬁguration x at the cell (n, m) U only depends on the values x(n + s, m + s) of x at its neighboring cells (x + s, y + t) (x, y) + (s, t) (x, y) + M, in other words, t is ℤ2-equivariant. M is called a memory set for t and m a local deﬁning map. In 1963 E.F. Moore proved that if a cellular 2 2 automaton t : Aℤ ! Aℤ is surjective then it is also pre-injective, a weak form of injectivity.

223

Shortly later, John Myhill proved the converse to Moore’s theorem. The equivalence of surjectivity and pre-injectivity of cellular automata is referred to as the Garden of Eden theorem (brieﬂy GOE theorem), this biblical terminology being motivated by the fact that it gives necessary and sufﬁcient conditions for the existence of conﬁgurations 2 x that are ℤ2 not in the image of t, i.e. x A ∖t Aℤ , so that, 2 thinking of t,Aℤ as a discrete dynamical system, with t being the time, they can appear only as “initial conﬁgurations”. It was immediately realized that the GOE theorem was holding also in higher dimension, namely for cellular automata with universe U = ℤd, the lattice of integer points in the d-dimensional space. Then, Machì and Mignosi (1993) gave the deﬁnition of a cellular automaton over a ﬁnitely generated group and extended the GOE theorem to the class of groups G having subexponential growth, that is for which the growth function gG(n), which counts the elements g G at “distance” at most n from the unit element 1G of G, has a growth weaker than the exponential, in p ﬃﬃﬃﬃﬃﬃﬃﬃﬃﬃﬃ n formulæ, limn!1 gG ðnÞ¼ 1 . Finally, in 1999 Ceccherini-Silberstein et al. (1999) extended the GOE theorem to the class of amenable groups. It is interesting to note that the notion of an amenable group was also introduced by von Neumann (1930). This class of groups contains all ﬁnite groups, all Abelian groups, and in fact all solvable groups, all groups of sub-exponential growth and it is closed under the operation of taking subgroups, quotients, directed limits and extensions. In Machì and Mignosi (1993) two examples of cellular automata with universe the free group F2 of rank two, the prototype of a non-amenable group, which are surjective but not pre-injective and, conversely, pre-injective but not surjective, thus providing an instance of the failure of the theorems of Moore and Myhill and so of the GOE theorem. In CeccheriniSilberstein et al. (1999) it is shown that this examples can be extended to the class of groups, thus necessarily non-amenable, containing the free group F2. We do not know whether the GOE theorem only holds for amenable groups or there are examples of groups which are non-

224

amenable and have no free subgroups: by results of Ol’shanskii (1980) and Adyan (1983) it is know that such class is non-empty. In 1999 Misha Gromov (1999), using a quite different terminology, reproved the GOE for cellular automata whose universes are inﬁnite amenable graphs G with a dense pseudogroup of holonomies (in other words such Gs are rich in symmetries). In addition, he considered not only cellular automata from the full conﬁguration space AG into itself but also between subshifts X, Y AG. He used the notion of entropy of a subshift (a concept hidden in the papers (Ceccherini-Silberstein et al. 1999; Machì and Mignosi 1993). In the mid of the ﬁfties W. Gottschalk introduced the notion of surjunctivity of maps. A map f : X ! Y is surjunctive if it is surjective or not injective. We say that a group G is surjunctive if all cellular automata t : AG ! AG with ﬁnite alphabet are surjunctive. Lawton (Gottschalk and Hedlund 1955) proved that residually ﬁnite groups are surjunctive. From the GOE theorem for amenable groups (Ceccherini-Silberstein et al. 1999) one immediately deduce that amenable groups are surjunctive as well. Finally Gromov (1999) and, independently, Benjamin Weiss (2000) proved that all soﬁc groups (the class of soﬁc groups contains all residually ﬁnite groups and all amenable groups) are surjunctive. It is not known whether or not all groups are surjunctive. In the literature there is a notion of a linear cellular automaton. This means that the alphabet is not only a ﬁnite set but also bears the structure of an Abelian group and that the local deﬁning map m is a group homomorphism, that is, it preserves the group operation. These are also called additive cellular automata (▶ “Additive Cellular Automata”). In Ceccherini-Silberstein and Coornaert (2006), motivated by Gromov (1999), we introduced another notion of linearity for cellular automata. Given a group G and a vector space V over a (not necessarily ﬁnite) ﬁeld , the conﬁguration space is VG and a cellular automaton t : VG ! VG is linear if the local deﬁning map m : VB ! V is -linear. The set LCA(V, G) of all linear cellular automata with alphabet V and universe G naturally bears a structure of a ring.

Cellular Automata and Groups

The ﬁniteness condition for a set A in the classical framework is now replaced by the ﬁnite dimensionality of V. Similarly, the notion of entropy for subshifts X AG is now replaced by that of mean-dimension (a notion due to Gromov (1999)). In Ceccherini-Silberstein and Coornaert (2006) we proved the GOE theorem for linear cellular automata t : VG ! VG with alphabet a ﬁnite dimensional vector space and with G an amenable group. Moreover, we proved a linear version of Gottschalk surjunctivity theorem for residually ﬁnite groups. In the same paper we also establish a connection with the theory of group rings. Given a group G and a ﬁeld , there is a one-to-one correspondence between the elements in the group ring ½G and the cellular automata t : G ! G . This correspondence preserves the ring structures of ½G and LCAð,GÞ. This led to a reformulation of a long standing problem, raised by Irving Kaplansky (1957), about the absence of zero-divisors in ½G for G a torsion-free group, in terms of the pre-injectivity of all t LCAð,GÞ. In Ceccherini-Silberstein and Coornaert (2007b) we proved the linear version of the Gromov–Weiss surjunctivity theorem for soﬁc groups and established another application to the theory of group rings. We extended the correspondence above to a ring isomorphism between the ring Matd ð½G Þ of d d matrices with coefﬁcients in the group ring ½G and LCA d ,G . This led to a reformulation of another famous problem, raised by Irving Kaplansky (1969) about the structure of group rings. A group ring ½G is stably ﬁnite if and only if, for all d 1, all linear cellular automata G G t : d ! d are surjunctive. As a byproduct we obtained another proof of the fact that group rings over soﬁc groups are stably ﬁnite, a result previously established by Elek and Szabó (2004) using different methods. The paper is organized as follows. In section “Cellular Automata” we present the general deﬁnition of a cellular automaton for any alphabet and any group. This includes a few basic examples, namely Conway’s Game of Life, the majority action and the discrete Laplacian. In the subsequent

Cellular Automata and Groups

section we specify our attention to cellular automata with a ﬁnite alphabet. We present the notions of Cayley graphs (for ﬁnitely generated groups), of amenable groups, and of entropy for G-invariant subsets in the conﬁguration space. This leads to a description of the setting and the statement of the Garden of Eden theorem for amenable groups. We also give detailed expositions of a few examples showing that the hypotheses of amenability cannot, in general, be removed from the assumption of this theorem. We also present the notion of surjunctivity, of soﬁc groups and state the surjunctivity theorem of Gromov and Weiss for soﬁc groups. In section “Linear Cellular Automata” we introduce the notions of linear cellular automata and of mean dimension for G-invariant subspaces in VG. We then discuss the linear analogue of the Garden of Eden theorem and, again, we provide explicit examples showing that the assumptions of the theorem (amenability of the group and ﬁnite dimensionality of the underlying vector space) cannot, in general, be removed. Finally we present the linear analogue of the surjunctivity theorem of Gromov and Weiss for linear cellular automata over soﬁc groups. In section “Group Rings and Kaplansky Conjectures” we give the deﬁnition of a group ring and present a representation of linear cellular automata as matrices with coefﬁcients in the group ring. This leads to the reformulation of the two long standing problems raised by Kaplansky about the structure of group rings. Finally, in section “Future Directions” we present a list of open problems with a description of more recent results related to the Garden of Eden theorem and to the surjunctivity problem.

Cellular Automata The Configuration Space Let G be a group, called the universe, and let A be a set, called the alphabet or the set of states. A conﬁguration is a map x : G ! A. The set AG of all conﬁgurations is equipped with the right action of G deﬁned by AG G 3 (x, g) 7! xg AG, where xg(g0) = x(gg0) for all g0 G.

225

Cellular Automata A cellular automaton over G with coefﬁcients in A is a map t : AG ! AG satisfying the following condition: there exists a ﬁnite subset M G and a map m : AM ! A such that tðxÞðg Þ ¼ m xg jM

(1)

for all x AG, g G, where xg|M denotes the restriction of xg to M. Such a set M is called a memory set and m is called a local deﬁning map for t. It follows directly from the deﬁnition that every cellular automaton t : AG ! AG is Gequivariant, i.e., it satisﬁes tðxg Þ ¼ tðxÞg

(2)

for all g G and x AG. Note that if M is a memory set for t, then any ﬁnite set M 0 G containing M is also a memory set for t. The local deﬁning map associated with 0 such an M 0 is the map m0 : AM ! A given by 0 m0 = m ∘ p, where p : AM ! AM is the restriction map. However, there exists a unique memory set M0 of minimal cardinality. This memory set M0 is called the minimal memory set for t. We denote by CA(G, A) the set of all cellular automata over G with alphabet A.

Examples Example 1 (Conway’s Game of Life (Berlekamp et al. 1982)) The most famous example of a cellular automaton is the Game of Life of John Horton Conway. The set of states is A = {0, 1}. State 0 corresponds to absence of life while state 1 indicates life. Therefore passing from 0 to 1 can be interpreted as birth, while passing from 1 to 0 corresponds to death. The universe for Life is the group G = ℤ2, that is, the free Abelian group of rank 2. The minimal memory set is M = {1, 0, 1}2 ℤ2. The set M is the Moore neighborhood of the origin in ℤ2. It consists of the origin (0, 0) and its eight neighbors (1, 0), (0, 1), (1, 1), (1, 1). The corresponding local deﬁning map m : AM ! A given by

226

Cellular Automata and Groups

8 > > <

8P < s S y ðs Þ ¼ 3 1 if or mðyÞ ¼ :P > > s S yðsÞ ¼ 4 and yðð0,0ÞÞ ¼ 1, : 0 otherwise:

Example 2 (The majority action (Ginosar and Holzman 2000)) Let G be a group, M a ﬁnite subset of G, and A = {0, 1}. The automaton t : AG ! AG with memory set M and local deﬁning map m : AM ! A given by 8 > > 1 > > > < mðyÞ ¼ 0 > > > > > : y ð 1G Þ

if if if

P mM

P P

mM mM

jM j , 2 jM j , yð m Þ < 2 jM j , yð m Þ ¼ 2

Let t1, t2 CA(G, A) be two cellular automata (with memory sets M1 and M2, respectively). It is easy to see that their composition t1 ∘ t2, deﬁned by [t1 ∘ t2](x) = t1(t2(x)) for all x AG, is a cellular automaton (admitting M = M1M2 as a memory set). Since the identity map I : AG ! AG is a cellular automaton, it follows that CA(G, A) is a monoid for the composition operation.

Cellular Automata with a Finite Alphabet

yð m Þ >

for all y AM, is the majority action automaton associated with G and M.

The Configuration Space as a Metric Space Let G be a countable group, e.g., a ﬁnitely generated group (see subsection “Cayley Graphs”) and let A be a ﬁnite alphabet with at least two elements. The set AG of all conﬁgurations can be equipped with a metric space structure as follows. Let 0 ¼ E1 E 2 E n Enþ1 be an increasing sequence of ﬁnite subsets of G such that [n 1En = G. Then, given any two conﬁgurations x, x0 AG, we set:

Example 3 Let G be a group and let A be any alphabet. Let f : A ! A be a map and consider the map tf : AG ! AG deﬁned by setting tf(x)(g) = f(x(g)) for all x AG and g G. Then tf is a cellular automaton with memory set M = {1G} and the local deﬁning map m : AM ! A given by y 7! f(y(1G)) for all y AM. When f = ιA is the identity map on A thentiA ≕I is the identity map on AG. On the other hand, given c A, if f = fc is the constant map given by fc(a) = c for all a A, then tf c is the constant cellular automaton deﬁned by tf c ðxÞ ¼ xc for all x AG, where xc(g) = c for all g G. Example 4 (The discrete Laplacian) Let G be a group, S a ﬁnite subset of G not containing 1G, and A = ℝ, the ﬁeld of real numbers. The (linear) map DS : ℝG ! ℝG deﬁned by 1 X xðgsÞ DS ðxÞðg Þ ¼ xðgÞ jS j s S is a cellular automaton over G with memory set M = S [ {1G} and local deﬁning map m : ℝM ! ℝ P given by mðyÞ ¼ yð1G Þ jS1j s S yðsÞ , for all y ℝM. It is called the Laplacian or Laplace operator on G relative to S.

n o d ðx,x0 Þ ¼ 1=sup n ℕ : xjEn ¼ x0 jEn

(3)

(we use the convention that 1/1 = 0). In this way, AG becomes a compact totally disconnected space homeomorphic to the middle third Cantor set. We then have Hedlund’s topological characterization of cellular automata. Theorem 1 (Hedlund) Suppose that A is a ﬁnite set. A map t : AG ! AG is a cellular automaton if and only if it is continuous and G-equivariant. Corollary 1 Suppose that A is a ﬁnite set. Let t : AG ! AG be a bijective cellular automaton. Then the inverse map t1 : AG ! AG is also a cellular automaton. The Garden of Eden Theorem of Moore and Myhill Let G be any group and A be any alphabet. Let F G be a ﬁnite subset. A pattern with support F is a map p : AF ! A.

Cellular Automata and Groups

227

Let now t : AG ! AG be a cellular automaton. One says that t is surjective if t(AG) = AG. One often thinks of t as describing time evolution: if x AG is the conﬁguration of the universe at time t, then t(x) is the conﬁguration of the universe at time t + 1. An initial conﬁguration is a conﬁguration at time t = 0. A conﬁguration x which is not in the image of t, namely such that x AG ∖ t(AG), is called a Garden of Eden (brieﬂy GOE) conﬁguration. This biblical terminology is motivated by the fact that GOE conﬁgurations may only appear as initial conﬁgurations. Analogously, a pattern p with support F G is called a GOE pattern if p 6¼ t(x)|F for all x AG. Using topological methods it is easy to see that, when the alphabet is ﬁnite, the existence of GOE patterns for t is equivalent to the existence of GOE conﬁgurations for t, i.e., to the nonsurjectivity of t. One says that t is injective if, for x, x0 AG, one has x = x0 whenever t(x) = t(x0). Two conﬁgurations x, x0 AG are almost equal, and we write xa.e.x0, if they coincide outside a ﬁnite subset of G, namely |{g G : x(g) 6¼ x0(g)}| < 1. Finally, using terminology introduced by Gromov, one says that t is preinjective if, for x, x0 AG s.t. xa.e.x0, one has x = x0 whenever t(x) = t(x0). Two patterns p, p0 with the same support F are mutually erasable if they are distinct and whenever x, x0 AG are two conﬁgurations which extend in the same way p and p0 outside of F(i.e. x|F = p, x0|F = p0 and x|G ∖ F = x0|G ∖ F), then t(x) = t(x0). The non-existence of mutually erasable patterns is equivalent to the preinjectivity of the cellular automaton. Finally note that injectivity implies pre-injectivity (but the converse is false, in general). The following is the celebrated Garden of Eden theorem of Moore and Myhill.

As Conway’s Game of Life is concerned, we have that this cellular automaton is clearly not pre-injective (the constant dead conﬁguration and the conﬁguration with only one live cell have the same image) and by the previous theorem it is not surjective either. We mention that the non-surjectivity of the Game of Life is not trivial: the smallest GOE pattern known up to now has as a support a rectangle 13 12 with 81 live cells.

Theorem 2 (Moore and Myhill) Let t CA (ℤ2, A) be a cellular automaton with coefﬁcients in a ﬁnite set A. Then t is surjective if and only if it is pre-injective.

Amenable Groups The notion of an amenable group is also due to J. von Neumann (1930). Let G be a group and denote by P ðGÞ the set of all subsets of G. The group G is said to be amenable if there exists a right-invariant mean, that is, a map m : P ðGÞ ! ½0,1 satisfying the following conditions:

The necessary condition is due to Moore, the converse implication to Myhill.

Cayley Graphs A group G is said to be ﬁnitely generated if there exists a ﬁnite subset S G such that every element g G can be expressed as a product of elements of S and their inverses, that is, g ¼ sϵ11 sϵ22 sϵnn , where n 0 and si S, ϵ i = 1 for 1 i n. The minimal n for which such an expression exists is called the word length of g with respect to S and it is denoted by ‘(g). The group G is a (discrete) metric space with the distance function d : G G ! ℝ+ deﬁned by setting d(g, g0) = ‘(g1g0) for all g, g0 G. The set S is called a ﬁnite generating subset for G and one says that S is symmetric provided that s S implies s1 S. Suppose that G is ﬁnitely generated and let S be a symmetric ﬁnite generating subset of G. The Cayley graph of G w.r.t. S is the (undirected) graph Cay(G, S) with vertex set G and two elements g, g0 G are joined by an edge if and only if g1g0 S. The group G becomes a (discrete) metric space by introducing the distance d : G G ! ℝ+ deﬁned by d(g, g0) = ‘(g1g0) for all g, g0 G. Note that the distance d coincides with the graph distance on the Cayley graph Cay(G, S). For g G and n ℕ we denote by B(n, g) = {g0 G : d(g, g0) n} the ball of radius n with center g (Figs. 1 and 2).

228

Cellular Automata and Groups

Cellular Automata and Groups, Fig. 1 The ball B(2, 1G) in ℤ and in ℤ2, respectively

Cellular Automata and Groups, Fig. 2 The ball B(2, 1G) in F2

1. m(G) = 1 (normalization); 2. m(A [ B) = m(A) + m(B) for all A,B P ðGÞ such that A \ B = ∅ (ﬁnite additivity); 3. m(Ag) = m(A) for all g G and A P ðGÞ (right-invariance). We mention that if G is amenable, namely such a right-invariant mean exists, then also leftinvariant and in fact even bi-invariant means do exist. The class of amenable groups includes, in particular, all ﬁnite groups, all Abelian groups (and, more generally, all solvable groups), and all ﬁnitely generated groups of subexponential growth. It is closed under the operations of taking subgroups, taking factors, taking extensions and taking direct limits. It was observed by von Neumann himself (von Neumann 1930) that the free group F2

based on two generators is non-amenable. Therefore, all groups containing a subgroup isomorphic to the free group F2 are non-amenable as well. However, there are examples of non-amenable groups which do not contain subgroups isomorphic to F2. The ﬁrst examples are due to Ol’shanski (1980); later Adyan (1983) showed that also the free Burnside groups n B(m, n) = hs1, s2, . . ., sm : w i of rank m 2 and odd exponentn 665 are non-amenable. It follows from a result of Følner (1955) that a countable group G is amenable if and only if it admits a Følner sequence, i.e., a sequence (Fn)n ℕ of non-empty ﬁnite subsets of G such that lim

n!1

jF n DgF n j ¼ 0 for all g G, jF n j

(4)

where FnDgFn = (Fn [ gFn) ∖ (Fn \ gFn) is the symmetric difference of Fn and gFn. For instance, for G = ℤ one can take as Følner sets the intervals [n, n] where [n, n] = {n, n + 1, . . ., 1, 0, 1, . . ., n}, n ℕ. Analogously, for G = ℤ2 one can take as Følner sets the squares Fn = [n, n] [n, n]. Suppose that G is countable and amenable, and ﬁx a Følner sequence(Fn)n ℕ. Let A be a ﬁnite alphabet. A subset X AG is said to be G-invariant if x X implies that xg X for all g G. The entropy ent(X) of a G-invariant subset X AG is deﬁned by

Cellular Automata and Groups

229

Cellular Automata and Groups, Fig. 3 The construction of x AG such that t(x) = z

entðX Þ ¼ lim

n!1

logjX F n j jF n j

(5)

where, for any subset F G X F ¼ xjF : x X

ton t : AG ! AG associated with G and M (see subsection “Cellular Automata”). Clearly t is not pre-injective. Indeed the conﬁgurations x1, x2 AG deﬁned by x1(g) = 0 for all g G and

(6)

denotes the set of restrictions to F of all conﬁgurations in X. By using a result of Ornstein and Weiss (1987), it can be shown that the above limit in (5) exists and does not depend on the particular Følner sequence (Fn)n ℕ. One clearly has ent(AG) = log |A| and ent(X) ent(Y) if X Y are G-invariant subsets of AG. Theorem 3 (Ceccherini-Silberstein et al. (1999)) Let G be a countable amenable group and let A be a ﬁnite set. Let t : AG ! AG be a cellular automaton. The following are equivalent: (a) t is surjective (i.e. there are no GOE conﬁgurations); (b) t is pre-injective; ent t AG ¼ logjAj: Example 5 Let G be a group. Let M be a ﬁnite subset of G with at least three elements. Let A = {0, 1} and consider the majority action cellular automa-

x2 ð g Þ ¼

1 0

if g ¼ 1G otherwise

are almost equal and t(x2) = x1 = t(x1). By applying Theorem 3 we deduce that t is not surjective when G is a countable amenable group. In the example below we show that for the nonamenable group F2, the free group of rank two, the implication (a) ) (b) fails to hold. In Example 9 in section “Linear Cellular Automata” we show that also the converse implication fails to hold, in general, for cellular automata over F2. Example 6 Let G = F2 be the free group on two generators a and b. Take A = {0, 1} and M = {a, a1, b, b1} = S. Consider the majority action cellular automaton t : AG ! AG associated with G and M. As observed above, t is not pre-injective. However, t is surjective. To see this, let z AG. Let us show that there exists x AG such that t(x) = z. We ﬁrst set x(1G) = 0. For g G such that g 6¼ 1G, denote by g0 G the unique element such that ‘(g0) = ‘(g) 1 and g = g0s0 for some s0 S. Then set x(g) = z(g0). We clearly have t(x) = z. This shows that t is surjective (see Fig. 3).

230

Recently, Laurent Bartholdi (2008) proved that if G is a non-amenable group, then there exists a cellular automaton t : AG ! AG with ﬁnite alphabet which is surjective but not pre-injective. In other words, the implication “(a) t is surjective ) (b) t is pre-injective” in Theorem 3 (which corresponds to the generalization of Moore’s theorem) holds true only if the group G is amenable. In particular, the Garden of Eden Theorem (Theorem 3) holds true if and only if the universe G is amenable. This clearly gives a new characterization of amenability for groups in terms of cellular automata. However, up to now, it is not known whether the validity of the implication (b) ) (a) in Theorem 3 (which corresponds to the generalization of Myhill’s theorem) holds true only if the group G is amenable.

Surjunctivity A group G is said to be surjunctive (a terminology due to Gottschalk (1973)) if given any ﬁnite alphabet A, every injective cellular automaton t : AG ! AG is surjective. In other words, uniqueness implies existence for solutions of the equation y = t(x). This property is reminiscent of several other classes of mathematical objects for which injective endomorphisms are always surjective (ﬁnite sets, ﬁnite-dimensional vector spaces, Artinian modules, complex algebraic varieties, co-Hopﬁan groups, etc.). Recall that a group G is said to be residually ﬁnite if for every element g 6¼ 1G in G there exist a ﬁnite group F and a homomorphism h : G ! F such that h(g) 6¼ 1F. This amounts to saying that the intersection of all subgroups of ﬁnite index of G is reduced to the identity element. From a dynamical viewpoint we have the following characterization of residual ﬁniteness. Given a ﬁnite set A a conﬁguration x AG is said to be periodic if its G-orbit{xg : g G} AG is ﬁnite. Then G is residually ﬁnite if and only if the set of periodic conﬁgurations is dense in AG. The class of residually ﬁnite groups is quite large. For instance, every ﬁnitely generated subgroup of GLn(ℂ), the group of n by n invertible matrices over the complex numbers, is residually

Cellular Automata and Groups

ﬁnite. However, there are ﬁnitely generated amenable groups which are not residually ﬁnite. Lawton (Gottschalk 1973; Gottschalk and Hedlund 1955) proved that residually ﬁnite groups are surjunctive. From Theorem 3 one immediately deduces the following Corollary 2 Amenable groups are surjunctive. Note that the implication “surjectivity ) injectivity” fails to hold, in general, for cellular automata with ﬁnite alphabet over amenable groups, even for G = ℤ. Take, for instance A = {0, 1} and t : Aℤ ! Aℤ deﬁned by t(x)(n) = x(n + 1) x(n) for all x Aℤ and n ℤ. This cellular automaton is surjective but not injective. See also Example 8 below. Sofic Groups Let S be a set. An S-labeled graph is a triple (Q, E, l), where Q is a set, E is a symmetric subset of Q Q and l is a map from E to S. The set Q is the set of vertices, E is the set of edges and l : E ! S is the labeling map of the S-labeled graph (Q, E, l). We shall view every subgraph of a labeled graph as a labeled graph in the obvious way. Also, for r ℝ and q Q, we denote by B(q, r) = {q0 Q : d(q, q0) r} the ball of radiusr centered at q (here d denotes the graph distance in Q). Let (Q, E, l) and (Q0, E0, l0) be S-labeled graphs. Two vertices q Q and q0 Q 0 are said to be r-equivalent, and we write qrq0, if the balls B(q, r) and B(q0, r) are isomorphic as labeled graphs (i.e. there is a bijection ’: B (q, r) ! B(q0, r) sending q to q0 such that (q1, q2) E \ (B(q, r) B(q, r)) if and only if (’(q1), ’(q2)) E0 \ (B(q0, r) B(q0, r)) and l(q1, q2) = l0(’(q1), ’(q2)). Let G be a ﬁnitely generated group and let S be a ﬁnite symmetric (S = S1) generating subset of G. We denote by Cay(G, S) the Cayley graph of G with respect to S. Its vertex set is G and (g, g0) G G is an edge if s ≔ g1g0 S, if this is the case, its label is l(g, g0) = s. The group G is said to be soﬁc if for all e > 0 and r ℕ there exists a ﬁnite S-labeled graph (Q, E, l) such that the set Q(r) Q deﬁned by

Cellular Automata and Groups

231

Q(r) = {q Q : qr1G} (here 1G is considered as a vertex in Cay(G, S)) satisﬁes jQðrÞj ð1 eÞjQj:

Example 7 The Laplacian (cf. Example 4) is a linear cellular automaton.

(7)

It can be shown (see Weiss 2000) that this deﬁnition does not depend on the choice of S and that it can be extended as follows. A (not necessarily ﬁnitely generated) group G is said to be soﬁc if all of its ﬁnitely generated subgroups are soﬁc. Soﬁc groups were introduced by M. Gromov in (1999). The soﬁc terminology is due to B. Weiss (2000). The class of soﬁc groups contains, in particular, all residually ﬁnite groups, all amenable groups, and it is closed under direct products, free products, taking subgroups and extensions by amenable groups, and taking direct limits (Elek and Szabó 2006). The following generalizes Lawton’s result mentioned in subsection “Surjunctivity” as well as Corollary 2. Theorem 4 (Gromov 1999; Weiss 2000) Soﬁc groups are surjunctive. We end this section by mentioning that there is no known example of a non-surjunctive group nor even of a non-soﬁc group up to now.

Linear Cellular Automata Let G be a group and V be a vector space over a ﬁeld . The conﬁguration space VG = {x : G ! V} is a vector space over . Simply set (x + y)(g) = x(g) + y(g) and (lx)(g) = lx(g) for all x, y VG, g G and l . The zero vector is the zero conﬁguration 0(g) = 0 for all g G. The support of a conﬁguration x AG is the subset supp(x) = {g G : x(g) 6¼ 0} G. We denote by V[G] = {x VG : xa.e.0} the subspace of all conﬁgurations with ﬁnite support. A linear cellular automaton is a cellular automaton t : VG ! VG which is a linear map, that is, t(x + y) = t(x) + t(y) and t(lx) = lt(x) for all x, y VG and l . This is equivalent to the linearity of the local deﬁning map m : VM ! V. We denote by LCA(G, V) the space of all linear cellular automata over G with coefﬁcients in V.

Remark If the ﬁeld is ﬁnite, so that necessarily jj ¼ pn with p a prime number, and V has ﬁnite dimension over , then the vector space V is also ﬁnite. It is easy to see that if t LCA(G, V) and x VG has ﬁnite support, then t(x) also has ﬁnite support (in fact supp(t(x)) supp (x)M). In other words t(V[G]) V[G]. We denote by t0 = t|V [G] : V[G] ! V[G] the restriction of t to V[G]. We then have the following characterization of preinjectivity for linear cellular automata. Proposition 1 The linear cellular automaton t LCA(G, V) is pre-injective if and only if t0 : V[G] ! V[G] is injective. Note that if G is countable, VG admits also a structure of a metric space (the distance function (3) is deﬁned in the same way). Then V[G] is dense in VG with respect to the topology induced by the distance (3). However, VG is no longer a compact space so that many topological arguments based on compactness need to be obtained with an alternative method. As an example, the following linear analogue of Corollary 2 needs an appropriate proof. Theorem 5 (Ceccherini-Silberstein and Coornaert 2007b) Let G be a countable group and let V be a ﬁnite-dimensional vector space over a ﬁeld . Suppose that t : VG ! VG is a linear cellular automaton. (i) t(VG) is a closed subspace of VG. (ii) If t is bijective then the inverse map t1 : VG ! VG is also a linear cellular automaton.

Mean Dimension and the GOE Theorem Let G be a countable amenable group and V a ﬁnite-dimensional vector space over a ﬁeld . Fix a Følner sequence (Fn)n ℕ for G. The mean

232

Cellular Automata and Groups

dimension of a G-invariant vector subspace X VG, which plays the role of entropy used in the ﬁnite alphabet case, is the non-negative number mdimðX Þ ¼ lim n!1

dimðX F n Þ , jF n j

(8)

where X F n is deﬁned as in (6). The result of Ornstein and Weiss (1987) already mentioned above implies that the limit (8) exists and does not depend on the particular choice of the Følner sequence (Fn)n ℕ for G. Note that it immediately follows from this deﬁnition that mdim(VG) = dim (V) and that mdim(X) mdim(Y) dim (V) for all G-invariant vector subspaces X Y of VG. The linear analogue of the Garden of Eden theorem for linear cellular automata states as follows. Theorem 6 (Ceccherini-Silberstein and Coornaert 2006) Let V be a ﬁnite-dimensional vector space over a ﬁeld and let G be a countable amenable group. Let t : VG ! VG be a linear cellular automaton. Then the following are equivalent. (a) t is surjective (i.e. there are no GOE conﬁgurations); (b) t is pre-injective; (c) mdim(t(VG)) = dim (V). As an application we present the following example. Example 8 Let G be a ﬁnitely generated group. Let S G be a ﬁnite generating subset (not necessarily symmetric) such that 1G 2 = S, and denote by DS : ℝG ! ℝG the corresponding Laplacian (cf. Example 4). It follows from the Maximum Principle, see also Proposition 6.4 in Ceccherini-Silberstein and Coornaert (2006), that if the group G is inﬁnite, then the linear cellular automaton DS is preinjective (though not injective since the constant conﬁgurations are in the kernel of DS). Thus, as a consequence of Theorem 6, we deduce that DS is also surjective if G is an inﬁnite amenable group.

Actually, one has that DS is always surjective whenever G is inﬁnite. Indeed, denoting by PS = I DS the Markov operator associated with S, one has that if G is non-amenable then P n G is transient i.e. the series 1 n¼0 ðP S Þ converges (Woess 2000) (in fact, by a profound result of N. Varopoulos (1986, see, e.g. (Varopoulos et al. 1992)), G is transient if and only if it has no ﬁnite index subgroup isomorphic to either Z or ℤ2). We denote by G S the sum of this series. It is called the Green operator of G. But then, for f ℝ[G] the function g ¼ GS f ℝG clearly satisﬁes DSg = (I PS)g = f. This shows that DS(ℝG) ℝ[G] and, by virtue of Theorem 5 (i) and the density of ℝ[G] in ℝG, one has indeed DS(ℝG) = ℝG, that is, DS is surjective. We thank Vadim Kaimanovich and Nic Varopoulos for clarifying this point to us. In the example below we show that the implication (b) ) (a) in Theorem 6 fails to hold, in general, for linear cellular automata over the free group of rank two. Note that if the ﬁeld is ﬁnite, then this example also provides an instance of the failure of the implication (b) ) (a) in Theorem 3 when G = F2. Example 9 Let G = F2 be the free group on two generators a and b. Let be a ﬁeld and set V ¼ 2 . Consider the endomorphisms p and q of V deﬁned by p(a, b) = (a, 0) and q(a, b) = (b, 0) for all (a, b) V. Let t : VG ! VG be the linear cellular automaton, with memory set M = {a, b, a1, b1}, given by tðxÞðgÞ ¼ pðxðgaÞÞ þ qðxðgbÞÞ þ pðx ga1 þ q x gb1 for all x VG, g G. The image of t is contained in ð f0gÞG . Therefore t is not surjective. Let us show that t is pre-injective. Assume that there is an element x0 VG with non-empty ﬁnite support O G such that t(x0) = 0. Consider a vertex g0 O at maximal distance n0 from the identity in the Cayley graph

Cellular Automata and Groups

of G. The vertex g0 has at least three adjacent vertices at distance n0 + 1 from the identity. It follows from the deﬁnition of t that t(x0) does not vanish at (at least) one of these three vertices. This gives a contradiction. Thus t is pre-injective. The following, which is a linear version of Example 6, provides an instance of the failure of the implication (a) ) (b) in Theorem 6 when G = F2. Example 10 Let G = F2 be the free group on two generators a and b. Let be a ﬁeld and set V ¼ 2 . Consider the endomorphisms p0 and q0 of V deﬁned by p0 (a, b) = (a, 0) and q0 (a, b) = (0, a) for all (a, b) V. Let t : VG ! VG be the -linear cellular automaton, with memory set S = {a, b, a1, b1}, given by 0 0 0 tðxÞðgÞ ¼ p ðxðgaÞÞ þ p x ga1 þ q ðxðgbÞÞ 0 þ q x gb1 for all x VG and g G. Consider the conﬁguration x0 VG deﬁned by x0 ð g Þ ¼

ð0,1Þ if g ¼ 1G ð0,0Þ otherwise:

Then, x0 is almost equal to 0 and t(x0) = 0. This shows that t is not pre-injective (cf. Proposition 1). However, t is surjective. To see this, let z ¼ ðz1 , z2 Þ G G ¼ V G . Let us show that there exists x VG such that t(x) = z. We deﬁne x(g) by induction on the graph distance, which we denote by |g|, of g G from 1G in the Cayley graph of G. We ﬁrst set x(1G) = (0, 0). Then, for s S we set

233

elements such that |g0| = n 1 and g = g0s0. Then, for s S with s0s 6¼ 1G, we set

xðgsÞ ¼

8 ðz1 ðgÞ x1 ðg 0 Þ,0Þ > > > > ðz2 ðgÞ,0Þ < ðz1 ðgÞ,0Þ > > 0 > > ðz2 ðgÞ x2 ðg Þ,0Þ : ð0,0Þ

if s0 a,a1 and s ¼ s0 0 1 and s ¼ b if s a,a if s0 b,b1 and s ¼ a if s0 b,b1 and s ¼ s0 otherwise:

Then one easily checks that t(x) = z. This shows that t is surjective. We now show that, for any group, both implications of the equivalence (a) , (b) in Theorem 6 fail to hold, in general, when the vector space V is inﬁnite-dimensional. Example 11 Let V be an inﬁnite-dimensional vector space over a ﬁeld and let G be any group. Let us choose a basis B for V. Every map a : B ! B uniquely extends to a linear map ~a : V ! V . The product map t ¼ ~a G : V G ! V G is a linear cellular automaton with memory set M = {1G} and local deﬁning map ~a . Since B is inﬁnite, we can ﬁnd a map a : B ! B which is surjective but not injective (resp. injective but not surjective). Clearly, the associated linear cellular automaton t is surjective but not pre-injective (resp. injective but not surjective). We say that a group G is L-surjunctive if for any ﬁeld and for any ﬁnite dimensional vector space V over , every injective linear cellular automaton t : VG ! VG is surjective. The following is the linear analogue of the Gromov–Weiss theorem (Theorem 4). Theorem 7 (Ceccherini-Silberstein Coornaert 2007b) Soﬁc groups L-surjunctive.

and are

8 < ðz1 ð1G Þ,0Þ if s ¼ a xðsÞ ¼ ðz2 ð1G Þ,0Þ if s ¼ b : ð0,0Þ otherwise:

Group Rings and Kaplansky Conjectures

Suppose that x(g) has been deﬁned for all g G with |g| n, for some n 1. For g G with |g| = n, let g0 G and s0 S be the unique

Irving Kaplansky (1957, 1969) posed some famous problems in the theory of group rings. Here we establish some connections between

234

Cellular Automata and Groups

these problems and the theory of linear cellular automata. Group Rings Let G be a group and a ﬁeld. A natural basis for ½G , the subspace of ﬁnitely supported conﬁgurations in G , is given by {dg : g G}, where dg : G ! is deﬁned by dg(g) = 1 and dg(g0) = 0 if g0 6¼ g. Also, ½G can be endowed with a ring structure by deﬁning the convolution product xy of two elements x,y ½G by setting, for all g G, ½xy ðgÞ ¼

X

xðhÞy h1 g :

(9)

hG

ta ðxÞ ¼ xa d G for all x ¼ ðx1 , x2 , . . . , xd Þ G ¼ d . Theorem 8 (Ceccherini-Silberstein and Coornaert 2007b) For a Matd ð½G Þ the map G G ta : K d ! d is a linear cellular automaton. Moreover, the map Matd ð½G Þ 3 a ! ta LCA G,d is an isomorphism of -algebras. Remark When G = ℤ and is a ﬁnite ﬁeld, linear cellular automata ta LCA ℤ,d with a Matd ð½ℤ Þ , are called convolutional encoders in Sect. 1.6 of Lind and Marcus (1995).

1

One has dgdh = dgh and dh x ¼ xh for all g, h G and x ½G , in particular, d1G is the unit element in ½G . The ring ½G is called the group ring of G with coefﬁcients in . Note that the product map (x, y) ! xy is -linear so that ½G is in fact a -algebra. Note also that 9 makes sense for x, y KG and at least one is ﬁnitely supported. Moreover, the group G, via the map G 3 g 7! dg ½G , can be identiﬁed with a subgroup of the group of invertible elements in ½G . This way, every element x of ½G can be uniquely expressed as x = g Gx(g)g. The Matrix Representation of Linear Cellular Automata Let d 1 be an integer. Denote by Matd ð½G Þ the -algebra of d d matrices with coefﬁ G d cients in ½G .d For x ¼ ðx1 , x2 , . . . , xd Þ and a ¼ aij i,j¼1 Matd ð½G Þ, we deﬁne xa d P ¼ ðy1 , y2 , . . . , yd Þ G by setting yj ¼ di¼1 xi aij for all j = 1, 2, . . ., d, where xiaij is the convolution product of xi G and aij ½G deﬁned using (1). The map Matd ð½G Þ 3 a 7! a Matd ð½G Þ, where aij ðg Þ ¼ aji ðg 1 Þ for all g G and i, j = 1, 2, . . ., d is an anti-involution of the algebra Matd ð½G Þ, since a ¼ a and ab ¼ ba, for all a,b Matd ð½G Þ. Let a Matd ð½G Þ and deﬁne the map ta : d G G ! d by setting

Zero-Divisors in Group Rings Let R be a ring. A non zero element a R is said to be a left (resp. right) zero-divisor provided there exists a non zero element b R such that ab = 0 (resp. ba = 0). The following result relates the notion of a zero-divisor in a group ring ½G with the preinjectivity of one-dimensional linear cellular automata over the group G. We use the same notation as in Theorem 8 (here d = 1). Lemma 1 (Ceccherini-Silberstein and Coornaert 2006) Let G be a group and let be a ﬁeld. An element a ½G is a left zero-divisor if and only if the linear cellular automaton ta : G ! G is not pre-injective. Let G be a group and suppose that it contains an element g0 of ﬁnite order n 2. Then we have ð1G g0 Þ 1G þ g0 þ g 20 þ þ g n1 ¼ 0, 0 showing that ½G has zero-divisors. A group is torsion-free if it has no non-trivial element of ﬁnite order. Kaplansky zero-divisor problem (Kaplansky 1957) asks whether ½G has no zero-divisors whenever G is torsion-free. In virtue of Lemma 1 and Theorem 8 we can state it as follows (see Ceccherini-Silberstein and Coornaert 2006).

Cellular Automata and Groups

Problem 1 (Kaplansky zero-divisor problem reformulated in terms of cellular automata) Let G be a torsion-free group and let be a ﬁeld. Is it true that every non-identically-zero linear cellular automaton t : G ! G is pre-injective? The zero-divisor problem is known to have an afﬁrmative answer for a wide class of groups including the free groups, the free Abelian groups, the fundamental groups of surfaces and the braid groups Bn. Combining Lemma 1 with Theorem 6 we deduce the following. Corollary 3 Let G be a countable amenable group and let be a ﬁeld. Suppose that ½G has no zero-divisors. Then every non-identicallyzero linear cellular automaton t : G ! G is surjective. The class of elementary amenable groups is the smallest class of groups containing all ﬁnite and all Abelian groups that is closed under taking extensions and directed unions. It is known, see Theorem 1.4 in (Kropoholler et al. 1988), that if G is a torsion-free elementary amenable group, then ½G has no zero-divisor for any ﬁeld . As a consequence, the conclusion of Corollary 3 holds for all torsion-free elementary amenable groups.

Stable Finiteness of Group Rings Recall that a ring R with identity element 1R is said to be directly ﬁnite if one-sided inverses in R are also two-sided inverses, i.e., ab = 1R implies ba = 1R for a, b R. The ring R is said to be stably ﬁnite if the ring Md(R) of d d matrices with coefﬁcients in R is directly ﬁnite for all integers d 1. Commutative rings and ﬁnite rings are obviously directly ﬁnite. Also observe that if elements a and b of a ring R satisfy ab = 1R then (ba)2 = ba, that is, ba is an idempotent. Therefore if the only idempotent of R are 0R and 1R (e.g. if R has no zero-divisors) then R is directly ﬁnite. The ring of endomorphisms of an inﬁnite-dimensional vector

235

space yields an example of a ring which is not directly ﬁnite. Kaplansky (1969) observed that, for any group G and any ﬁeld of characteristic 0, the group ring ½G is stably ﬁnite and asked whether this property remains true for ﬁelds of characteristic p > 0. We have that this holds for L-surjunctive groups. Using the matrix representation of linear cellular automata (Theorem 8) one has the following characterization of L-surjunctivity. Theorem 9 For a group G, a ﬁeld , and an integer d 1 the following conditions are equivalent: (a) Every injective linear cellular automaton t : d G G ! d is surjective; (b) The ring Matd ð½G Þ is directly ﬁnite. As a consequence, a group G is L-surjunctive if and only if the group ring ½G is stably ﬁnite for any ﬁeld . From Theorem 7 and Theorem 9 we deduce the following result previously established by G. Elek and A. Szabó using different methods. Corollary 4 (Ceccherini-Silberstein and Coornaert 2007b; Elek and Szabó 2004) Let G be a soﬁc group and any ﬁeld. Then the group ring ½G is stably ﬁnite.

Future Directions We indicate some open problems related to the topics that we have treated in this article. Garden of Eden Theorem As we mentioned in the subsection “Amenable Groups”, it would be interesting to determine whether the Myhill theorem (i.e. the implication (b) ) (a) in Theorem 3), which holds for amenable groups, but fails to hold for groups containing the free group F2 (cf. Example 9), holds or not for

236

the non-amenable groups with no free subgroups (such as the free Burnside groups B(m, n), m 665 odd, see Adyan (1983)). Note that a negative answer would give another new characterization of amenability for groups. Problem 2 Determine whether the Myhill theorem (pre-injectivity implies surjectivity) for cellular automata with ﬁnite alphabet holds only for amenable groups. It turns out that Bartholdi’s cellular automata (Bartholdi (2008), see subsection “Amenable Groups”) are not linear, so that the question whether the linear GOE theorem (Theorem 6) holds also for non-amenable groups remains an open problem. Problem 3 Determine whether the GOE theorem for linear cellular automata over ﬁnitedimensional vector spaces holds only for amenable groups or not. More precisely, determine whether Moore’s theorem and/or Myhill’s theorem for linear cellular automata over ﬁnite dimensional vector spaces hold only for amenable groups or not. In Ceccherini-Silberstein and Coornaert (2008) we generalized the GOE theorem to linear cellular automata over semisimple modules (over a, not necessarily commutative, ring R) of ﬁnite length with universe an amenable group. A vector space is a (semisimple) left module over a ﬁeld. The ﬁnite length condition for modules (which corresponds to the ascending chain condition (Noetherianity) and to the descending chain condition (Artinianity)) is the natural analogue of the notion of ﬁnite dimension for vector spaces. The Garden of Eden theorem can be also generalized by looking at subshifts. Given an alphabet A and a countable group G a subshift X AG is a subset which is closed (in the topology induced by the metric (3)) and G-invariant (if x X then xg X for all g G). If G is amenable and X AG is a subshift the quantity (5) is the entropy of X. Given two subshifts X, Y AG we deﬁne a cellular automaton t : X ! Y as the restriction to X of a cellular automaton t : AG ! AG such that tð X Þ Y .

Cellular Automata and Groups

Problem 4 Let G be a countable amenable group, A a ﬁnite alphabet and X, Y AG two subshifts with ent(X) = ent(Y). Prove, under suitable conditions, the GOE theorem for cellular automata t : X ! Y. We mention that the GOE theorem for subshifts over amenable groups fails to hold in general with no additional hypotheses on the subshifts. Let G = ℤ be the inﬁnite cyclic group and let A be a ﬁnite alphabet. For n, m ℤ we set [n, m] = {x ℤ : n x m}. Also, we denote by A = {a1a2 an : ai A, 1 i n, n ℕ} the set of all words over A. The length of a word w = a1a2 an A is ‘(w) = n. Given a subset X AG we denote by W(X) = {w A : ∃ x X, s. t. w = x|[0, ‘(w)]} the language associated with X. Then one says that a subshift X Aℤ is irreducible if, for any two subwords w1, w2 W(X) there exists w3 A (necessarily in W(X)) such that w1w3w2 W(X). Also it can be shown that, for a subshift X Aℤ, there exists a set F A of so-called forbidden words, such that setting n o

X F ≔ x Aℤ : xg ½0,n 2 = F , 8n ℕ, 8g ℤ , one has X ¼ X F . Then a subshift X Aℤ is of ﬁnite type if X ¼ X F for some ﬁnite set F A . Finally, X is soﬁc (same etymology but a different meaning from that used for groups in subsection “Soﬁc Groups”) if X = t(Y) for some cellular automaton t : Aℤ ! Aℤ and some subshift Y Aℤ of ﬁnite type. In Fiorenzi (2000), F. Fiorenzi considered cellular automata on irreducible subshifts of ﬁnite type inside Aℤ(A ﬁnite). She proved the GOE theorem for such cellular automata and provided examples of cellular automata on subshifts of ﬁnite type which are not irreducible and for which both implications of the GOE theorem fail to hold. She also provided an example of a cellular automaton on an irreducible subshift which is soﬁc but not of ﬁnite type for which the Moore theorem (namely the implication (a) ) (b) in Theorem 3) fails to hold. Note that it is well

Cellular Automata and Groups

known (cf. 2.1 in Fiorenzi (2000)) that, under the same hypotheses, the Myhill theorem (namely the implication (b) ) (a) in Theorem 3) always holds true (G = ℤ). More generally, for groups G other than the integers Z, one needs appropriate notions of irreducibility for the subsets X AG as investigated by Fiorenzi (2003, 2004). Surjunctivity Problem 5 Prove or disprove that all groups are surjunctive. A positive answer to the previous problem could be derived by positively answering to the following Problem 6 Prove or disprove that all groups are soﬁc. By considering the linear analogue of Problem 5 we have Problem 7 (Kaplansky’s conjecture on stable ﬁniteness of group rings) Prove or disprove that all groups are L-surjunctive. Equivalently (cf. Theorem 9), prove or disprove that the group ring ½G is stably ﬁnite for any group G and any ﬁeld . Also, one could look for surjunctivity results for cellular automata with alphabets other than the ﬁnite ones and the ﬁnite dimensional vector spaces. A ring is called left Artinian (see Zariski and Samuel 1975) if it satisﬁes the descending condition on left ideals, namely every decreasing sequence R I1 I2 In In + 1 of left ideals eventually stabilizes (there exists n0 such that I n ¼ I n0 for all n n0). In Ceccherini-Silberstein and Coornaert (2007a) we showed that if G is a residually ﬁnite group and M is an Artinian left module over a ring R (e.g. if M is a ﬁnitely generated left module over a left Artinian ring R), then every injective R-linear cellular automaton t : MG ! MG is surjective. In Ceccherini-Silberstein and Coornaert (2007c) we showed that if G is a soﬁc group (thus a weaker condition than being residually

237

ﬁnite) and M is a left module of ﬁnite length over a ring R (thus a stronger condition than being just Artinian), then every injective R-linear cellular automaton t : MG ! MG is surjective. As a consequence (cf. Theorem 9) we have that the group ring R[G] is stably ﬁnite for any left (or right) Artinian ring R and any soﬁc group G. It is therefore natural to consider the following generalization of Problem 7. Problem 8 Prove or disprove that the group ring R[G] is stably ﬁnite for any group G and any left (or right) Artinian ring R. Problem 9 (Kaplansky’s zero divisor conjecture for group rings) Prove or disprove that if G is torsion-free then any non-identically zero linear cellular automaton t : G ! G , where is a ﬁeld, is preinjective. Equivalently (cf. Lemma 1 and Theorem 8), prove or disprove that if G is torsion-free, the group ring ½G has no zero divisors.

Bibliography Adyan SI (1983) Random walks on free periodic groups. Math USSR Izvestiya 21:425–434 Bartholdi L (2008) A converse to Moore’s and Hedlund’s theorems oncellular automata. J Eur Math Soc (to appear). Preprint arXiv:0709.4280 Berlekamp ER, Conway JH, Guy RK (1982) Winning ways for your mathematical plays, vol 2, Chap. 25. Academic, London Ceccherini-Silberstein T, Coornaert M (2006) The Garden of Eden theorem for linear cellular automata. Ergod Theory Dyn Syst 26:53–68 Ceccherini-Silberstein T, Coornaert M (2007a) On the surjunctivity of Artinian linear cellular automata over residually ﬁnite groups. In: Geometric group theory, Trends in mathematics. Birkhäuser, Basel, pp 37–44 Ceccherini-Silberstein T, Coornaert M (2007b) Injective linear cellular automata and soﬁc groups. Isr J Math 161:1–15 Ceccherini-Silberstein T, Coornaert M (2007c) Linear cellular automata over modules of ﬁnite length and stable ﬁniteness of group rings. J Algebra 317:743–758 Ceccherini-Silberstein T, Coornaert M (2008) Amenability and linear cellular automata over semisimple modules of ﬁnite length. Commun Algebra 36:1320–1335 Ceccherini-Silberstein TG, Machì A, Scarabotti F (1999) Amenable groups and cellular automata. Ann Inst Fourier 49:673–685

238 Ceccherini-Silberstein TG, Fiorenzi F, Scarabotti F (2004) The Garden of Eden theorem for cellular automata and for symbolic dynamical systems. In: Random walks and geometry (Vienna 2001). de Gruyter, Berlin, pp 73–108 Elek G, Szabó A (2004) Soﬁc groups and direct ﬁniteness. J Algebra 280:426–434 Elek G, Szabó A (2006) On soﬁc groups. J Group Theory 9:161–171 Fiorenzi F (2000) The Garden of Eden theorem for soﬁc shifts. Pure Math Appl 11(3):471–484 Fiorenzi F (2003) Cellular automata and strongly irreducible shifts of ﬁnite type. Theor Comput Sci 299(1–3):477–493 Fiorenzi F (2004) Semistrongly irreducible shifts. Adv Appl Math 32(3):421–438 Følner E (1955) On groups with full Banach mean value. Math Scand 3:245–254 Ginosar Y, Holzman R (2000) The majority action on inﬁnite graphs: strings and puppets. Discret Math 215:59–71 Gottschalk W (1973) Some general dynamical systems. In: Recent advances in topological dynamics, Lecture notes in mathematics, vol 318. Springer, Berlin, pp 120–125 Gottschalk WH, Hedlund GA (1955) Topological dynamics. In: American Mathematical Society Colloquium publications, vol 36. American Mathematical Society, Providence Greenleaf FP (1969) Invariant means on topological groups and their applications. Van Nostrand, New York Gromov M (1999) Endomorphisms of symbolic algebraic varieties. J Eur Math Soc 1:109–197 Hungerford TW (1987) Algebra, graduate texts in mathematics. Springer, New York Kaplansky I (1957) Problems in the theory of rings. Report of a conference on linear algebras, June, 1956, pp 1–3. National Academy of Sciences-National Research Council, Washington, Publ. 502 Kaplansky I (1969) Fields and rings. Chicago lectures in mathematics. University of Chicago Press, Chicago Kropoholler PH, Linnell PA, Moody JA (1988) Applications of a new K-theoretic theorem to soluble group rings. Proc Am Math Soc 104:675–684

Cellular Automata and Groups Lind D, Marcus B (1995) An introduction to symbolic dynamics and coding. Cambridge University Press, Cambridge Machì A, Mignosi F (1993) Garden of eden conﬁgurations for cellular automata on Cayley graphs of groups. SIAM J Discret Math 6:44–56 Moore EF (1963) Machine models of self-reproduction. Proc Symp Appl Math AMS 14:17–34 Myhill J (1963) The converse of Moore’s garden of eden theorem. Proc Am Math Soc 14:685–686 von Neumann J (1930) Zur allgemeinen Theorie des Maßes. Fundam Math 13:73–116 von Neumann J (1966) In: Burks A (ed) The theory of selfreproducing automata. University of Illinois Press, Urbana/London Ol’shanskii AY (1980) On the question of the existence of an invariant mean on a group. Usp Mat Nauk 35(4(214)):199–200 Ornstein DS, Weiss B (1987) Entropy and isomorphism theorems for actions of amenable groups. J Anal Math 48:1–141 Passman DS (1985) The algebraic structure of group rings. Reprint of the 1977 original. Robert E. Krieger Publishing, Melbourne Paterson A (1988) Amenability, AMS mathematical surveys and monographs, vol 29. American Mathematical Society, Providence Ulam S (1952) Processes and transformations. Proc Int Cong Math 2:264–275 Varopoulos NT, Saloff-Coste L, Coulhon T (1992) Analysis and geometry on groups. Cambridge University Press, Cambridge Weiss B (2000) Soﬁc groups and dynamical systems, (Ergodic theory and harmonic analysis, Mumbai, 1999). Sankhya Ser A 62:350–359 Woess W (2000) Random walks on inﬁnite graphs and groups, Cambridge Tracts in Mathematics, vol 138. Cambridge University Press, Cambridge Zariski O, Samuel P (1975) Commutative algebra. vol 1. Graduate texts in mathematics, No. 28. Springer, New York. With the cooperation of IS Cohen. Corrected reprinting of the 1958 edition.

Self-Replication and Cellular Automata Gianluca Tempesti1, Daniel Mange2 and André Stauffer2 1 University of York, York, UK 2 Ecole Polytechnique Fédérale de Lausanne (EPFL), Lausanne, Switzerland

Article Outline Glossary Deﬁnition of the Subject Introduction Von Neumann’s Universal Constructor Self-Replication for Artiﬁcial Life Other Approaches to Self-Replication Future Directions Bibliography

Glossary Cellular automaton A cellular automaton (CA) is a mathematical framework modeling an array of cells that interact locally with their neighbors. In this cellular space, each cell has a set of neighbors, cells have values or states, all the cells update their values simultaneously at discrete time steps or iterations, and the new state of a cell is determined by the current state of its neighbors (including itself) according to a local function or rule, identical for all cells. In the entry, the term is extended to account for systems that introduce variations to the basic deﬁnition (e.g., systems where cells do not update simultaneously or do not have the same set of rules in every cell).Following the historical pattern, in the entry, the same term is also used to refer to an object or structure built within the cellular space, i.e., a set of cells in a

particular, usually active, state (overlapping with the deﬁnition of conﬁguration). Conﬁguration A set of cells in a given state at a given time. Usually, but not always, the term refers to the state of all the cells in the entire space. The initial conﬁguration is the state of the cells at time t = 0. Construction The process that occurs when one or more cells, initially in the inactive or quiescent state, are assigned an active state (in the context of this entry, by the self-replicating structure). Self-replication The process whereby a cellular automaton conﬁguration creates a copy of itself in the cellular space. Incidentally, you will note that in the entry we use the terms self-replication and self-reproduction interchangeably. In reality, the two terms are not really synonyms: self-reproduction is more properly applied to the reproduction of organisms, while self-replication concerns the cellular level. The more correct term to use in most cases would probably be self-replication, but since von Neumann favored self-reproduction, we will ignore the distinction. Self-reproduction See self-replication

Definition of the Subject Machine self-replication, besides inspiring numerous ﬁctional books and movies, has long been considered a powerful paradigm to allow artifacts, for example, to survive in hostile environments (such as other planets) or to operate more efﬁciently by creating populations of machines working together to achieve a given task. Where the self-replication of computing machines is concerned, other motivations can also come into play, related to concepts such as fault tolerance and self-organization. Cellular automata have traditionally been the framework of choice for the study of selfreplicating computing machines, ever since they were used by John von Neumann, who pioneered the ﬁeld in the 1950s. In this context,

# Springer Science+Business Media LLC, part of Springer Nature 2018 A. Adamatzky (ed.), Cellular Automata, https://doi.org/10.1007/978-1-4939-8700-9_477 Originally published in R. A. Meyers (ed.), Encyclopedia of Complexity and Systems Science, # Springer Science+Business Media New York 2013 https://doi.org/10.1007/978-3-642-27737-5_477-7

239

240

self-replication is seen as the process whereby a conﬁguration in the cellular space is capable of creating a copy of itself in a different location. As a mathematical framework, CA allow researchers to study the mechanisms required to achieve self-replication in a simpliﬁed environment, in view of eventually applying this process to real-world systems, either to electronics or, more generally, to computing systems.

Introduction The self-replication of computing systems is an idea that dates back to the very origins of electronics. One of the pioneers of the ﬁeld, John von Neumann, was among the ﬁrst to investigate the possibility of creating machines capable of selfreplication (Asprey 1992) with the purpose of achieving reliability through the redundant operation of “populations” of computing machines. Throughout the more than 50 years since von Neumann’s seminal work, research on this topic has gone through several transformations. While interest in applying self-replication to electronic systems waned because of technological hurdles, the ﬁeld of artiﬁcial life, starting with the pioneering work of Chris Langton (Langton 1984), began studying this process in the more general context of achieving lifelike properties in artiﬁcial systems. Throughout its long history, cellular automata (CA) have remained one of the environments of choice to study how self-replication can be applied to computing systems. In general, researchers in the domain (including von Neumann) have never regarded CA as the environment in which self-replication would be ultimately applied. Rather, CA have traditionally provided a useful platform to test the complexity of self-replication at an early stage, in view of eventually applying this process to real-world systems, either to electronics or, more generally, to computing systems. Of course, the concept of self-replication has been applied to artiﬁcial systems in contexts other than computing. A classic example is the 1980 NASA study by Robert Freitas Jr. and Ralph

Self-Replication and Cellular Automata

Merkle (Freitas Jr and Gilbreath 1980) (recently expanded in a remarkable book (Freitas and Merkle 2004)), where self-replication is used as a paradigm for efﬁciently exploring other planets. However, this kind of self-replication, applied to physical machines rather than computing systems, does not commonly make use of cellular automata and is beyond the scope of this entry. Following the historical progress of selfreplication in cellular automata (derived in part from Tempesti (1998)), we will ﬁrst examine in some detail von Neumann’s seminal work (section “Von Neumann’s Universal Constructor”). Then, the use of self-replication as an artiﬁcial life paradigm will be discussed (section “SelfReplication for Artiﬁcial Life”) before dealing with some of the latest advances in the ﬁeld in section “Other Approaches to Self-Replication.”

Von Neumann’s Universal Constructor Many of the existing approaches to the selfreplication of computing systems are essentially derived from the work of John von Neumann (Asprey 1992), who pioneered this ﬁeld of research in the 1950s. Von Neumann, confronted with the lack of reliability of computing systems, turned to nature to ﬁnd inspiration in the design of fault-tolerant computing machines. Let us remember that the computers von Neumann was familiar with were based on vacuum-tube technology and that vacuum tubes were much more prone to failure than modern transistors. Moreover, since the writing and the execution of complex programs on such systems represented many hours (if not many days) of work, the failure of a system had important consequences in wasted time and effort. In particular, Von Neumann investigated selfreplication as a way to design and implement digital logic devices. Unfortunately, the state of the art in the 1950s restricted von Neumann’s investigations to a purely theoretical level, and the work of his successors mirrored this constraint. Indeed, it is not until fairly recently that some of the technological problems associated with the implementation of such a process in

Self-Replication and Cellular Automata

silicon have been resolved with the introduction of new kinds of electronic devices (see section “Other Approaches to Self-Replication”). In this section, we will analyze von Neumann’s research on the subject of self-replicating computing machines and in particular his universal constructor, a self-replicating cellular automaton (Burks and von Neumann 1966). Von Neumann’s Self-Replicating Machines Natural systems are among the most reliable complex systems known to man, and their reliability is a consequence not of any particular robustness of the individual cells (or organisms), but rather of their extreme redundancy. The basic natural mechanism which provides such reliability is self-reproduction, both at the cellular level (where the survival of a single organism is concerned) and at the organism level (where the survival of the species is concerned). Thus von Neumann, drawing inspiration from natural systems, attempted to develop an approach to the realization of self-replicating computing machines (which he called artiﬁcial automata, as opposed to natural automata, that is, biological organisms). In order to achieve his goal, he imagined a series of ﬁve distinct models for self-reproduction (Burks and von Neumann 1966, pp. 91–99): 1. The kinematic model, introduced by von Neumann on the occasion of a series of ﬁve lectures given at the University of Illinois in December 1949, is the most general. It involves structural elements such as sensors, muscle-like components, joining and cutting tools, along with logic (switch) and memory elements. Concerning, as it does, physical as well as electronic components, its goal was to deﬁne the bases of self-replication, but was not designed to be implemented. 2. In order to ﬁnd an approach to self-replication more amenable to a rigorous mathematical treatment, von Neumann, following the suggestion of the mathematician S. Ulam, developed a cellular model. This model, based on the use of cellular automata as a framework for study, was probably the closest to an actual realization. Even if it was never completed, it

241

was further reﬁned by von Neumann’s successors and was the basis for most further research on self-replication. 3. The excitation-threshold-fatigue model was based on the cellular model, but each cell of the automaton was replaced by a neuron-like element. Von Neumann never deﬁned the details of the neuron, but through a careful analysis of his work, we can deduce that it would have borne a fairly close relationship to today’s simplest artiﬁcial neural networks, with the addition of some features which would have both increased the resemblance to biological neurons and introduced the possibility of self-replication. 4. For the continuous model, von Neumann planned to use differential equations to describe the process of self-reproduction. Again, we are not aware of the details of this model, but we can assume that von Neumann planned to deﬁne systems of differential equations to describe the excitation, threshold, and fatigue properties of a neuron. At the implementation level, this would probably correspond to a transition from purely digital to analog circuits. 5. The probabilistic model is the least well deﬁned of all the models. We know that von Neumann intended to introduce a kind of automaton where the transitions between states were probabilistic rather than deterministic. Such an approach would allow the introduction of mechanisms such as mutation and thus of the phenomenon of evolution in artiﬁcial automata. Once again, we cannot be sure of how von Neumann would have realized such systems, but we can assume they would have exploited some of the same tools used today by genetic algorithms. Of all these models, the only one von Neumann developed in some detail was the cellular model. Since it was the basis for the work of his successors, it deserves to be examined more closely. Von Neumann’s Cellular Model In von Neumann’s work, self-reproduction is always presented as a special case of universal

242

construction, that is, the capability of building any machine given its description (Fig. 1). This approach was maintained in the design of his cellular automaton, which is therefore much more than a self-replicating machine. The complexity of its purpose is reﬂected in the complexity of its structure, based on three separate components: 1. A memory tape, containing the description of the machine to be built, in the form of a onedimensional string of elements. In the special case of self-reproduction, the memory contains a description of the universal constructor itself (Fig. 2). It is interesting to note that the memory of von Neumann’s automaton bears a strong resemblance to the biological genome.

Self-Replication and Cellular Automata, Fig. 1 Von Neumann’s universal constructor Uconst can build a specimen of any machine (e.g., a universal Turing machine Ucomp) given its description D(Ucomp)

Self-Replication and Cellular Automata, Fig. 2 Given its own description D(Uconst), von Neumann’s universal constructor is capable of self-replication

Self-Replication and Cellular Automata

This resemblance is even more remarkable when considering that the structure of the genome was not discovered until after the death of von Neumann. 2. The constructor itself, a very complex machine capable of reading the memory tape and interpreting its contents. 3. A constructing arm, directed by the constructor, used to build the offspring (i.e., the machine described in the memory tape). The arm moves across the space and sets the state of the elements of the offspring to the appropriate value. The implementation as a cellular automaton is no less complex. Each element has 29 possible states, and thus, since the next state of an element depends on its current state and that of its four cardinal neighbors, 295 = 20,511,149 transition rules are required to exhaustively deﬁne its behavior. If we consider that the size of von Neumann’s constructor is of the order of several hundred thousand elements, we can easily understand why a hardware realization of such a machine is not really feasible. In fact, as part of our research, we did realize a hardware implementation of a set of elements of von Neumann’s automaton (Beuchat and Haenni 2000; Sipper et al. 1997). By carefully designing the hardware structure of each element, we were able to considerably reduce the amount of memory required to host the transition rules. Nevertheless, our system remains a demonstration unit, as it consists of a few elements only, barely enough to illustrate the behavior of a tiny subset of the entire machine. It is also worth mentioning that von Neumann went one step further in the design of his universal constructor. If we consider the universal constructor from a biological viewpoint, we can associate the memory tape with the genome and thus the entire constructor with a single cell (which would imply a parallel between the automaton’s elements and molecules). However, the constructor, as we have described it so far, has no functionality outside of self-reproduction. Von Neumann recognized that a self-replicating machine would require some sort of functionality to be interesting

Self-Replication and Cellular Automata

243

Self-Replication and Cellular Automata, Fig. 3 By extension, von Neumann’s universal constructor can include a universal computer and still be capable of selfreplication

from an engineering point of view and postulated the presence of a universal computer (in practice, a universal Turing machine, an automaton capable of performing any computation) alongside the universal constructor (Fig. 3). Von Neumann’s constructor can thus be regarded as a unicellular organism, containing a genome stored in the form of a memory tape, read and interpreted by the universal constructor (the mother cell) both to determine its operation and to direct the construction of a complete copy of itself (the daughter cell). Von Neumann’s Successors The extreme size of von Neumann’s universal constructor has so far prevented any kind of physical implementation (apart from the small demonstration unit we mentioned). But further, even the simulation of a cellular automaton of such complexity was far beyond the capability of early computer systems. Today, such a simulation is starting to be conceivable. Umberto Pesavento, a young Italian high-school student, developed a simulation of von Neumann’s entire universal constructor (Pesavento 1995). The computing power available did not allow him to simulate either the entire self-replication process (the length of the memory tape needed to describe the automaton would have required too large an array) or the Turing machine necessary to implement the universal computer, but he was able to demonstrate the full functionality of the constructor.

Considering the rapid advances in computing power of modern computer systems, we can assume that a complete simulation could be envisaged with today’s technology. In fact, an effort is currently under way (Buckley and Mukherjee 2005) to implement a complete specimen of the constructor. To achieve this goal, Buckley is revisiting and analyzing in detail the operation of the constructor. To give an idea of the scope of this work, Buckley’s results indicate that the interpreter-copier (without the tape) is bounded by a region of 751 1,048 = 787,048 cells. The impossibility of achieving a physical realization did not, however, deter some researchers from trying to continue and improve von Neumann’s work (Banks 1970; Lee 1968; Nourai and Kashef 1975). Arthur Burks, for example, in addition to editing von Neumann’s work on self-replication (Burks 1970; Burks and von Neumann 1966), also made several corrections and advances in the implementation of the cellular model. Codd (1968), by altering the states and the transition rules, managed to simplify the constructor by a considerable degree. Vitanyi (1973) studied the possibility of introducing sexual reproduction in von Neumann’s approach. However, without in any way lessening these contributions, we can say that no major theoretical advance in the research on selfreproducing automata occurred until C. Langton, in 1984, opened a second stage in this ﬁeld of research.

244

Self-Replication for Artificial Life While the implementation of von Neumann’s universal constructor faced insurmountable (at the time) technological hurdles, the same could not be said of the theoretical contribution that his approach represented as an attempt to study a biologically inspired process within the world of computing systems. In this context, the main drawback of von Neumann’s work lay in the inability to achieve self-replication without resorting to an extremely complex simulation of a complete machine. Von Neumann’s Universal Constructor was so complex because it tried to implement selfreproduction as a particular case of construction universality, i.e., the capability of constructing any other automaton, given its description. C. Langton approached the problem somewhat differently by attempting to deﬁne the simplest cellular automaton, commonly known as Langton’s loop (Langton 1984), capable exclusively of self-reproduction. Langton’s loop had a major impact on research in self-replication by introducing a new way to think about this process in more “abstract” terms as a study of the application of biologically inspired mechanisms to computing, exemplifying the ﬁeld known as artiﬁcial life. In this context, rather than the replicating machine, it is the process of self-replication itself that becomes the object of study. This novel approach generated research that can be considered fundamentally different from Self-Replication and Cellular Automata, Fig. 4 The initial conﬁguration of Langton’s loop (iteration 0)

Self-Replication and Cellular Automata

that of von Neumann and started discussion on topics such as the analogy with cellular division and with the reproduction of individuals in a population (e.g., in Mange et al. 2000, Section V.B), the difference between trivial and nontrivial selfreplication in cellular automata (e.g., in automata such as those described in Lohn and Reggia (1997)), or the connections between evolution and self-replication (e.g., in the work of Sayama (Mange et al. 2000)). Langton’s Loop As a consequence of his approach, Langton’s loop is orders of magnitude simpler than von Neumann’s constructor. In fact, it is loosely based on one of the simplest organs (an organ in this context can be seen as a self-supporting structure capable of a single subtask) in Codd’s automaton: the periodic emitter (itself derived from von Neumann’s periodic pulser), a relatively simple structure capable of generating a repeating string of a given sequence of pulses. Langton’s loop (Fig. 4) is named after the dynamic storage of data inside a square sheath (red in the ﬁgure). The data is stored as a sequence of instructions for directing the constructing arm, coded in the form of a set of three states. The data turns counterclockwise in permanence within the sheath, creating a loop. The two instructions in Langton’s loop are extremely simple. One instruction (uniquely identiﬁed by the yellow element in the ﬁgure) tells the arm to advance by one position (Fig. 5), while the other (green in the ﬁgure) directs the arm to turn

Self-Replication and Cellular Automata

245

Self-Replication and Cellular Automata, Fig. 5 The constructing arm advances by one space

Self-Replication and Cellular Automata, Fig. 6 The constructing arm turns 90 to the left

90 to the left (Fig. 6). Obviously, after three such turns, the arm has looped back on itself (Fig. 7), at which stage a messenger (the pink element) starts the process of severing the connection between the parent and the offspring, thus concluding the replication process. Once the copy is over, the parent loop proceeds to construct a second copy of itself in a different direction (to the north in this example), while the offspring itself starts to reproduce (to the east in

this example). The sequential nature of the selfreproduction process generates a spiraling pattern in the propagation of the loop through space (Fig. 8): as each loop tries to reproduce in the four cardinal directions, it ﬁnds the place already occupied either by its parent or by the offspring of another loop, in which case it dies (the data within the loop is destroyed). Langton’s loop uses eight states for each of the 86 non-quiescent cells making up its initial

246

Self-Replication and Cellular Automata

Self-Replication and Cellular Automata, Fig. 7 The copy is complete, and the connection from parent to offspring is severed

conﬁguration, a ﬁve-cell neighborhood, and a few hundred transition rules (the exact number depends on whether default rules are used and whether symmetric rules are included in the count). Further simpliﬁcations to Langton’s automaton were introduced by Byl (1989), who eliminated the internal sheath and reduced the number of states per cell, the number of transition rules, and the number of non-quiescent cells in the initial conﬁguration. Reggia et al. (1993) managed to remove also the external sheath, thus designing the smallest self-replicating loop known to date. Given their modest complexity, at least relative to von Neumann’s automaton, all of the mentioned automata have been thoroughly simulated. Langton’s loop has been used as the basis for several approaches, mostly aimed at studying the properties of self-replication within a cellular

system in the context of artiﬁcial life. Sayama (1998) introduced structural dissolution (whereby a loop can destroy itself, in addition to replicating) to obtain colonies of loops that are dynamically stable and exhibit a potentially evolvable behavior. Nehaniv (2002) extended Langton’s approach to asynchronous cellular automata, while Sipper (1995) developed a selfreplicating loop in a nonuniform CA (i.e., a CA where the transition rules are not necessarily identical in all cells). Perrier’s Loop In the context of applying self-reproduction to the replication of computing machines and hence return to von Neumann’s original goals, the main weakness of Langton’s loop resides in the absence of any functionality beyond self-reproduction itself. To overcome this limitation, Perrier and

Self-Replication and Cellular Automata

247

Self-Replication and Cellular Automata, Fig. 8 Propagation pattern of Langton’s loop

Zahnd developed a relatively complex automaton (Fig. 9) in which a two-tape Turing machine was appended to Langton’s loop (Perrier et al. 1996). This automaton exploits Langton’s loop as a sort of “carrier” (Fig. 10); the ﬁrst operation of Perrier’s loop is to allow Langton’s loop to build a copy of itself (iteration 128: note that the copy is limited to one dimension, since the second dimension is taken up by the Turing machine). The main function of the offspring is to determine the

location of the copy of the Turing machine (iteration 134). Once the new loop is ready, a “messenger” runs back to the parent loop and starts to duplicate the Turing machine (iterations 158 and 194), a process completely disjoint from the operation of the loop. When the copy is ﬁnished (iteration 254), the same messenger activates the Turing machine in the parent loop (the machine had to be inert during the replication process in order to obtain a perfect copy).

248

Self-Replication and Cellular Automata, Fig. 9 A two-tape Turing machine appended to Langton’s loop (iteration 0)

The process is then repeated in each offspring until the space is ﬁlled (iteration 720: as the automaton exploits Langton’s loop for replication, meeting the boundary of the array causes the last machine to crash). Perrier’s automaton implements a selfreplicating Turing machine, a powerful construct which is unfortunately handicapped by its complexity: in order to implement a Turing machine, the automaton requires a very considerable number of additional states (more than 60), as well as an important number of additional transition rules. This kind of complexity, while still relatively minor compared to von Neumann’s universal constructor, is nevertheless too important to be really considered for an actual implementation. Tempesti’s Loop Always in the context of achieving selfreproduction of computing machines and besides the lack of functionality mentioned in section “Perrier’s Loop,” another problem of Langton’s loop is that it is not well adapted to ﬁnite CA arrays. Its self-reproduction mechanism assumes

Self-Replication and Cellular Automata

that there is enough space for a copy of the loop, and the entire loop becomes nonfunctional otherwise (Fig. 8). To overcome this limitation and move a step closer to the realization of self-replicating machines, we developed a self-replicating loop designed speciﬁcally to exist in a ﬁnite, but arbitrarily large, space, and at the same time capable, unlike Langton’s loop, to have a functionality in addition to self-replication. In designing our self-replicating automaton (Tempesti 1995, 1998), we did maintain some of the more interesting features of Langton’s loop. In particular, we preserved the structure based on a square loop to dynamically store information. Such storage is convenient in CA because of the locality of the rules. Also, we maintained the concept of constructing arm, in the tradition of von Neumann and his successors, even if we introduced considerable modiﬁcations to its structure and operation. While preserving some of the more interesting features of Langton’s loop, we nevertheless introduced some basic structural alterations (Fig. 11): • As in Byl’s version of Langton’s loop, we use only one sheath. In addition, four gate elements (in the same state as the sheath) at the four corners of the automaton enable or disable the replication process. • We extend four constructing arms in the four cardinal directions at the same time and thus create four copies of the original automaton in the four directions in parallel. When the arm meets an obstacle (either the boundary of the array or an existing copy of the loop), it simply retracts and puts the corresponding gate element in the closed position. • The arm does not immediately construct the entire loop. Rather, it constructs a sheath of the same size as the original. Once the sheath is ready, the data circulating in the loop is duplicated, and the copy is sent along the constructing arm to wrap around the new sheath. When the new loop is completed, the constructing arm retracts and closes the gate. • As a consequence, we use only four of the elements circulating in the loop to control the

Self-Replication and Cellular Automata

249

Self-Replication and Cellular Automata, Fig. 10 Self-replication of the Turing machine

process. This feature is a requirement for implementing functions which work after the copy has ﬁnished.

Self-Replication and Cellular Automata, Fig. 11 The initial conﬁguration of our loop (iteration 0)

self-replication process. The others can be used as a “program,” i.e., a set of states with their own transition rules which will then be applied alongside the self-reproduction to execute some function. • Unlike Langton’s loop, our loop does not “die” once duplication is achieved, as the circulating data remains untouched by the self-reproduction

We use a nine-element neighborhood (the element itself plus its eight neighbors), and the basic conﬁguration of the loop (Fig. 11) requires ﬁve states plus at least one data state. State 0 (black) is the quiescent state: it represents the inactive background. State 1 (white) is the sheath state, that is, the state of the elements making up the sheath and the four gates. State 2 (red) is the activation state or control state. The four gate elements are in state 2, as are the messengers which will be used to command the constructing arm and the tip of the constructing arm itself for the ﬁrst phase of construction, after which the tip of the arm will switch to state 3 (light blue), the construction state. State 3 will construct the sheath that will host the offspring, signal the parent loop that the sheath is ready, and lead the duplicated data to the new loop. State 4 (green), the destruction state, will

250

Self-Replication and Cellular Automata

Self-Replication and Cellular Automata, Fig. 12 The constructing arm begins to extend

Self-Replication and Cellular Automata, Fig. 13 The new sheath has been fully constructed, and a copy of the data is sent from the parent to the offspring

destroy the constructing arm once the copy is completed. In addition to these states, two additional data states (light and dark gray) represent the information stored in the loop. In this example, they are inactive, while the next section describes a loop where they are used to store an executable program. The initial conﬁguration is in the form of a square loop wrapped around a sheath. The size of the loop is variable and for our example is set to 8 8. Once the iterations begin, the data starts turning counterclockwise around the loop. Nothing happens until the ﬁrst control element (red) reaches a corner of the loop, where it checks the status of the gate. Since the gate is open, the control element splits into two identical elements: the ﬁrst continues turning around the loop, while the second starts extending the arm (Fig. 12). The arm advances automatically by one position in every two iterations. Once the arm has

started extending, each control element that arrives to a corner will again split, and one of the copies will start running along the arm, advancing twice as fast. When the ﬁrst of these messengers reaches the tip of the arm, the tip, which was until then in state 2, passes to state 3 and continues to advance at the same speed. This transformation tells the arm that it has reached the location of the offspring loop and to start constructing the new sheath. The next three messengers will force the tip of the arm to turn left, while the fourth causes the sheath to close upon itself (Fig. 13). It then runs back along the arm to signal to the original loop that the new sheath is ready. Once the return signal arrives at the corner of the original loop, it causes a copy of the data in the loop to run along the arm and wrap itself around the new sheath. Once the second copy has completed the loop (Fig. 14), it sends a destruction signal (green) back along the arm. The signal will destroy the

Self-Replication and Cellular Automata

251

Self-Replication and Cellular Automata, Fig. 14 The copy is complete and the constructing arm retracts

arm until it reaches the corner of the original loop, where it closes the gate to avoid further copies. After 121 time periods, the gates of the original automaton will be closed, and it will enter an inactive state, with the understanding that it will be ready to reproduce itself again should the gates be opened. The main advantage of the new mechanism is that it becomes relatively simple to retract the arm if an obstacle (either the boundary of the array or another loop) is encountered, and therefore our loop is perfectly capable of operating in a ﬁnite space. In Fig. 15, we illustrate an example of how the data states can be used to carry out operations alongside self-reproduction. The operation in question is the construction of three letters, LSL (the acronym of Logic Systems Laboratory, where the research was made), in the empty space inside the loop. Obviously, this is not a very useful operation from a computational point of view, but it is a far from trivial construction task which should sufﬁce to demonstrate the capabilities of the automaton.

As should be obvious, while our loop owes to von Neumann the concept of constructing arm and to Langton (and/or Codd) the basic loop structure, it is in fact a very different automaton, endowed with some of the properties of both. We have seen that von Neumann’s automaton is extremely complex, while Langton’s loop is very simple. The complexity of our automaton is more difﬁcult to estimate, as it depends on the data circulating in the loop. The number of nonquiescent elements making up the initial conﬁguration depends directly on the size of the circulating program. The more complex (i.e., the longer) the program, the larger the automaton (it should be noted, however, that the complexity of the selfreproduction process does not depend on the size of the loop). The number of transition rules is obviously a function of the number of data states: in the basic conﬁguration (i.e., one data state), the automaton needs 692 rules (173 rules rotated in the four directions), assuming that, by default, all elements remain in the same state. The complexity of the basic conﬁguration is therefore in the same

252

Self-Replication and Cellular Automata

Self-Replication and Cellular Automata, Fig. 15 The LSL automaton at different iterations

order as that of Langton’s and Byl’s loops, with the proviso that it is likely to increase drastically if the data in the loop is used to implement a complex function.

Other Approaches to Self-Replication Von Neumann’s and Langton’s structures represent the main landmarks in the study of self-replication in computing machines. It can safely be said that all other approaches refer, directly or indirectly, to these two systems. However, there exist some approaches to self-replication that cannot be easily reduced to simple variations on one of these two themes, either because they speciﬁcally take into

consideration some issues that are not addressed by Langton and von Neumann or because they occur in environments that are considerably different from the two original approaches. In this section, we will deal in depth with one example, the Tom Thumb algorithm that, while referring back to von Neumann insofar as its goal is the implementation of self-replicating logic circuits, is speciﬁcally designed to operate efﬁciently in the kind of digital devices that are available today. The algorithm approaches cellular automata from a slightly unconventional angle (Stauffer and Sipper 2004), with the objective of a hardware realization of self-replication within a programmable logic device or FPGA (Trimberger 1994).

Self-Replication and Cellular Automata

In the second part of the section, we will look at a set of approaches to self-replication that represent notable extensions to the approaches of von Neumann and Langton because of different mechanisms (self-inspection), operating milieus (threedimensional or self-timed CA), or design rules (evolutionary approaches). Self-Replication in Hardware: The Tom Thumb Algorithm In the past years, we have devoted considerable effort to research on self-replication, studying this process from the point of view of the design of high-complexity multiprocessor systems (with particular attention to next-generation technologies such as nanoelectronics). When considering self-replication in this context, Langton’s loop and its successors share several weaknesses. Notably, besides the lack of functionality of Langton’s loop (remedied only partially by its successors), which severely limits its usefulness for circuit design, each of these automata is characterized by a very loose utilization of the resources at its disposal: the majority of the elements in the cellular array remain in the quiescent state throughout the entire self-replication process. A new loop was then developed speciﬁcally to address these very practical issues. In fact, the system is targeted to the implementation of selfreplication within the context of digital circuits realized with programmable logic devices (the states of the cellular automaton can then be seen as the conﬁguration bits of the elements of the device). The new loop is based on an original algorithm, the so-called Tom Thumb algorithm (Mange et al. 2004a, b). The minimal loop compatible with this algorithm is made up of four cells, organized as a square of two rows by two columns (Fig. 16). Each cell is able to store in its four memory positions four hexadecimal characters of an artiﬁcial genome (deﬁned as the information required for the construction of the loop). The whole loop thus embeds 16 such characters. The original genome for the minimal loop is organized as another loop, the basic loop, of eight hexadecimal characters, i.e., half the number of

253

characters in the minimal loop, moving counterclockwise by one character at each time step. The 15 hexadecimal characters that compose the alphabet of the artiﬁcial genome are detailed in Fig. 17a. They are either empty data (0), message data (M = 1. . .E), or ﬂag data (F = 8. . .D,F). Message data will be used to conﬁgure our ﬁnal artiﬁcial organism, while ﬂag data are indispensable for constructing the skeleton of the loop. Furthermore, each character is given a status and will eventually be mobile data, moving indeﬁnitely around the loop, or ﬁxed data, deﬁnitely trapped in a memory position of a cell (Fig. 17b). It is important to note that, while in this simple example the message data can take value from 1 to E, the Tom Thumb algorithm is perfectly scalable in this respect, that is, the size of the message data can be increased at will, while the ﬂag data remain constant. This is a crucial observation in view of the exploitation of this algorithm in a programmable logic device, where the message data (the conﬁguration data for the programmable elements of the circuit) are usually much more complex. At each time step (t = 1,2,. . .), a character of the original loop is sent to the lower leftmost cell (Fig. 18). The construction of the loop, i.e., storing the ﬁxed data and deﬁning the paths for mobile data, depends on two rules: • If the four, three, or two rightmost memory positions of the cell are empty (blank squares), the characters are shifted by one position to the right (rule #1: shift data). • If the rightmost memory position is empty, the characters are shifted by one position to the right (rule #2: load data). In this situation, the two rightmost characters are trapped in the cell (ﬁxed data), and a new connection is established from the second leftmost position toward the northern, eastern, southern, or western cell, depending on the ﬁxed ﬂag information (in Fig. 18, at time t = 4, the ﬁxed ﬂag F = F determines a northern connection). At time t = 16, 16 characters, i.e., twice the contents of the basic loop, have been stored in the 16 memory positions of the loop (Fig. 18). Eight

254

characters are ﬁxed data, forming the phenotype of the ﬁnal loop, and the eight remaining ones are mobile data, composing a copy of the original genome, i.e., the genotype. Both interpretation (the construction of the cell) and copying (the duplication of the genetic information) have been therefore achieved. The ﬁxed data trapped in the rightmost memory positions of each cell remind us of the pebbles left by Tom Thumb for memorizing his way in the famous children’s story, an analogy that gives our algorithm its name. In order to grow loops in both horizontal and vertical directions, the mother loop should be able

Self-Replication and Cellular Automata, Fig. 16 Tom Thumb algorithm: basic loop

Self-Replication and Cellular Automata, Fig. 17 (a) Graphical and hexadecimal representations of the 15 characters forming the alphabet of the artiﬁcial genome. (b) Graphical representation of the status of each character

Self-Replication and Cellular Automata

to trigger the construction of two daughter loops, northward and eastward. Two new rules are then necessary: • At time t = 11 (Fig. 19), we observe a pattern of characters which is able to start the construction of the northward daughter loop; the upper leftmost cell is characterized by two speciﬁc ﬂags, i.e., a ﬁxed ﬂag in the rightmost position, indicating a north branch (F = C), and the branch activation ﬂag (F = F), in the leftmost position (rule #3: daughter loop to the north). The new path to the northward daughter loop will start from the second leftmost memory position (t = 12). • At time t = 23 (Fig. 20), another particular pattern of characters starts the construction of the eastward daughter loop; the lower rightmost cell is characterized by two speciﬁc ﬂags, i.e., a ﬁxed ﬂag indicating an east branch (F = D), in the rightmost position, and the branch activation ﬂag (F = F), in the leftmost position (rule #4: daughter loop to the east). The new path to the eastward daughter loop starts from the second leftmost memory position (t = 24).

Self-Replication and Cellular Automata

255

Self-Replication and Cellular Automata, Fig. 18 Construction of a ﬁrst specimen of the loop Self-Replication and Cellular Automata, Fig. 19 Creation of a new daughter loop to the north (rule #3)

When two or more paths are activated simultaneously, a clear priority should be established between the different paths. Three growth patterns were chosen (Fig. 21), leading to four more rules: • For loops in the lower row a collision occurs between the closing path, inside the loop, and the path entering the lower leftmost cell. The westward path has priority over the eastward path (rule #5). • With the exception of the bottom loop, the inner path (i.e., the westward path) has priority over the northward path (rule #6) for the loops in the leftmost column. • For all other loops, two types of collisions may occur: between the northward and eastward paths (two-signal collision) or between these two paths and a third one, the closing path (three-signal collision). In this case, the northward path will have priority over the eastward path (two-signal collision), and the westward path will have priority over the two other ones (three-signal collision) (rules #7 and #8).

We ﬁnally opted the following hierarchy: an east to west path has priority over a south to north path, which has priority over a west to east path. The results of such a choice are as follows (Fig. 21): a closing loop has priority over all other outer paths, which makes the completed loop entirely independent of its neighbors, and the loops will grow bottom-up vertically. This choice is quite arbitrary and may be changed according to other speciﬁcations. Unlike its predecessors, the Tom Thumb loop has been developed with a speciﬁc purpose beyond the theoretical study of self-replication. We believe that, in the not-so-distant future, circuits will reach densities such that conventional design techniques will become unwieldy. Should such a hypothesis be conﬁrmed, self-replication could become an invaluable tool, allowing the engineer to design a single processing element, part of an extremely large array that would build itself through the duplication of the original element.

256

Self-Replication and Cellular Automata

Self-Replication and Cellular Automata, Fig. 20 Creation of a new daughter loop to the east (rule #4)

Self-Replication and Cellular Automata, Fig. 21 Growth of a colony of minimal loops represented at different time steps

Current technology does not, of course, provide a level of complexity that would render this kind of process necessary. However, programmable logic devices (already among the densest circuits on the market) can be used as a ﬁrst approximation of the kind of circuits that will become available in the future. Our loop is then targeted to the implementation of self-replication on this kind of device. To this end, our loop introduces a number of features that are not present in any of the historical self-replicating loops we presented. Most notably, the structure of the loop (that is, the path used by the conﬁguration data) is determined by the sequence of ﬂags in the genome, implying that

structures of almost any shape and size can be constructed and replicated using this algorithm, as long as the loop can be closed and that there is space for the daughter organisms. In practice, this implies that, if the Tom Thumb algorithm is used for the conﬁguration logic of a programmable device, any of its conﬁgurations, and hence any digital circuit, can be made capable of selfreplication. In addition, particular care was given to develop a self-replication algorithm that is efﬁcient (in the sense that it fully exploits the underlying medium, rather than leaving the vast majority of elements inert as past algorithms did), scalable (all the interactions between the

Self-Replication and Cellular Automata

elements are purely local, implying that organisms of any size can be implemented), and amenable to a systematic design process. These features are important requirements for the design of highly complex systems based on either silicon or molecular-scale components. Different Techniques and Environments Von Neumann’s and Langton’s automata share a common basic technique to obtain selfreplication: the construction of the new machine is directed through the interpretation of a description, coded as a sequence of states. In the case of von Neumann, this description (which, in biological terms, is usually identiﬁed as the genome of the artiﬁcial organism) is stored within the memory tape, which is read and interpreted by the universal constructor to build a copy of the machine. In Langton’s case, the description is stored in the mobile data that runs within the sheath of the loop. This mechanism of interpretation, while standard in many approaches, is not however unique: some examples of self-replicating CA exploit a different mechanism, that of self-inspection. In these approaches, instead of reading and interpreting a description, the self-replicating automaton inspects itself and produces a copy of what it ﬁnds. While less general than the universal constructor (obviously, the machine can only build an exact copy of itself), the functionality of this approach is similar to that of Langton’s loop. Indeed, the most representative example of selfinspection is that of a self-replicating loop (Ibanez et al. 1995). A more recent example is a variation of the Tom Thumb algorithm, where selfinspection was used to self-replicate a small processor within a ﬁeld-programmable gate array (Rossier et al. 2006). And while the Tom Thumb algorithm targets in priority silicon-based circuits, other approaches have tried to explore alternative environments that, in some way, might more closely resemble the kind of technologies that will be available in the future. An example is Morita and Imai’s study of self-replication in the context of reversible cellular automata (Morita and Imai 1996) (in a reversible CA, every conﬁguration has at most

257

one predecessor), inspired by reversible logic in digital circuits. Similarly, Peper et al. (2002; Takada et al. 2006) have developed self-replicating structures in Self-Timed Cellular Automata (STCA). This kind of automata do not rely on a global synchronization mechanism to update the states of the cells, but rather the state transitions only occur when triggered by transitions in neighboring cells. The basic assumption in this work is that STCA is a model that might more closely resemble molecular-scale nanoelectronic devices. A ﬁnal example in this context is the threedimensional extension of self-replication, usually based on the assumption that silicon, with its rigidly two-dimensional structure, will 1 day be superseded by a technology that can exploit all three dimensions. In this context, Imai et al. (2002) have extended their reversible approach, with the assumption that reversible logic is more amenable to an extension to three dimensions than conventional logic because of the greatly reduced power dissipation. Stauffer at al. (2004) have also shown that the Data and Signal Cellular Automaton (DSCA) approach, designed to simplify the implementation of CA in digital hardware, can be extended to realize self-replication in three dimensions. The study of self-replicating CA in the context of new technologies holds the promise of 1 day bringing a major contribution to computation. To determine how self-replication might be useful in this context, some attempts have been made at using self-replicating structures for computation. An example of this approach is the work of Chou and Reggia (1998), who use self-replication as a mechanism to obtain massively parallel machines which can potentially be used to solve hard problems (the example used in the paper is the NP-complete problem of satisﬁability). An attempt was also made to perform computation using Tempesti’s loops. In alternative to embedding a complex program, this kind of loops is used to perform computation by interloop communication. Using the collision-based computing paradigm, Petraglio et al. (2002) have shown that it is possible to implement arithmetic operations by passing messages from one loop to

258

another after building a network structure through self-replication. This approach, while valuable from a theoretical standpoint, shares however the same weakness of other loop-based computing approaches in that the poor utilization of resources makes a physical realization of such a system highly impractical. Another problem to be solved for a practical implementation of self-replicating structures is their design: few approaches have attempted to deﬁne a precise methodology to deﬁne and create self-replicating structures. In this context, several researchers have attempted to use evolutionary techniques to ﬁnd automatically self-replicating machines. In this context, the work of Sayama et al. has gone through several iterations (Salzberg et al. 2004; Sayama 1998, 2000) in an attempt to deﬁne loops that evolve through the self-replication process toward “ﬁtter” individuals. Chou and Reggia (1997), on the other hand, use evolution to ﬁnd novel self-replicating structures within a CA, whereas Pan and Reggia (2005) studied the conditions in which selfreplicating structures might spontaneously emerge in a cellular space.

Future Directions Historically, self-replication in cellular automata began as a paradigm to achieve fault tolerance in computing devices. In the following decades, much of the emphasis shifted toward a more “theoretical” approach where self-replication was considered as part of a more general investigation into the application of biologically inspired mechanisms to computing. And while the latter approach remains an active research topic, the original paradigm was somewhat set aside because technology would not allow a practical implementation of self-replication in digital hardware. More recently, however, advances in electronic devices (notably with the introduction of programmable devices or FPGAs), together with emerging technological issues, have rekindled interest in self-replication in a context similar to von Neumann’s original work. In particular, the

Self-Replication and Cellular Automata

drastic device shrinking, low power supply levels, and increasing operating speeds, which accompany the technological evolution of silicon to deeper submicron levels, signiﬁcantly reduce the noise margins and increase the soft-error rates (Various 1999). In addition, the nascent ﬁeld of nanoelectronics holds great promise for the future of computing devices, but introduces extremely high fault rates (e.g., Peper et al. 2004) and complex layout issues. Thus, self-replication is currently attracting a considerable amount of attention for the same reasons that initially pushed von Neumann to investigate it as a possible solution to reliability and layout issues. Fault tolerance and selforganization are thus becoming the focal point of research in the ﬁeld and the features of molecularscale electronics seem to imply that selfreplication at the device level will be an extremely useful paradigm in next-generation devices.

Bibliography Asprey W (1992) John von Neumann and the origins of modern computing. The MIT Press, Cambridge Banks ER (1970) Universality in cellular automata. In: Proceedings of IEEE 11th annual symposium on switching and automata theory, Santa Monica, pp 194–215 Beuchat J-L, Haenni J-O (2000) Von Neumann’s 29-state cellular automaton: a hardware implementation. IEEE Trans Educ 43(3):300–308 Buckley WR, Mukherjee A (2005) Constructability of signal-crossing solutions in von Neumann 29-state cellular automata. In: Proceedings of 2005 international conference on computational science. Lecture notes in computer science, vol 3515. Springer, Berlin, pp 395–403 Burks A (ed) (1970) Essays on cellular automata. University of Illinois Press, Urbana Burks AW, von Neumann J (eds) (1966) The theory of selfreproducing automata. University of Illinois Press, Urbana Byl J (1989) Self-reproduction in small cellular automata. Phys D 34:295–299 Chou H-H, Reggia JA (1997) Emergence of selfreplicating structures in a cellular automata space. Phys D 110(3–4):252–276 Chou H-H, Reggia JA (1998) Problem solving during artiﬁcial selection of self-replicating loops. Phys D 115(3–4):293–312 Codd EF (1968) Cellular automata. Academic, New York

Self-Replication and Cellular Automata Freitas RA Jr, Gilbreath WP (eds) (1980) Advanced automation for space missions. In: Proceedings of 1980 NASA/ASEE summer study, scientiﬁc and technical information branch (available from U.S. G.P.O.), Washington, DC Freitas RA Jr, Merkle RC (2004) Kinematic selfreplicating machines. Landes Bioscience, Georgetown Ibanez J, Anabitarte D, Azpeitia I, Barrera O, Barrutieta A, Blanco H, Echarte F (1995) Self-inspection based reproduction in cellular automata. In: Proceedings of 3rd European conference on artiﬁcial life (ECAL95). Lecture notes in computer science, vol 929. Springer, Berlin, pp 564–576 Imai K, Hori T, Morita K (2002) Self-reproduction in threedimensional reversible cellular space. Artif Life 8(2):155–174 Langton CG (1984) Self-reproduction in cellular automata. Phys D 10:135–144 Lee C (1968) Synthesis of a cellular computer. In: Applied automata theory. Academic, London, pp 217–234 Lohn JD, Reggia JA (1997) Automatic discovery of selfreplicating structures in cellular automata. IEEE Trans Evol Comput 1(3):165–178 Mange D, Sipper M, Stauffer A, Tempesti G (2000) Towards robust integrated circuits: the embryonics approach. Proc IEEE 88(4):516–541 Mange D, Stauffer A, Petraglio E, Tempesti G (2004a) Self-replicating loop with universal construction. Phys D 191:178–192 Mange D, Stauffer A, Peparolo L, Tempesti G (2004b) A macroscopic view of self-replication. Proc IEEE 92(12):1929–1945 Morita K, Imai K (1996) Self-reproduction in a reversible cellular space. Theor Comput Sci 168:337–366 Nehaniv CL (2002) Self-reproduction in asynchronous cellular automata. In: Proceedings of 2002 NASA/DoD conference on evolvable hardware (EH02). IEEE Computer Society, Washington, DC, pp 201–209 Nourai F, Kashef RS (1975) A universal four-state cellular computer. IEEE Trans Comput 24(8):766–776 Pan Z, Reggia J (2005) Evolutionary discovery of arbitrary self-replicating structures. In: Proceedings of 5th international conference on computational science (ICCS 2005) – Part II. Lecture notes in computer science, vol 3515. Springer, Berlin, pp 404–411 Peper F, Isokawa T, Kouda N, Matsui N (2002) Self-timed cellular automata and their computational ability. Futur Gener Comput Syst 18(7):893–904 Peper F, Lee J, Abo F, Isokawa T, Adaki S, Matsui N, Mashiko S (2004) Fault-tolerance in nanocomputers: a cellular array approach. IEEE Trans Nanotechnol 3(1):187–201 Perrier J-Y, Sipper M, Zahnd J (1996) Toward a viable, self-reproducing universal computer. Phys D 97:335–352 Pesavento U (1995) An implementation of von Neumann’s self-reproducing machine. Artif Life 2(4):337–354

259 Petraglio E, Tempesti G, Henry J-M (2002) Arithmetic operations with self-replicating loops. In: Adamatsky A (ed) Collision-based computing. Springer, London, pp 469–490 Reggia JA, Armentrout SA, Chou H-H, Peng Y (1993) Simple systems that exhibit self-directed replication. Science 259:1282–1287 Rossier J, Thoma Y, Mudry PA, Tempesti G (2006) MOVE processors that self-replicate and differentiate. In: Proceedings of 2nd international workshop on biologically-inspired approaches to advanced information technology (Bio-ADIT06). Lecture notes in computer science, vol 3853. Springer, Berlin, pp 328–343 Salzberg C, Antony A, Sayama H (2004) Evolutionary dynamics of cellular automata-based selfreplicators in hostile environments. BioSystems 78:119–134 Sayama H (1998) Introduction of structural dissolution into Langton’s self-reproducing loop. In: Artiﬁcial life VI, proceedings of 6th international conference on artiﬁcial life. MIT Press, Cambridge, pp 114–122 Sayama H (2000) Self-replicating worms that increase structural complexity through gene transmission. In: Artiﬁcial life VII: proceedings of 7th international conference on artiﬁcial life. MIT Press, Cambridge, pp 21–30 Sipper M (1995) Studying artiﬁcial life using a simple, general cellular model. Artif Life 2(1):1–35 Sipper M, Mange D, Stauffer A (1997) Ontogenetic hardware. BioSystems 44:193–207 Stauffer A, Sipper M (2004) The data-and-signals cellular automaton and its application to growing structures. Artif Life 10(4):463–477 Stauffer A, Mange D, Petraglio E, Vannel F (2004) DSCA implementation of 3D self-replicating structures. In: Proceedings of 6th international conference on cellular automata for research and industry (ACRI2004). Lecture notes in computer science, vol 3305. Springer, Berlin, pp 698–708 Takada Y, Isokawa T, Peper F, Matsui N (2006) Universal construction and self-reproduction on selftimed cellular automata. Int J Mod Phys C 17(7):985–1007 Tempesti G (1995) A new self-reproducing cellular automaton capable of construction and computation. In: Proceedings of 3rd European conference on artiﬁcial life. Lecture notes in artiﬁcial intelligence, vol 929. Springer, Berlin, pp 555–563 Tempesti G (1998) A self-repairing multiplexer-based FPGA inspired by biological processes. PhD thesis, Ecole Polytechnique Fédérale de Lausanne (EPFL) Trimberger S (ed) (1994) Field-programmable gate array technology. Kluwer, Boston Various (1999) A D&T roundtable: online test. IEEE Des Test Comput 16(1):80–86 Vitanyi PMB (1973) Sexually reproducing cellular automata. Math Biosci 18:23–54

Gliders in Cellular Automata Carter Bays Department of Computer Science and Engineering, University of South Carolina, Columbia, SC, USA

Article Outline Glossary Deﬁnition of the Subject Introduction Other GL Rules in the Square Grid Why Treat All Neighbors the Same? Gliders in One Dimension Two Dimensional Gliders in Non-square Grids Three and Four Dimensional Gliders Future Directions Bibliography

Glossary Game of life A particular cellular automaton (CA) discovered by John Conway in 1968. Neighbor A neighbor of cell x is typically a cell that is in close proximity to (frequently touching) cell x. Oscillator A periodic shape within a speciﬁc CA rule. Glider A translating oscillator that moves across the grid of a CA. Generation The discrete time unit which depicts the evolution of a CA. Rule Determines how each individual cell within a CA evolves.

Definition of the Subject A cellular automaton is a structure comprising a grid with individual cells that can have two or more states; these cells evolve in discrete time

units and according to a rule, which usually involves neighbors of each cell.

Introduction Although cellular automata has origins dating from the 1950s, interest in that topic was given a boost during the 1980s by the research of Stephan Wolfram, which culminated in 2002 with his publication of the massive tome, “A New Kind of Science” (Wolfram 2002). And widespread popular interest was created when John Conway’s “game of life” cellular automaton was initially revealed to the public in a 1970 Scientiﬁc American article (Gardner 1970). The single feature of his game that probably caused this intensive interest was undoubtedly the discovery of “gliders” (translating oscillators). Not surprisingly, gliders are present in many other cellular automata rules; the purpose of this article is to examine some of these rules and their associated gliders. Cellular automata (CA) can be constructed in one, two, three or more dimensions and can best be explained by giving a two dimensional example. Start with an inﬁnite grid of squares. Each individual square has eight touching neighbors; typically these neighbors are treated the same (a Moore neighborhood), whether they touch a candidate square on a side or at a corner. (An exception is one dimensional CA, where position usually plays a role). We now ﬁll in some of the squares; we shall say that these squares are alive. Discrete time units called generations evolve; at each generation we apply a rule to the current conﬁguration in order to arrive at the conﬁguration for the next generation; in our example we shall use the rule below. (a) If a live cell is touching two or three live cells (called neighbors), then it remains alive next generation, otherwise it dies. (b) If a non-living cell is touching exactly three live cells, it comes to life next generation.

# Springer-Verlag 2009 A. Adamatzky (ed.), Cellular Automata, https://doi.org/10.1007/978-1-4939-8700-9_249 Originally published in R. A. Meyers (ed.), Encyclopedia of Complexity and Systems Science, # Springer-Verlag 2009 https://doi.org/10.1007/978-0-387-30440-3_249

261

262

Gliders in Cellular Automata

Figure 1 depicts the evolution of a simple conﬁguration of ﬁlled-in (live) cells for the above rule. There are many notations for describing CA rules; these can differ depending upon the type of CA. For CA of more than one dimension, and in our present discussion, we shall utilize the following notation, which is standard for describing CA in two dimensions with Moore neighborhoods. Later we shall deal with one dimension. We write a rule as E1,E2, . . . =F1,F2 . . . where the Ei (“environment”) specify the number of live neighbors required to keep a living cell alive, and the Fi (“fertility”) give the number required to bring a non-living cell to life. The Ei and Fi will be listed in ascending order; hence if i > j then Ei > Ej etc. Thus the rule for the CA given above is 2, 3/3. This rule, discovered by John Horton Conway, was examined in several articles in Scientiﬁc American and elsewhere, beginning with the seminal article in 1970 (Gardner 1970). It is popularly known as Conway’s game of life. Of course it is not really a game in the usual sense, as the outcome is determined as soon as we pick a starting conﬁguration. Note that the shape in Fig. 1 repeats, with a period of two. A repeating form such as this is called an oscillator. Stationary forms can be considered oscillators with a period of one. In Figs. 2 and 3 we show several oscillators that move across the grid as they change from generation to generation. Such forms are called translating oscillators, or more commonly, gliders. Conway’s rule popularized the term; in fact a ﬂurry of activity began during which a great many shapes were discovered and exploited. These shapes were named whimsically – “blinker” (Fig. 1), “boat”, “beehive” and an unbelievable myriad of others. Most translating oscillators were given names other than the simple moniker glider – there were “lightweight spaceships”, “puffer trains”, etc. For this article, we shall call all translating oscillators gliders. Of course rule 2, 3/3 is not the only CA rule (even though it is the most interesting).

Gliders in Cellular Automata, Fig. 1 Top: Each cell in a grid has eight neighbors. The cells containing n are neighbors of the cell containing the X. Any cell in the grid can be either dead or alive. Bottom: Here we have outlined a speciﬁc area of what is presumably a much larger grid. At the left we have installed an initial shape. Shaded cells are alive; all others are dead. The number within each cell gives the quantity of live neighbors for that cell. (Cells containing no numbers have zero live neighbors). Depicted are three generations, starting with the conﬁguration at generation one. Generations two then three show the result when we apply the following cellular automata rule: Live cells with exactly two or three live neighbors remain alive (otherwise they die); dead cells with exactly three live neighbors come to life (otherwise they remain dead). Let us now evaluate the transition from generation one to generation two. In our diagram, cell a is dead. Since it does not have exactly three live neighbors, it remains dead. Cell b is alive, but it needs exactly two or three live neighbors to remain alive; since it only has one, it dies. Cell c is dead; since it has exactly three live neighbors, it comes to life. And cell d has two live neighbors; hence it will remain alive. And so on. Notice that the form repeats every two generations. Such forms are called oscillators

Conﬁgurations under some rules always die out, and other rules lead to explosive growth. (We say that rules with expansive growth are unstable). We can easily ﬁnd gliders for many unstable rules; for example Fig. 4 illustrates some simple constructs for rule 2/2. Note that it is practically impossible NOT to create gliders with this rule! Hence we shall only look at gliders for rules that stabilize (i.e. exhibit bounded growth) and eventually yield only zero or more oscillators. We call such rules GL (game of life) rules. Stability can be a rather murky concept, since there may be some carefully constructed forms within a GL rule that grow

Gliders in Cellular Automata

263

Gliders in Cellular Automata, Fig. 2 Here we see a few of the small gliders that exist for 2, 3/2. The form at the top – the original glider – was discovered by John Conway in 1968. The remaining forms were found shortly thereafter. Soon after Conway discovered rule 2, 3/2 he started to give his various shapes rather whimsical names. That practice continues to this day. Hence, the name glider was given

only to the simple shape at the top; the other gliders illustrated were called (from top to bottom) lightweight spaceship, middleweight spaceship and heavyweight spaceship. The numbers give the generation; each of the gliders shown has a period of four. The exact movement of each is depicted by its shifting position in the various small enclosing grids

without bounds. Typically, such forms would never appear in random conﬁgurations. Hence, we shall informally deﬁne a GL rule as follows:

computing time was expensive and computers were slow by today’s standards. He devised a form that spit out a continuous stream of gliders – a “glider gun”, so to speak. Interestingly, his gun conﬁguration was displayed not as nice little squares, but as a rather primitive typewritten output (Fig. 5); this emphasizes the limited resources available in 1970 for seeking out such complex structures. Soon a cottage industry developed – all kinds of intricate initial conﬁgurations were discovered and exploited; such research continues to this day.

• All neighbors must be touching the candidate cell and all are treated the same (a Moore neighborhood). • there must exist at least one translating oscillator (a glider). • Random conﬁgurations must eventually stabilize.

This deﬁnition is a bit simplistic; for a more formal deﬁnition of a GL rule refer to (Bays 2005). Conway’s rule 2, 3/3 is the original GL rule and is unquestionably the most famous CA rule known. A challenge put forth by Conway was to create a conﬁguration that would generate an ever increasing quantity of live cells. This challenge was met by William Gosper in 1970 – back when

Other GL Rules in the Square Grid The rule 2, 4, 5/3 is also a GL rule and sports the glider shown in Fig. 6. It has not been seriously investigated and will probably not reveal the vast array of interesting forms that exist under 2, 3/3. Interestingly, 2, 3/3, 8 appears to be a GL rule which not unsurprisingly supports many of

264

Gliders in Cellular Automata, Fig. 3 The rule 2, 3/2 is rich with oscillators – both stationary and translating (i.e. gliders). Here are but two of many hundreds of gliders that exist under this rule. The top form has a period of ﬁve and the bottom conglomeration, a period of four

the constructs of 2, 3/3. This ability to add terms of high neighbor counts onto known GL rules, obtaining other GL rules, seems to be easy to implement – particularly in higher dimensions or in grids with large neighbor counts such as the triangular grid, which has a neighbor count of 12.

Gliders in Cellular Automata

Gliders in Cellular Automata, Fig. 4 Gliders exist under a large number of rules, but almost all such rules are unstable. For example the rule 2/2 exhibits rapid unbounded growth, and almost any starting conﬁguration will yield gliders; e.g. just two live cells will produce two gliders going off in opposite directions. But almost any small form will quickly grow without bounds. The form at the bottom left expands to the shape at the right after only 10 generations. The generation is given with each form

anywhere, but state in our rule that two or more live neighbors of a subject cell must not touch each other, etc. But here we are only exploring gliders. Consider the following rule for ﬁnding the next generation. 1. A living cell dies. 2. A dead cell comes to life if and only if its left side touches a live cell.

Why Treat All Neighbors the Same? By allowing only Moore neighborhoods in two (and higher) dimensions we greatly restrict the number of rules that can be written. And certainly we could consider specialized neighborhoods – e.g. treat as neighbors only those cells that touch on sides, or touch only the left two corners and nowhere else, or touch

If we start, say, with a single cell we will obtain a glider of one cell that moves to the right one cell each generation! Such rules are easy to construct, as are more complex gliderproducing positional rules. So we shall not investigate them further. Yet as we shall see, the neighbor position is an important consideration in one dimensional CA.

Gliders in Cellular Automata

265

Gliders in Cellular Automata, Fig. 6 There are a large number of interesting rules that can be written for the square grid and Rule 2, 3/2 is undoubtedly the most fascinating – but it is not the only GL rule. Here we depict a glider that has been found for the rule 2, 4, 5/3. And since that rule stabilizes, it is a valid GL rule. Unfortunately it is not as interesting as 2, 3/2 because its glider is not as likely to appear in random (and other) conﬁgurations – hence limiting the ability of 2, 4, 5/3 to produce interesting moving conﬁgurations. Note that the period is seven, indicated in parentheses Gliders in Cellular Automata, Fig. 5 A fascinating challenge was proposed by Conway in 1970 – he offered $50 to the ﬁrst person who could devise a form for 2, 3/2 that would generate an inﬁnite number of living cells. One such form could be a glider gun – a construct that would create an endless stream of gliders. The challenge was soon met by William Gosper, then a student at MIT. His glider gun is illustrated here. At the top, testifying to the primitive computational power of the time, is an early illustration of Gosper’s gun. At the bottom we see the gun in action, sending out a new glider every thirty generations (here it has sent out two gliders). Since 1970 there have been numerous such guns that generate all kinds of forms – some gliders and some stationary oscillators. Naturally in the latter case the generator must translate across the grid, leaving its intended stationary debris behind

Gliders in One Dimension One dimensional cellular automata differ from CA in higher dimensions in that the restrictive grid (essentially a single line of cells) limits the number of rules that can be applied. Hence, many 1D CA involve neighborhoods that extend beyond the immediate two touching neighbors of a cell whose next generation status we wish to evaluate. Or more than the two states (alive, dead) may be utilized. For our discussion about gliders, we shall only look at the simplest rules – those involving just the two adjacent neighbors and two

Gliders in Cellular Automata, Fig. 7 The one dimensional rules six and 110 are depicted by the diagram shown. There are eight possible states involving a center cell and its two immediate neighbors. The next generation state for the center cell depends upon the current conﬁguration; each possible current state is given. The rule is speciﬁed by the binary number depicted by the next generation state of the center cell, This notation is standard for the simplest 1D CA and was introduced by Wolfram (see Wolfram 2002), who also converts the binary representation to its decimal equivalent. There are 256 possible rules, but most are not as interesting as rule 110. Rule six is one of many that generate nothing but gliders (see Fig. 8)

states. Unlike 2D (and higher) dimensions, we usually consider the relative position of the neighbors when giving a rule. Since three cells (center, left, right) are involved in determining the state for

266

Gliders in Cellular Automata, Fig. 8 Rule six (along with many others) creates nothing but gliders. At the upper left, we have several generations starting with a single live cell (top). (For 1D CA each successive generation moves vertically down one level on the page.) At the lower left is an enlargement of the ﬁrst few generations. By following the diagram for rule six in Fig. 7, the reader can see exactly how this conﬁguration evolves. At the top right, we start with a random conﬁguration; at the lower right we have enlarged the small area directly under the large dot. Very quickly, all initial random conﬁgurations lead solely to gliders heading west

Gliders in Cellular Automata

Gliders in Cellular Automata, Fig. 10 Rule 110 at generations 2000–2500. The structures that move vertically are stationary oscillators; slanted structures can be considered gliders. Unlike higher dimensions, where gliders move in an unobstructed grid with no other live cells in the immediate vicinity, many 1D gliders reside in an environment of oscillating cells (the background pattern). The black square outlines an area depicted in the next ﬁgure

Gliders in Cellular Automata, Fig. 9 Evolution of rule 110 for the ﬁrst 500 generations, given a random starting conﬁguration. With 1D CA, we can depict a great many generations on a 2D display screen

the next generation of the central cell, we have 23 = 8 possible initial states, with each state leading to a particular outcome. And since each initial state causes a particular outcome (i.e. the cell in the middle lives or dies next generation) we thus we have 28 possible rules. The behavior of these 256 rules has been extensively studied by Wolfram (2002) who also introduced a very convenient shorthand that completely describes each rule (Fig. 7). As we add to the complexity of deﬁning 1D CA we greatly increase the number of possible rules. For example, just by having three states

Gliders in Cellular Automata, Fig. 11 An area from the previous ﬁgure enlarged. One can carefully trace the evolution from one generation to the next. The background pattern repeats every seven generations

instead of two, we note that now, instead of 23 possible initial states, there are 33 (Fig. 12). This leads to 27 possible initial states, and we now can create 327 unique rules – more than six trillion! Wolfram observed that even with more complex 1D rules, the fundamental behavior for

Gliders in Cellular Automata

267

Gliders in Cellular Automata, Fig. 12 There are 27 possible conﬁgurations when we have three states instead of two. Each conﬁguration would yield some speciﬁc outcome as in Fig. 7; thus there would be three possible outcomes for each state, and hence 327 distinct rules

Gliders in Cellular Automata, Fig. 14 Most of the known GL rules and their gliders are illustrated. The period for each is given in parentheses

Gliders in Cellular Automata, Fig. 13 Each cell in the triangular grid has 12 touching neighbors. The subject central cells can have two orientations, E and O

Gliders in Cellular Automata, Fig. 15 The small 2, 7, 8/3 glider is shown. This glider also exists for the GL rule 2, 7/3. The small horizontal dash is for positional reference

268

Gliders in Cellular Automata, Fig. 16 Here we depict the large 2, 7, 8/3 glider. Perhaps ﬂamboyant would be a better description, for this glider spews out much debris as it moves along. It has a period of 80 and its exact motion can be traced by observing its position relative to the black dot. Note that the debris tossed behind does not interfere with the 81st generation, where the entire process repeats 12 cells to the right. By carefully positioning two of these gliders, one can (without too much effort) construct a situation where the debris from both gliders interacts in a manner that produces another glider. This was the method used to discover the two guns illustrated in Figs. 17 and 18

all rules is typiﬁed by the simplest rules (Wolfram 2002). Gliders in 1D CA are very common (Figs. 8 and 9) but true GL rules are not, because most gliders for stable rules exist against a uniform patterned background (Figs. 9, 10, 11 and 12) instead of a grid of non-living cells.

Two Dimensional Gliders in Non-square Grids Although most 2D CA research involves a square grid, the triangular tessellation has been investigated somewhat. Here we have 12 touching neighbors; as with the square grid, they are all treated equally (Fig. 13). The increased number of neighbors allows for the possibility of more GL rules (and hence several gliders). Figure 14 shows many of

Gliders in Cellular Automata

Gliders in Cellular Automata, Fig. 17 The GL rule 2, 7, 8/3 is of special interest in that it is the only known GL rule besides Conway’s rule that supports glider guns – conﬁgurations that spew out an endless stream of gliders. In fact, there are probably several such conﬁgurations under that rule. Here we illustrate two guns; the top one generates period 18 (small) gliders and the bottom one creates period 80 (large) gliders. Unlike Gosper’s 2, 3/3 gun, these guns translate across the grid in the direction indicated. In keeping with the fanciful jargon for names, translating glider guns are also called “rakes”

these gliders and their various GL rules. The GL rule 2, 7, 8/3 supports two rather unusual gliders (Figs. 15 and 16) and to date is the only known GL rule other than Conway’s original 2, 3/3 game of life that exhibits glider guns. Figure 17 shows starting conﬁgurations for two of these guns and Fig. 18 exhibits evolution of the two guns after 800 generations. Due to the extremely unusual behavior of the period 80 2, 7, 8/3 glider (Fig. 16), it is highly likely that other guns exist. The hexagonal grid supports the GL rule 3/2, along with GL rules 3, 5/2, 3, 5, 6/2 and 3, 6/2, which all behave in a manner very similar to 3/2. The glider for these three rules is shown in

Gliders in Cellular Automata

Gliders in Cellular Automata, Fig. 18 After 800 generations, the two guns from Fig. 17 will have produced the output shown. Motion is in the direction given by the arrows. The gun at the left yields period 18 gliders, one every 80 generations, and the gun at the right produces a period 80 glider every 160 generations

Fig. 19. It is possible that no other distinct hexagonal GL rules exist, because with only six touching neighbors, the set of interesting rules is quite limited. Moreover the fertility portion of the rule must start with two and rules of the form */2, 3 are unstable. Thus, any other hexagonal GL rules must be of the form */2, 4, */2, 4, 5, etc. (i.e. only seven other fertility combinations). A valid GL rule has also been found for at least one pentagonal grid (Fig. 19). Since there are several topologically unique pentagonal tessellations (see Sugimoto and Ogawa 2000), probably other pentagonal gliders will be found, especially when all the variants of the pentagonal grid are investigated.

Three and Four Dimensional Gliders In 1987, the ﬁrst GL rules in three dimensions were discovered (Bays 1987a; Dewdney 1987). The initially found gliders and their rules are

269

Gliders in Cellular Automata, Fig. 19 GL rules are supported in pentagonal and hexagonal grids. The pentagonal grid (left) is called the Cairo Tiling, supposedly named after some paving tiles in that city. There are many different topologically distinct pentagonal grids; the Cairo Tiling is but one. At the right are gliders for the hexagonal rules 3/2 and 3/2, 4, 5. The 3/2 glider also works for 3, 5/2, 3, 5, 6/2 and 3, 6/2. All four of these rules are GL rules. The rule 3/2, 4, 5 is unfortunately disqualiﬁed (barely) as a GL rule because very large random blobs will grow without bounds. The periods of each glider are given in parentheses

depicted in Fig. 20. It turns out that the 2D rule 2, 3/3 is in many ways contained in the 3D GL rule 5, 6, 7/6. (Note the similarity between the glider at the bottom of Fig. 20 and at the top of Fig. 20). During the ensuing years, several other 3D gliders were found (Figs. 21 and 22). Most of these gliders were unveiled by employing random but symmetric small initial conﬁgurations. The large number of live cells in these 3D gliders implies that they are uncommon random occurrences in their respective GL rules; hence it is highly improbable that the plethora of interesting forms (e.g. glider guns) such as those for 2D rule 2, 3/3 exist in three dimensions. The 3D grid of dense packed spheres has also been investigated somewhat; here each sphere touches exactly 12 neighbors. What is pleasing about this conﬁguration is that each neighbor is identical in the manner that it touches the subject cell, unlike the square and cubic grids, where some neighbors touch on their sides and others at their corners. The gliders for spherical rule 3/3 are shown in Fig. 23. This rule is a borderline GL rule, as random ﬁnite conﬁgurations appear to stabilize, but inﬁnite ones apparently do not.

270

Gliders in Cellular Automata

Gliders in Cellular Automata, Fig. 20 The ﬁrst three dimensional GL rules were found in 1987; these are the original gliders that were discovered. The rule 5, 6, 7/6 is analogous to the 2D rule 2, 3/3 (see Bays 1987a). Note the similarity between this glider and the one at the top of Fig. 2

Gliders in Cellular Automata, Fig. 21 Several more 3D GL rules were discovered between 1990–1994. They are illustrated here. The 8/5 gliders were originally investigated under the rule 6, 7, 8/5

Future Directions Gliders are an important by-product of many cellular automata rules. They have made possible the construction of extremely complicated

forms – most notably within the universe of Conway’s rule, 2, 3/3. (Figs. 24 and 25 illustrate a remarkable example of this complexity). Needless to say many questions remain unanswered. Can a glider gun be constructed for some three

Gliders in Cellular Automata

271

Gliders in Cellular Automata, Fig. 22 By 2004, computational speed had greatly increased, so another effort was made to ﬁnd 3D gliders under GL rules; these latest discoveries are illustrated here

Gliders in Cellular Automata, Fig. 23 Some work has been done with the 3D grid of dense packed spheres. Two gliders have been discovered for the rule 3/3, which almost qualiﬁes as a GL rule

272

Gliders in Cellular Automata

Gliders in Cellular Automata, Fig. 24 The discovery of the glider in 2, 3/3, along with the development of several glider guns, has made possible the construction of many extremely complex forms. Here we see a Turing machine, developed in 2001 by Paul Rendell. Figure 25 enlarges a small portion of this structure

Gliders in Cellular Automata, Fig. 25 We have enlarged a tiny portion at the upper left of the Turing machine shown in Fig. 24. One can see the complex interplay of gliders, glider guns, and various other stabilizing forms

dimensional rule? This would most likely be rule 5, 6, 7/6, which is the three dimensional analog of 2, 3/3 (Dewdney 1987), but so far no example has been found.

The area of cellular automata research is moreor-less in its infancy – especially when we look beyond the square grid. Even higher dimensions have been given a glance; Fig. 26 shows just one

Gliders in Cellular Automata

273

Gliders in Cellular Automata, Fig. 26 Some work (not much) has been done in four dimensions. Here is an example of a glider for the GL rule 11, 12/12, 13. Many more 4D gliders exist

of several gliders that are known to exist in four dimensions. Since each cell has 80 touching neighbors, it will come as no surprise that there are a large number of 4D GL rules. But there remains much work do be done in lower dimensions as well. Consider simple one dimensional cellular automata with four possible states. It will be a long time before all 1038 possible rules have been investigated!

Bibliography Bays C (1987a) Candidates for the game of life in three dimensions. Complex Syst 1:373–400 Bays C (1987b) Patterns for simple cellular automata in a universe of dense packed spheres. Complex Syst 1:853–875

Bays C (1994a) Cellular automata in the triangular tessellation. Complex Syst 8:127–150 Bays C (1994b) Further notes on the game of three dimensional life. Complex Syst 8:67–73 Bays C (2005) A note on the game of life in hexagonal and pentagonal tessellations. Complex Syst 15:245–252 Bays C (2007) The discovery of glider guns in a game of life for the triangular tessellation. J Cell Autom 2(4):345–350 Dewdney AK (1987) The game life acquires some successors in three dimensions. Sci Am 286:16–22 Gardner M (1970) The fantastic combinations of John Conway’s new solitaire game ‘life’. Sci Am 223:120–123 Preston K Jr, Duff MJB (1984) Modern cellular automata. Plenum Press, New York Sugimoto T, Ogawa T (2000) Tiling problem of convex pentagon[s]. Forma 15:75–79 Wolfram S (2002) A new kind of science. Wolfram Media, Champaign

Basins of Attraction of Cellular Automata and Discrete Dynamical Networks Andrew Wuensche Discrete Dynamics Lab, London, UK

Article Outline Glossary Deﬁnition of the Subject Introduction Basins of Attraction in CA Memory and Learning Modeling Neural Networks Modeling Genetic Regulatory Networks Future Directions References

Glossary Attractor, basin of attraction, subtree The terms “attractor” and “basin of attraction” are borrowed from continuous dynamical systems. In this context the attractor signiﬁes the repetitive cycle of states into which the system will settle. The basin of attraction in convergent (injective) dynamics includes the transient states that ﬂow to an attractor as well as the attractor itself, where each state has one successor but possibly zero or more predecessors (pre-images). Convergent dynamics implies a topology of trees rooted on the attractor cycle, though the cycle can have a period of just one, a point attractor. Part of a tree is a subtree deﬁned by its root and number of levels. These mathematical objects may be referred to in general as “attractor basins.” Basin of attraction ﬁeld One or more basins of attraction comprising all of state-space. Cellular automata, CA Although CA are often treated as having inﬁnite size, we are dealing

here with ﬁnite CA, which usually consist of “cells” arranged in a regular lattice (1D, 2D, 3D) with periodic boundary conditions, making a ring in 1D and a torus in 2D (“null” and other boundary conditions may also apply). Each cell updates its value (usually in parallel, synchronously) as a function of the values of its close local neighbors. Updating across the lattice occurs in discrete time-steps. CA have one homogeneous function, the “rule,” applied to a homogeneous neighborhood template. However, many of these constraints can be relaxed. Discrete dynamical networks Relaxing RBN constraints by allowing a value range that is greater than binary, v 2, heterogeneous k, and a rule-mix. Garden-of-Eden state A state having no preimages, also called a leaf state. Pre-images A state’s immediate predecessors. Random Boolean networks, RBN Relaxing CA constraints, where each cell can have a different, random (possibly biased) nonlocal neighborhood or put another way random wiring of k inputs (but possibly with heterogeneous k) and heterogeneous rules (a rule-mix) but possibly just one rule, or a bias of rule types. Random maps, MAP Directed graphs with outdegree one, where each state in state-space is assigned a successor, possibly at random, or with some bias, or according to a dynamical system. CA, RBN, and DDN, which are usually sparsely connected (k n), are all special cases of random maps. Random maps make a basin of attraction ﬁeld, by deﬁnition. Reverse algorithms Computer algorithms for generating the pre-images of a network state. The information is applied to generate state transition graphs (attractor basins) according to a graphical convention. The software DDLab, applied here, utilizes three different reverse algorithms. The ﬁrst two generate pre-images directly so are more efﬁcient than the exhaustive method, allowing greater system size.

# Springer Science+Business Media LLC, part of Springer Nature 2018 A. Adamatzky (ed.), Cellular Automata, https://doi.org/10.1007/978-1-4939-8700-9_674 Originally published in R. A. Meyers (ed.), Encyclopedia of Complexity and Systems Science, # Springer Science+Business Media LLC 2017 https://doi.org/10.1007/978-3-642-27737-5_674-1

275

276

Basins of Attraction of Cellular Automata and Discrete Dynamical Networks

• An algorithm for local 1D wiring (Wuensche and Lesser 1992) – 1D CA but rules can be heterogeneous. • A general algorithm (Wuensche 1994a) for RBN, DDN, and 2D or 3D CA, which also works for the above. • An exhaustive algorithm that works for any of the above by creating a list of “exhaustive pairs” from forward dynamics. Alternatively, a random list of exhaustive pairs can be created to implement attractor basin of a “random map.” Space-time pattern A time sequence of states from an initial state driven by the dynamics, making a trajectory. For 1D systems this is usually represented as a succession of horizontal value strings from the top down or scrolling down the screen. State transition graph A graph representing attractor basins consisting of directed arcs linking nodes, representing single time-steps linking states, with a topology of trees rooted on attractor cycles, where the direction of time is inward from garden-of-Eden states toward the attractor. Various graphical conventions determine the presentation. The terms “state transition graph” and various types of “attractor basins” may be used interchangeably. State-space The set of unique states in a ﬁnite and discrete system. For a system of size n, and value range v, the size of state-space S = Vn.

Definition of the Subject Basins of attraction of cellular automata and discrete dynamical networks link state-space according to deterministic transitions, giving a topology of trees rooted on attractor cycles. Applying reverse algorithms, basins of attraction can be computed and drawn automatically. They provide insights and applications beyond single trajectories, including notions of order, complexity, chaos, self-organization, mutation, the genotype-phenotype, encryption, contentaddressable memory, learning, and gene regulation. Attractor basins are interesting as mathematical objects in their own right.

Introduction The Global Dynamics of Cellular Automata (Wuensche and Lesser 1992) published in 1992 introduced a reverse algorithm for computing the pre-images (predecessors) of states for ﬁnite 1D binary cellular automata (CA) with periodic boundaries. This made it possible to reveal the precise graph of “basins of attraction” – state transition graphs – states linked into trees rooted on attractor cycles, which could be computed and drawn automatically as in Fig. 1. The book included an atlas for two entire categories of CA rule-space, the three-neighbor “elementary” rules and the ﬁve-neighbor totalistic rules (Fig. 2). In 1993, a different reverse algorithm was invented (Wuensche 1994b) for the pre-images and basins of attraction of random Boolean networks (RBN) (Fig. 15) just in time to make the cover of Kauffman’s seminal book (Kauffman 1993) The Origins of Order (Fig. 3). The RBN algorithm was later generalized for “discrete dynamical networks” (DDN) described in Exploring Discrete Dynamics (Wuensche 2016). The algorithms, implemented in the software DDLab (Wuensche 1993), compute pre-images directly, and basins of attraction are drawn automatically following ﬂexible graphic conventions. There is also an exhaustive “random map” algorithm limited to small systems and a statistical method for dealing with large systems. A more general algorithm can apply to a less general system (MAP ! DDN ! RBN ! CA) for a reality check. The idea of subtrees, basins of attraction, and the entire “basin of attraction ﬁeld” imposed on state-space is set out in Fig. 4. The dynamical systems considered in this chapter, whether CA, RBN, or DDN, comprise a ﬁnite set of n elements with discrete values v, connected by directed links – the wiring scheme. Each element updates its value synchronously, in discrete time-steps, according to a logical rule applied to its k inputs or a lookup table giving the output of vk possible input patterns. CA form a special subset with a universal rule and a regular lattice with periodic boundaries, created by wiring from a homogeneous local neighborhood, an architecture that can support emergent complex

Basins of Attraction of Cellular Automata and Discrete Dynamical Networks

277

see detail

Basins of Attraction of Cellular Automata and Discrete Dynamical Networks, Fig. 1 Top: The basin of attraction ﬁeld of a 1D binary CA, k = 7, n = 16 (Wuensche 1999). The 216 states in state-space are connected into 89 basins of attraction; only the

11 nonequivalent basins are shown, with symmetries characteristic of CA (Wuensche and Lesser 1992). Time ﬂows inward and then clockwise at the attractor. Below: A detail of the second basin, where states are shown as 4 4 bit patterns

structure, interacting gliders, glider guns, and universal computation (Conway 1982; Gomez-Soto and Wuensche 2015; Wuensche 1994a, 1999; Wuensche and Adamatzky 2006). Langton (Langton 1990) has aptly described CA as “a discretized artiﬁcial universe with its own local physics.”

Classical RBN (Kauffman 1969) have binary values and homogeneous k, but “random” rules and wiring, applied in modeling gene regulatory networks. DDN provide a further generalization allowing values greater than binary and heterogeneous k, giving insights into content-addressable memory and learning (Wuensche 1997). There are

278

Basins of Attraction of Cellular Automata and Discrete Dynamical Networks

Basins of Attraction of Cellular Automata and Discrete Dynamical Networks, Fig. 2 Space-time pattern for the same CA as in Fig. 1 but for a much larger system

(n = 700). About 200 time-steps from a random initial state. Space is across and time is down. Cells are colored according to neighborhood lookup instead of the value

Basins of Attraction of Cellular Automata and Discrete Dynamical Networks, Fig. 3 The front covers of Wuensche and Lesser’s (1992) The Global Dynamics of Cellular Automata (Wuensche and Lesser 1992),

Kauffman’s (1993) The Origins of Order (Kauffman 1993), and Wuensche’s (2016) Exploring Discrete Dynamics 2nd Ed (Wuensche 2016)

countless variations, intermediate architectures, and hybrid systems, between CA and DDN. These systems can also be seen as instances of “random maps with out-degree one” (MAP) (Wuensche 1997, 2016), a list of “exhaustive pairs” where each state in state-space is assigned a random successor, possibly with some bias. All these systems reorganize state-space into basins of attraction. Running a CA, RBN, or DDN backward in time to trace all possible branching ancestors opens up new perspectives on dynamics. A forward “trajectory” from some initial state can be placed in the context of the “basin of attraction ﬁeld” which sums up the ﬂow in statespace leading to attractors. The earliest reference

I have found to the concept is Ross Ashby’s “kinematic map” (Ashby 1956). For a binary network size n, an example of one of its states B might be 1010 . . . 0110. State-space is made up of all S = 2n states (S = vn for multivalue) – the space of all possible bitstrings or patterns. Part of a trajectory in state-space, where C is a successor of B and A is a pre-image of B, according to the dynamics of the network. The state B may have other pre-images besides A; the total number is the in-degree. The pre-image states may have their own pre-images or none. States without preimages are known as garden-of-Eden or leaf states.

Basins of Attraction of Cellular Automata and Discrete Dynamical Networks

Basins of Attraction of Cellular Automata and Discrete Dynamical Networks, Fig. 4 The idea of subtrees, basins of attraction, and the entire “basin of attraction ﬁeld” imposed on state-space by a discrete dynamical network

Any trajectory must sooner or later encounter a state that occurred previously – it has entered an attractor cycle. The trajectory leading to the attractor is a transient. The period of the attractor is the number of states in its cycle, which may be just one – a point attractor. Take a state on the attractor, ﬁnd its pre-images (excluding the pre-image on the attractor). Now ﬁnd the pre-images of each pre-image, and so on, until all leaf states are reached. The graph of linked states is a transient tree rooted on the attractor state. Part of the transient tree is a subtree deﬁned by its root. Construct each transient tree (if any) from each attractor state. The complete graph is the basin of attraction. Some basins of attraction have no transient trees, just the bare “attractor.”

279

Now ﬁnd every attractor cycle in state-space and construct its basin of attraction. This is the basin of attraction ﬁeld containing all 2n states in state-space but now linked according to the dynamics of the network. Each discrete dynamical network imposes a particular basin of attraction ﬁeld on state-space. The term “basins of attraction” is borrowed from continuous dynamical systems, where attractors partition phase-space. Continuous and discrete dynamics share analogous concepts – ﬁxed points, limit cycles, and sensitivity to initial conditions. The separatrix between basins has some afﬁnity to unreachable (garden-of-Eden) leaf states. The spread of a local patch of transients measured by the Lyapunov exponent has its analog in the degree of convergence or bushiness of subtrees. However, there are also notable differences. For example, in discrete systems trajectories are able to merge outside the attractor, so a subpartition or sub-category is made by the root of each subtree, as well as by attractors. The various parameters and measures of basins of attraction in discrete dynamics are summarized in the remainder of this chapter. (This review is based on the author’s prior publications (Wuensche and Lesser 1992) to (Wuensche 1993) and especially (Wuensche 2010)) together with some insights and applications, ﬁrstly for CA and then for RBN/DDN.

Basins of Attraction in CA Notions of order, complexity, and chaos, evident in the space-time patterns of single trajectories, either subjectively (Fig. 6) or by the variability of input entropy (Figs. 7 and 10), relate to the topology of basins of attraction (Fig. 5). For order, subtrees and attractors are short and bushy. For chaos, subtrees and attractors are long and sparsely branching (Fig. 12). It follows that leaf density for order is high because each forward time-step abandons many states in the past, and unreachable by further forward dynamics – for chaos the opposite is true, with very few states abandoned.

280

Basins of Attraction of Cellular Automata and Discrete Dynamical Networks

Basins of Attraction of Cellular Automata and Discrete Dynamical Networks, Fig. 5 Three basins of attraction with contrasting topology, n = 15, k = 3, for CA rules 250, 110, and 30. One complete set of equivalent trees is shown in each case, and just the nodes of

unreachable leaf states. The topology varies from very bushy to sparsely branching, with measures such as leaf density, transient length, and in-degree distribution predicted by the rule’s Z-parameter

This general law of convergence in the dynamical ﬂow applies for DDN as well as CA, but for CA it can be predicted from the rule itself by its Z-parameter (Fig. 8), the probability that the next unknown cell in a pre-image can be derived unambiguously by the CA reverse algorithm (Wuensche and Lesser 1992; Wuensche 1994a, 1999). As Z is tuned from 0 to 1, dynamics shift from order to chaos (Fig. 8), with transient/attractor length (Fig. 5), leaf density (Fig. 9), and the in-degree frequency histogram (Wuensche 1999, 2016) providing measures of convergence (Fig. 10).

on basins of attraction. The “rotational symmetry” is the maximum number of repeating segments s into which the ring can be divided. The size of a repeating segment g is the minimum number of cells through which the circular array can be rotated and still appear identical. The array size n = s g. For uniform states (i.e., 000000. . .) s = n and g = 1. If n is prime, for any nonuniform state s = 1 and g = n. It was shown in (Wuensche and Lesser 1992) that s cannot decrease, may only increase in a transient, and must remain constant on the attractor. So uniform states must occur later in time than any other state – close to or on the attractor, followed by states consisting of repeating pairs (i.e., 010101. . . where g = 2), repeating triplets, and so on. It follows that each state is part of a set

CA Rotational Symmetry CA with periodic boundary conditions, a circular array in 1D (or a torus in 2D), impose restrictions and symmetries on dynamical behavior and thus

Basins of Attraction of Cellular Automata and Discrete Dynamical Networks

of g equivalent states, which make equivalent subtrees and basins of attraction (Wuensche and Lesser 1992; Wuensche 2016, 1993). This allows the automatic regeneration of subtrees once a prototype subtree has been computed and the “compression” of basins – showing just the nonequivalent prototypes, (Fig. 1).

←————- 1D space ———-→ rule 250 rule 110 time steps ↓ rule 30

281

CA Equivalence Classes Binary CA rules fall into equivalence classes (Walker and Ashby 1966; Wuensche and Lesser 1992) consisting of a maximum of four rules, whereby every rule R can be transformed into its “negative” Rn, its “reﬂection” Rr, and its “negative/reﬂection” Rnr. Rules in an equivalence class have equivalent dynamics, thus basins of attraction. For example, the 256 k3 “elementary rules” fall into 88 equivalence classes whose description sufﬁces to characterize rule-space, and there is a further collapse to 48 “rule clusters” by a complimentary transformation (Fig. 11). Equivalence classes can be combined with their compliments to make “rule clusters” which share many measures and properties (Wuensche and Lesser 1992), including the Z-parameter, leaf density, and Derrida plot. Likewise, the 64 k5 totalistic rules fall into 36 equivalence classes.

Basins of Attraction of Cellular Automata and Discrete Dynamical Networks, Fig. 6 1D space-time patterns of the k = 3 rules in Fig. 5, characteristic of order, complexity, and chaos. System size n = 100 with periodic boundaries. The same random initial state was used in each case. A space-time pattern is just one path through a basin of attraction

CA Glider Interaction and Basins of Attraction Of exceptional interest in the study of CA is the phenomenon of complex dynamics. Selforganization and emergence of stable and mobile interacting particles, gliders, and glider guns enables universal computation at the “edge of

Basins of Attraction of Cellular Automata and Discrete Dynamical Networks, Fig. 7 Left: The space-time patterns of a 1D complex CA, n = 150 about 200 timesteps. Right: A snapshot of the input frequency histogram measured over a moving window of 10 time-steps. Center: The changing entropy of the histogram, its variability

providing a nonsubjective measure to discriminate between ordered, complex, and chaotic rules automatically. High variability implies complex dynamics. This measure is used to automatically categorize rule-space (Wuensche 1999, 2016) (Fig. 10)

282

Basins of Attraction of Cellular Automata and Discrete Dynamical Networks

chaos” (Langton 1990). Notable examples studied for their particle collision logic are the 2D “game-of-life” (Conway 1982), the elementary rule 110 (Cook 2004), and the hexagonal threevalue spiral-rule (Wuensche and Adamatzky 2006). More recently discovered is the 2D binary X-rule and its offshoots (Gomez-Soto and Wuensche 2015, 2016). Here we will simply comment on complex dynamics seen from a basin of attraction perspective (Domain and Gutowitz 1997; Wuensche 1994a), where basin topology and the various measures such as leaf density, in-degree 0 ←——- Z-parameter ——-→ 1 max ←—- convergence —-→ min

Basins of Attraction of Cellular Automata and Discrete Dynamical Networks, Fig. 8 A view of CA rulespace, after Langton (Langton 1990). Tuning the Z-parameter from 0 to 1 shifts the dynamics from maximum to minimum convergence, from order to chaos, traversing a phase transition where complexity lurks. The chain-rules on the right are maximally chaotic and have the very least convergence, decreasing with system size, making them suitable for dynamical encryption.

Basins of Attraction of Cellular Automata and Discrete Dynamical Networks, Fig. 9 Leaf (garden-ofEden) density plotted against system size n, for four typical CA rules, reﬂecting convergence which is predicted by the

distribution, and the Z-parameter are intermediate between order and chaos. Disordered states, before the emergence of particles and their backgrounds, make up leaf states or short dead-end side branches along the length of long transients where particle interactions are progressing. States dominated by particles and their backgrounds are special, a small sub-category of state-space. They constitute the glider interaction phase, making up the main lines of ﬂow within long transients. Gliders in their interaction phase can be regarded as competing sub-attractors. Finally, states made up solely periodic glider interactions, noninteracting gliders, or domains free of gliders must cycle and therefore constitute the relatively short attractors. Information Hiding within Chaos State-space by deﬁnition includes every possible piece of information encoded within the size of the CA lattice — including Shakespeare’s sonnets, copies of the Mona Lisa, and one’s own thumb print, but mostly disorder. A CA rule organizes state-space into basins of attraction where each state has its speciﬁc location and where states on the same transient are linked by forward timesteps, so the statement “state B = A + x timesteps” is legitimate. But the reverse “state A = B x” is usually not legitimate because backward trajectories will branch by the

Z-parameter. Only the maximally chaotic chain-rules show a decrease. The measures are for the basin of attraction ﬁeld, so for the entire state-space. k = 5, n = 10–20

Basins of Attraction of Cellular Automata and Discrete Dynamical Networks

283

chaotic rules

frequency

ordered rules complex rules

n ea py m tro en

Entropy variability Order

Complexity

Mean entropy

Low

Medium

Chaos High

Entropy variability

Low

High

Low

Basins of Attraction of Cellular Automata and Discrete Dynamical Networks, Fig. 10 Scatterplot of a sample of 15,800 2D hexagonal CA rules (v = 3, k = 6), plotting mean entropy against entropy variability (Wuensche 1999, 2016), which classiﬁes rules between

ordered, complex, and chaotic. The vertical axis shows the frequency of rules at positions on the plot – most are chaotic. The plot automatically classiﬁes rule-space as mentioned in the ﬁgure

Basins of Attraction of Cellular Automata and Discrete Dynamical Networks, Fig. 11 Graphical representation of rule clusters of the v2k3 “elementary” rules and examples, taken from (Wuensche and Lesser 1992), where it is shown that the 256 rules in rule-space break down into 88 equivalence classes and 48 clusters. The rule

cluster is depicted as two complimentary sets of four equivalent rules at the corners of a box – with negative, reﬂection, and complimentary transformation links on the x, y, z edges, but these edges may also collapse due to identities between a rule and its transformation

in-degree at each backward step, and the correct branch must be selected. More importantly, most states are leaf states without pre-images, or close to the leaves, so for these states “x” time-steps would not exist.

In-degree, convergence in the dynamical ﬂow, can be predicted from the CA rule itself by its Z-parameter, the probability that the next unknown cell in a pre-image can be derived unambiguously by the CA reverse algorithm

284

Basins of Attraction of Cellular Automata and Discrete Dynamical Networks

(Wuensche and Lesser 1992; Wuensche 1994a, 1999). This is computed in two directions, Zleft and Zright, with the higher value taken as Z. As Z is tuned from 0 to 1, dynamics shift from order to chaos (Fig. 8), with leaf density, a good measure of convergence, decreasing (Figs. 5 and 9). As the system size increases, convergence increases for ordered rules, at a slower rate for complex rules, and remains steady for chaotic rules which make up most of rule-space (Fig. 10). However, there is a class of maximally chaotic “chain” rules where Zleft XOR Zright equals 1, where convergence and leaf density decrease with system size n (Fig. 9). As n increases, in-degrees 2, and leaf density, become increasingly rare (Fig. 12) and vanishingly small in the limit. For large n, for practical purposes, transients are made up of long chains of states without branches, so it becomes possible to link two states separated in time, both forward and backward. Figure 13 describes how information can be encrypted and decrypted, in this example for an eight-value (eight-color) CA. About the square root of binary rule-space is made up of chain rules, which can be constructed at random to provide a huge number of encryption keys.

Memory and Learning The RBN basin of attraction ﬁeld (Fig. 15) reveals that content-addressable memory is present in discrete dynamical networks and shows its exact composition, where the root of each subtree (as well as each attractor) categorizes all the states

Basins of Attraction of Cellular Automata and Discrete Dynamical Networks, Fig. 12 A subtree of a chain-rule 1D CA n = 400. The root state (the eye) is shown in 2D (20 20). Backward iteration was stopped

that ﬂow into it, so if the root state is a trigger in some other system, all the states in the subtree could in principle be recognized as belonging to a particular conceptual entity. This notion of memory far from equilibrium (Wuensche 1994b, 1996) extends Hopﬁeld’s (Hopield 1982) and other classical concepts of memory in artiﬁcial neural networks, which rely just on attractors. As the dynamics descend toward the attractor, a hierarchy of sub-categories unfolds. Learning in this context is a process of adapting the rules and connections in the network, to modify subcategories for the required behavior – modifying the ﬁne structure of subtrees and basins of attraction. Classical CA are not ideal systems to implement these subtle changes, restricted as they are to a universal rule and local neighborhood, a requirement for emergent structure, but which severely limits the ﬂexibility to categorize. Moreover, CA dynamics have symmetries and hierarchies resulting from their periodic boundaries (Wuensche and Lesser 1992). Nevertheless, CA can be shown to have a degree of stability in behavior when mutating bits in the rule table – with some bits more sensitive than others. The rule can be regarded as the genotype and basins of attraction as the phenotype (Wuensche and Lesser 1992). Figure 14 shows CA mutant basins of attraction. With RBN and DDN there is greater freedom to modify rules and connections than with CA (Fig. 15). Algorithms for learning and forgetting (Wuensche 1994b, 1996, 1997) have been devised, implemented in DDLab. The methods assign pre-

after 500 reverse time-steps. The subtree has 4270 states. The density of both leaf states and states that branch is very low (about 0.03) – where maximum branching equals 2

Basins of Attraction of Cellular Automata and Discrete Dynamical Networks

285

running forward, time-step -2 to +7 Basins of Attraction of Cellular Automata and Discrete Dynamical Networks, Fig. 13 Left: A 1D pattern is displayed in 2D (n = 7744, 88 88). The “portrait” was drawn with the drawing function in DDLab. With a v = 8, k = 4 chain-rule constructed at random, and the portrait as the root state, a subtree was generated with the CA reverse algorithm, set to stop after four backward time-steps. The

state reached is the encryption. To decrypt, run forward by the same number of time-steps. Right: Starting from the encrypted state, the CA was run forward to recover the original image. This ﬁgure shows time-steps from 2 to +7 to illustrate how the image was scrambled both before and after time-step 0

images to a target state by correcting mismatches between the target and the actual state, by ﬂipping speciﬁc bits in rules or by moving connections. Among the side effects, generalization is evident, and transient trees are sometimes transplanted along with the reassigned pre-image.

is a dynamical system (not a computer or Turing machine) composed of interacting subnetworks. Secondly, neural coding is based on distributed patterns of activation in neural subnetworks (not the frequency of ﬁring of single neurons) where ﬁring is synchronized by many possible mechanisms: phase locking, interneurons, gap junctions, membrane nanotubes, and ephaptic interactions. Learnt behavior and memory work by patterns of activation in subnetworks ﬂowing automatically within the subtrees of basins of attraction. Recognition is easy because an initial state is provided. Recall is difﬁcult because an association must be conjured up to initiate the ﬂow within the correct subtree.

Modeling Neural Networks Allowing some conjecture and speculation, what are the implications of the basin of attraction idea on memory and learning in animal brains (Wuensche 1994b, 1996)? The ﬁrst conjecture, perhaps no longer controversial, is that the brain

286

Basins of Attraction of Cellular Automata and Discrete Dynamical Networks

Basins of Attraction of Cellular Automata and Discrete Dynamical Networks, Fig. 14 Mutant basins of attraction of the v = 2, k = 3, rule 60 (n = 8, seed all 0 s). Top left: The original rule, where all states fall into just one very regular basin. The rule was ﬁrst transformed to its

equivalent k = 5 rule (f00ff00f in hex), with 32 bits in its rule table. All 32 one-bit mutant basins are shown. If the rule is the genotype, the basin of attraction can be seen as the phenotype

At a very basic level, how does a DDN model a semiautonomous patch of neurons in the brain whose activity is synchronized? A network’s connections model the subset of neurons connected to a given neuron. The logical rule at a network element, which could be replaced by the equivalent treelike combinatorial circuit, models the logic performed by the synaptic microcircuitry of a neuron’s dendritic tree, determining whether or not it will ﬁre at the next time-step. This is far more complex than the threshold function in artiﬁcial neural networks. Learning involves changes in the dendritic tree or, more radically, axons reaching out to connect (or disconnect) neurons outside the present subset.

It is well known in biology that there is a genetic regulatory network, where genes regulate each other’s activity with regulatory proteins (Somogyi and Sniegoski 1996). A cell type depends on its particular subset of active genes, where the gene expression pattern needs to be stable but also adaptable. More controversial to cell biologists less exposed to complex systems is Kauffman’s classic idea (Kauffman 1969, 1993; Wuensche 1998) that the genetic regulatory network is a dynamical system where cell types are attractors which can be modeled with the RBN or DDN basin of attraction ﬁeld. However, this approach has tremendous explanatory power, and it is difﬁcult to see a plausible alternative. Kauffman’s model demonstrates that evolution has arrived at a delicate balance between order and chaos, between stability and adaptability, but leaning toward convergent ﬂow and order (Harris et al. 2002; Kauffman 1993). The stability of attractors to perturbation can be analyzed by the jump graph (Fig. 16) which shows the probability of jumping between basins of attraction due to single bit-ﬂips (or value-ﬂips) to attractor states (Wuensche 2004, 2016). These methods are

Modeling Genetic Regulatory Networks The various cell types of multicellular organisms, muscle, brain, skin, liver, and so on (about 210 in humans), have the same DNA so the same set of genes. The different types result from different patterns of gene expression. But how do the patterns maintain their identity? How does the cell remember what it is supposed to be?

Basins of Attraction of Cellular Automata and Discrete Dynamical Networks

287

time

garden-of-Eden states or the leaves of subtrees

attractor cycle

one of 7 attractor states

e

tim

transient tree and subtrees

Basins of Attraction of Cellular Automata and Discrete Dynamical Networks, Fig. 15 Top: The basin of attraction ﬁeld of a random Boolean network, k = 3, n = 13. The 213 = 8192 states in state-space are organized into 15 basins, with attractor periods ranging between 1 and 7 and basin volume between 68 and 2724. Bottom:

A basin of attraction (arrowed above) which links 604 states, of which 523 are leaf states. The attractor period = 7, and one of the attractor states is shown in detail as a bit pattern. The direction of time is inward and then clockwise at the attractor

288

Basins of Attraction of Cellular Automata and Discrete Dynamical Networks

13

15

12 11 2 10 3

4 8 7

5

Basins of Attraction of Cellular Automata and Discrete Dynamical Networks, Fig. 16 The jump graph (of the same RBN as in Fig. 15) shows the probability of jumping between basins due to single bit-ﬂips to attractor states. Nodes representing basins are scaled according the number of states in the basin (basin volume). Links are

scaled according to both basin volume and the jump probability. Arrows indicate the direction of jumps. Short stubs are self-jumps; more jumps return to their parent basin than expected by chance, indicating a degree of stability. The relevant basin of attraction is drawn inside each node

implemented in DDLab and generalized for DDN where the value range, v, can be greater than 2 (binary), so a gene can be fractionally on as well as simply on/off. A present challenge in the model, the inverse problem, is to infer the network architecture from information on space-time patterns and apply this to infer the real genetic regulatory network from the dynamics of observed gene expression (Harris et al. 2002).

Future Directions This chapter has reviewed a variety of discrete dynamical networks where knowledge of the structure of their basins of attraction provides insights and applications: in complex cellular automata particle dynamics and self-organization, in maximally chaotic cellular automata where information can be hidden and recovered from a stream of chaos, and in random Boolean and

Basins of Attraction of Cellular Automata and Discrete Dynamical Networks

multi-value networks that are applied to model neural and genetic networks in biology. Many avenues of inquiry remain – whatever the discrete dynamical system, it is worthwhile to think about it from the basin of attraction perspective.

References Note: Most references by A. Wuensche are available online at http://www.uncomp.ac.uk/wuensche/publications. html Ashby WR (1956) An introduction to cybernetics. Chapman & Hall, London Conway JH (1982) What is life? In: Berlekamp E, Conway JH, Guy R (eds) Winning ways for your mathematical plays, chapter 25, vol Vol. 2. Academic Press, New York Cook M (2004) Universality in elementary cellular automata. Complex Syst 15:1–40 Domain C, Gutowitz H (1997) The topological skeleton of cellular automata dynamics. Pysica D 103(1–4):155–168 Gomez-Soto JM, Wuensche A (2015) The X-rule: universal computation in a nonisotropic Life-like Cellular Automaton. JCA 10(3-4):261–294. preprint: http:// arxiv.org/abs/1504.01434/ Gomez-Soto JM, Wuensche A (2016) X-rule’s precursor is also logically universal. To appear in JCA. Preprint: https://arxiv.org/abs/1611.08829/ Harris SE, Sawhill BK, Wuensche A, Kauffman SA (2002) A model of transcriptional regulatory networks based on biases in the observed regulation rules. Complexity 7(4):23–40 Hopield JJ (1982) Neural networks and physical systems with emergent collective abilities, proceeding of the national. Acad Sci 79:2554–2558 Kauffman SA (1969) Metabolic stability and Epigenesis in randomly constructed genetic nets. Theor Biol 22(3):439–467 Kauffman SA (1993) The origins of order. Oxford University Press, New York/Oxford Kauffman SA (2000) Investigations. Oxford University Press, New York Langton CG (1990) Computation at the edge of chaos: phase transitions and emergent computation. Physica D 42:12–37 Somogyi R, Sniegoski CA (1996) Modeling the complexity of genetic networks: understanding multigene and pleiotropic regulation. Complexity 1:45–63

289

Walker CC, Ashby WR (1966) On the temporal characteristics of behavior in certain complex systems. Kybernetick 3(2):100–108 Wuensche A (1993–2017) Discrete Dynamics Lab (DDLab). http://www.ddlab.org/ Wuensche A (1994a) Complexity in 1D cellular automata; Gliders, basins of attraction and the Z parameter. Santa Fe Institute working paper 94-04-025 Wuensche A (1994b) The ghost in the machine: basin of attraction ﬁelds of random Boolean networks. In: Langton CG (ed) Artiﬁcial Life III. Addison-Wesley, Reading, pp 496–501 Wuensche A (1996) The emergence of memory: categorisation far from equilibrium. In: Hameroff SR, Kaszniak AW, Scott AC (eds) Towards a science of consciousness: the ﬁrst Tucson discussions and debates. MIT Press, Cambridge, pp 383–392 Wuensche A (1997) Attractor basins of discrete networks: Implications on self-organisation and memory. Cognitive science research paper 461, DPhil thesis, University of Sussex Wuensche A (1998) Genomic regulation modeled as a network with basins of attraction. Proceedings of the 1998 paciﬁc symposium on Biocomputing. World Scientiﬁc, Singapore Wuensche A (1999) Classifying cellular automata automatically; ﬁnding gliders, ﬁltering, and relating spacetime patterns, attractor basins, and the Z parameter. Complexity 4(3):47–66 Wuensche A (2004) Basins of attraction in network dynamics: a conceptual framework for biomolecular networks. In: Schlosser G, Wagner GP (eds) Modularity in development and Evolution,chapter 13. Chicago University Press, Chicago, pp 288–311 Wuensche A (2009) Cellular automata encryption: the reverse algorithm, Z-parameter and chain rules. Parallel Proc Lett 19(2):283–297 Wuensche A (2010) Complex and chaotic dynamics, basins of attraction, and memory in discrete networks. Acta Phys Pol, B 3(2):463–478 Wuensche A (2016) Exploring discrete dynamics, 2nd edn. Luniver Press, Frome Wuensche A, Adamatzky A (2006) On spiral glider-guns in hexagonal cellular automata: activator-inhibitor paradigm. Int J Mod Phys C 17(7):1009–1026 Wuensche A, Lesser MJ (1992) The global dynamics of cellular automata; an atlas of basin of attraction ﬁelds of one-dimensional cellular automata, Santa Fe institute studies in the sciences of complexity. Addison-Wesley, Reading

Growth Phenomena in Cellular Automata Janko Gravner Mathematics Department, University of California, Davis, CA, USA

Article Outline Glossary Deﬁnition of the Subject Introduction Final Set Asymptotic Shapes Nucleation Future Directions Bibliography

Glossary Asymptotic density The proportion of sites in a lattice occupied by a speciﬁed subset is called asymptotic density or, in short, density. Asymptotic shape The shape of a growing set, viewed from a sufﬁcient distance so that the boundary ﬂuctuations, holes, and other lower order details disappear, is called the asymptotic shape. Cellular automaton A cellular automaton is a sequence of conﬁgurations on a lattice which proceeds by iterative applications of a homogeneous local update rule. A conﬁguration attaches a state to every member (also termed a site or a cell) of the lattice. Only conﬁgurations with two states, coded 0 and 1, are considered here. Any such conﬁguration is identiﬁed with its set of 1’s. Final set A site whose state changes only ﬁnitely many times is said to ﬁxate or attain a ﬁnal state. If this happens for every site, then the sites whose ﬁnal states are 1 comprise the ﬁnal set.

Initial set A starting set for a cellular automaton evolution is called initial set and may be deterministic or random. Metastability Metastability refers to a long, but ﬁnite, time period in an evolution of a cellular automaton rule, during which the behavior of the iterates has identiﬁable characteristics. Monotone cellular automaton A cellular automaton is monotone if addition of 1’s to the initial conﬁguration always results in more 1’s in any subsequent conﬁguration. Nucleation Nucleation refers to (usually small) pockets of activity, often termed nuclei, with long range consequences. Solidiﬁcation A cellular automaton solidiﬁes if any site which achieves state 1 remains forever in this state.

Definition of the Subject In essence, analysis of growth models is an attempt to study properties of physical systems far from equilibrium (e.g., (Meakin 1998) and its more than 1,300 references). Cellular automata (CA) growth models, by virtue of their simplicity and amenability to computer experimentation (Toffoli and Margolus 1997; Wójtowicz 2001), have become particularly popular in the last 30 years in many ﬁelds, such as physics (Chopard and Droz 1998; Toffoli and Margolus 1997; Vichniac 1984), biology (Deutsch and Dormann 2005), chemistry (Chopard and Droz 1998; Kier et al. 2005), social sciences (Bäck et al. 1996), and artiﬁcial life (Lindgren and Nordahl 1994). In contrast to voluminous empirical literature on CA in general and their growth properties in particular, precise mathematical results are rather scarce. A general CA theory is out of the question, since a Turing machine can be embedded in a CA, so that examples as “simple” as elementary one-dimensional CA (Cook 2005) and Conway’s Game of Life (Berlekamp et al. 2004) are capable of universal computation. Even the most basic parameterized families of CA systems exhibit a bewildering variety of

# Springer Science+Business Media LLC, part of Springer Nature 2018 A. Adamatzky (ed.), Cellular Automata, https://doi.org/10.1007/978-1-4939-8700-9_266 Originally published in R. A. Meyers (ed.), Encyclopedia of Complexity and Systems Science, # Springer Science+Business Media New York 2013 https://doi.org/10.1007/978-3-642-27737-5_266-5

291

292

phenomena: self-organization, metastability, turbulence, self-similarity, and so forth (Adamatzky et al. 2006; Evans 2001; Fisch et al. 1991; Griffeath 1994). From a mathematical point of view, CA can be rightly viewed as discrete counterparts to partial differential equations, and so they are able to emulate many aspects of the physical world, while at the same time they are easy to experiment using widely available platforms (from many available simulation programs we just mentioned (Wójtowicz 2001)). Despite their resistance to traditional methods of deductive analysis, CA have been of interest to mathematicians from their inception, and we will focus on the rigorous mathematical results about their growth properties. The scope will be limited to CA with deterministic update rule – random rules are more widely used in applications (Bäck et al. 1996; Deutsch and Dormann 2005; Kier et al. 2005), but ﬁt more properly within probability theory (however, see, e.g., (Gravner and Griffeath 2006b) for a connection between deterministic and random aspects of CA growth). Adding randomness to the rule in fact often makes them more tractable, as ergodic properties of random systems are much better understood than those of deterministic ones ((Bramson and Neuhauser 1994) provides good examples). Even though mathematical arguments are the ultimate objective, computer simulations are an indispensable tool for providing the all important initial clues for the subsequent analysis. However, as we explain in a few examples in the sequel, caution needs to be exercised while making predictions based on simulations. Despite the increased memory and speed of commercial computers, for some CA rules highly relevant events occur on spatial and temporal scales far beyond the present-day hardware. Simply put, mathematics and computers are both important, and one ignores each ingredient at one’s own peril. By nature, a subject in the middle of active research contains many exciting unresolved conjectures, vague ideas that need to be made precise, and intriguing examples in search of proper mathematical techniques. It is clear from what has already been accomplished that, often in sharp contrast with the simplicity of the initially

Growth Phenomena in Cellular Automata

posed problem, such techniques may be surprising, sophisticated, and drawn from such diverse areas as combinatorics, geometry, probability, number theory, and PDE. This is a ﬁeld to which mathematicians of all stripes should feel invited.

Introduction Let us begin with the general setup. We will consider exclusively binary CA. Accordingly, a conﬁguration will be a member of {0, 1}ℤd, that is, an assignment of 0 or 1 to every site in the d-dimensional lattice ℤd. This divides the lattice into two sets, those that are assigned state 1, called the occupied sites, and those in state 0, which are the empty sites. A conﬁguration is thus represented by its occupied set A. This set will change in discrete time, its evolution given by A0, A1, A2, . . . ℤd. The conﬁguration changes subject to a CA rule, which is, in general, speciﬁed by the following two ingredients. The ﬁrst is a ﬁnite neighborhood N ℤd of the origin, its translate x þ N , then being the neighborhood of point x. By convention, we assume that N contains the origin. Typically, N ¼ Bn ð0,rÞ \ ℤd , where Bn(0, r) = {x ℝd:kxkn r} is the ball in the ‘n-norm | | | |n and r is the range. When n = 1 the resulting N is called the Diamond neighborhood, while if n = 1 it is referred to as the Box neighborhood. (In particular, when d = 2, range 1 Diamond and Box neighborhoods are also known as von Neumann and Moore neighborhoods, respectively). The second ingredient is a map p:2N ! f0,1g, which ﬂags the sufﬁcient conﬁgurations for occupancy. More precisely, for a set A ℤd, we let T ðAÞ ℤd consist of every x ℤd for which pððAt xÞ \ N Þ ¼ 1 . Then, for a given initial subset A0 ℤd of occupied points, we deﬁne A1,A2, . . . recursively by Atþ1 ¼ T ðAt Þ. To explain this notation on arguably the most famous CA of all time, the Game of Life (Berlekamp et al. 2004; Gardner 1976) has d = 2, Moore neighborhood N consisting of the origin and nearest eight sites, so that the neighbor of x is

Growth Phenomena in Cellular Automata

• xþN ¼ • •

• x •

• •, •

and p(S) = 1 precisely when either 0 S and | S | {3, 4} or 0 2 = S and | S | = 3. Here, | S | is the size (cardinality) of S N, and note that the center x of the neighborhood itself is counted in the occupation number. Usually, our starting set A0 will consist of a possibly large but ﬁnite set of 1’s surrounded by 0’s. However, other initial states are worthy of consideration, for example, half-spaces, wedges, and sets with ﬁnite complements, called holes. Finally, for understanding self-organizational abilities and statistical tendencies of the CA rule, the most natural starting set is the random “soup” P(p) to which every site is adjoined independently with probability p. As already mentioned, we need to consider special classes if we hope to formulate a general theorem. Mathematically, the most signiﬁcant restriction is to the class of monotone (or attractive) CA rules, for which S1 S2 implies p(S1) p(S2). To avoid the trivial case, we will also assume that monotone CA have pðN Þ ¼ 1. Another important notion is that of solidiﬁcation: we say that the CA solidify if p(S) = 1 whenever 0 S. In words, this means that once a site becomes occupied, it cannot be removed. To every CA on ℤd given by the rule ðN ,pÞ, one can associate “space-time” solidiﬁcation CA on ℤd ℤ, with unique solidiﬁcation rule given by the neighborhood N ¼ ðN f1gÞ [ 0dþ1 , and p0 such that p0(S {1}) = p(S) for S N. This construction is useful particularly for onedimensional CA whose space-time version interprets their evolution as a two-dimensional object (Willson 1984), but we prefer to focus on the growth phenomena in the rule’s “native” space. A more restrictive, but still quite rich, class of rules is the Threshold Growth (TG) CA, which is a general totalistic monotone solidiﬁcation CA rule. For such rules, p(S) depends only on the cardinality | S | of S whenever 0 2 = S; therefore, for such S there exists a threshold y 0 such that p(S) = 0 whenever | S | < y and p(S) = 1 whenever | S | y.

293

We will universally assume that a 1 cannot spontaneously appear in a sea of 0’s, that is, that 1’s only grow by contact: p(ø) = 0. We also ﬁnd it convenient to assume that p is symmetric: N ¼ N and p(S) = p(S). This is not a necessary assumption in many contexts, but its absence makes many statements unnecessarily awkward. Next is a very brief historical lesson. The ﬁrst paper in CA modeling is surely (Wiener and Rosenblueth 1946), a precursor to the research into nucleation and self-organization in CA. The follow-up to this pioneering work had to wait until the 1970s, when the inﬂuential work (Greenberg and Hastings 1978) appeared. The earliest work on CA growth is that of S. Willson (1978, 1984, 1987), which still stands today as one of the notable achievements of mathematical theory. The importance of growth properties of CA, from theoretical and modeling perspectives, was more widely recognized in the mid-1980s (Packard 1984; Packard and Wolfram 1985; Toffoli and Margolus 1997). At about the same time, statistical physicists recognized the value of mathematical arguments in studying nucleation and metastability and hence the need to build tractable models (Vichniac 1984; Vichniac 1986). Bootstrap percolation ((Adler 1991; Aizenman and Lebowitz 1988; van Enter 1987), and references therein), one of the most studied CA, which we discuss in some detail in section “Nucleation,” originates from that period. Since the beginning of the 1990s, there has been a great expansion in the popularity of CA modeling (Deutsch and Dormann 2005; Kier et al. 2005), while mathematical theory, which we review in the next three sections, proceeds at a much more measured pace. The rest of the article is organized as follows. In section “Final Set,” we consider properties of the set which the CA rule generates “at the end of time.” In particular, we discuss when the CA eventually occupies the entire available space and, when it fails to do so, what proportion of space it does ﬁll. Section “Asymptotic Shapes” then focuses on the occupation mechanism, in particular on shapes attained from ﬁnite seeds. The main theme of section “Nucleation” is sparsely randomly populated initializations. We

294

Growth Phenomena in Cellular Automata

conclude with section “Future Directions,” a summary of issues in need of further research.

Final Set Perhaps the most basic question that one may ask is what proportion of space does a CA rule ultimately ﬁll? Clearly we need to specify more precisely what is meant by this, but it should be immediately suspected that the answer in general depends on the initial state, even if we only restrict to ﬁnite ones. Indeed, consider the TG CA with Moore neighborhood and y = 3. It is easy to construct an initial set which stops growing, say, one containing fewer than three sites. It is not much harder to convince oneself that there exist ﬁnite sets (even some with only three sites) which eventually make every site occupied. It is a combinatorial exercise to show that these two are the only possibilities in this example. Is this dichotomy valid in any generality? This is one of the questions we address in this section. Assume a ﬁxed CA rule and the associated transformation T , and ﬁx an initial state A0. If every x ℤd ﬁxates, that is, changes state only ﬁnitely many times, then the ﬁnal set A1 ¼ T 1 ðA0 Þ exists. Notice that this is automatically true for every solidiﬁcation rule, in which no site can change state more than once. We say that A0 ﬁlls space if T 1 ðA0 Þ ¼ ℤd . One cannot imagine a greater ability of a CA rule to “conquer” the environment than if a ﬁnite set is able to ﬁll space. Thus, it is natural to ask whether there exist general conditions that assure this property, and indeed they do for monotone CA. Induced by T is a growth transformation T on closed subsets of ℝd, given by T ðBÞ ¼ x ℝd :0 T ðB xÞ \ ℤd : In words, one translates the lattice so that x ℝd is at the origin and applies T to the intersection of Euclidean set B with the translated lattice. It is easy to verify that the two transformations are conjugate,

T B \ ℤd ¼ T ðBÞ \ ℤd : It will become immediately apparent why T is convenient. Let Sd1 be the set of unit vectors ℝd in and let d H u ¼ x ℝ : hx,ui 0 be the closed half-space with unit outward normal u Sd1. Then, provided that the CA rule is monotone, there exists a w(u) ℝ so that T H u ¼ H u þ wðuÞ u and consequently d ¼ H u þ twðuÞ u \ ℤd : T t H u \ℤ Monotone CA with w(u) > 0 for every u are called supercritical. A supercritical CA hence enlarges every half-space. Theorem 1 Assume a monotone CA rule. A ﬁnite set A0 which ﬁlls space exists if and only if w(u) > 0 for every direction u Sd1. See (Gravner and Griffeath 1996; Willson 1978) for a proof. Before we proceed, a few remarks are in order. First, we should note that one direction of the above theorem has a oneline proof: if w(u) 0 for some u, then monotonicity prevents the CA from ever occupying a point outside a suitable translate of Hu. The other direction is proved by constructing a sufﬁciently “smooth” initial set. Moreover, supercriticality can be checked on a ﬁnite number of directions, in particular one can prove that a two-dimensional TG CA is supercritical if and only if y 12 ðjN j maxfjN \ ‘j:‘ a line through 0}) (Gravner and Griffeath 1996). Thus, among the TG CA with Moore neighborhood, exactly those with y 3 are supercritical, while this is true for range 2 Box neighborhood when y 10. A ﬁnite set A0 for which [tAt is inﬁnite is said to generate persistent growth. Further, a CA for which any set that generates persistent growth has A1 = ℤd is called omnivorous (Gravner and Griffeath 1996). For an

Growth Phenomena in Cellular Automata

omnivorous rule a ﬁnite seed has either a bounded effect or it ﬁlls space. Is every supercritical TG CA omnivorous? The answer is no, and a counterexample in d = 2 is obtained by taking the neighborhood to be the cross of radius 2: N ¼ fð0; 0Þ, ð0, 0Þ, ð0, 2Þ, ð1,0Þ, ð2,0Þg , and y = 2. It is easy to check that for A0 = {(0, 0),(1, 0)} the ﬁnal set A1 consists of the x-axis, while initialization with a 2 2 box results in A1 = ℤ2. On the other hand, the following theorem holds. Theorem 2 The two-dimensional TG CA is omnivorous provided either of the two conditions are satisﬁed: 1. N is box neighborhood of arbitrary range. 2. N ¼ N \ ℤ2, where N is a convex set with the same symmetries as ℤ2, and y s2/2, where s is the range of the largest box neighborhood contained in N . The theorem is proved in (Bohman 1999) and (Bohman and Gravner 1999) by rather delicate combinatorial arguments involving analysis of invariant, or nearly invariant, quantities. The lack of robust methods makes conditions in the theorem far from necessary. In particular, proving a general analogue of Theorem 2 without solidiﬁcation (while keeping monotonicity) is an intriguing open problem. For non-monotone solidiﬁcation rules, any general theory appears impossible, but one can analyze speciﬁc examples, and we list some recent results below. All are two dimensional; therefore, we assume d = 2 for the rest of this section. In many interesting cases, it is immediately clear from computer simulations that A1 6¼ ℤd, but at least A1 is spread out fairly evenly. This motivates the following deﬁnition. Pick a set A ℤ2. Let m be 2 times the counting measure on A. We say that A has asymptotic density r if m converges to r l as ! 0. Here l is Lebesgue measure on ℝ2, and the convergence holds in the usual sense:

295

ð

ð f dm ! r f dl

(1)

for any f Cc(ℝ2). Equivalently, for any square R ℝ2, the quantity 2 |R \ ( A)| converges to the area of R as ! 0. For totalistic solidiﬁcation CA, the rule is determined by the neighborhood and a solidiﬁcation list of neighborhood counts which result in occupation at the next time. Three neighborhoods have been studied so far: Diamond rules with von Neumann neighborhood, Box rules with Moore neighborhood, and Hex rules with the neighborhood N consisting of (0, 0) and the six sites (1, 0), (0, 1), and (1, 1). (We note that this last neighborhood is a convenient way to represent the triangular lattice (Toffoli and Margolus 1997).) These rules are often referred to as Packard snowﬂakes (Brummitt et al. 2008; Gravner and Griffeath 2006a; Packard 1984). As an example, in Hex 135 rule, a 0 turns into a 1 exactly when it “sees” an odd number of already occupied neighbors in its hexagonal neighborhood. We will assume that 1 is on the solidiﬁcation list, for otherwise the analysis quickly becomes too difﬁcult (see however (Gravner and Griffeath 1998) and (Griffeath and Moore 1996) for some results on Box 2 and Box 3) rules. Further, for Hex and Diamond cases, we will assume 2 is not on this list (or else the dynamics is too similar to a TG CA). We now summarize the main results of (Gravner and Griffeath 2006a) and (Brummitt et al. 2008). Theorem 3 To each of the four Diamond and 16 Hex Packard snowﬂakes, there corresponds a number r (0, 1), the asymptotic density of A1, which is independent of the ﬁnite seed A0. The densities in Diamond cases are r1 ¼ 2=3,r13 ¼ 2=3,r14 ¼ 1,r134 ¼ 29=36: The Hex densities are exactly computable in eight cases: r13 ¼ r135 ¼ 5=6,r134 ¼ r1345 ¼ 21=22,r136 ¼ r1356 ¼ r1346 ¼ r13456 ¼ 1: In six other Hex cases, one can estimate, within 0.0008,

296

Growth Phenomena in Cellular Automata

r1 0:6353,r14 ,r145 0:9689,r15 0:8026, r16 0:7396,r156 0:9378: The ﬁnal two Hex rules have densities very close to 1: r146 ð0:9995,1Þ, r1456 ð0:9999994,1Þ: The indices in the densities of course refer to the respective rule. Note that, in each of the two cases, r14 > r134, testimony to the fundamentally non-monotone nature of these rules. It is also shown in (Gravner and Griffeath 2006a) that observing Hex 1456 from A0 = {0} on even the world’s most extensive graphics array, with millions of sites on a side, one would still be led to the conclusion that A1 = ℤ2. In fact, the site in A1c closest to the origin is still at distance of the order 109. Nevertheless, A1c has a positive density and contains arbitrarily large islands of 0’s. This is one illustration of limitations in making empirical conclusions based on simulations. The fundamental tool to prove the above theorem is the fact that these dynamics have an additive component which creates an impenetrable web of occupied sites (Gravner and Griffeath 2006a). This web consists of sites at the edge of the light cone, or, to be more precise, the sites which are occupied at the same time at which TG CA with the same neighborhood and y = 1 would occupy them. The web makes at least an approximate recursion possible, and the basic renewal theory applies. The delicacy of such results is conveyed effectively by comparison to Box solidiﬁcation. There are 128 such rules with 1 on the solidiﬁcation list. Although snowﬂake-like recursive carpets emerge in a great many cases, and exact computations are sometimes feasible, there is no hope of a complete analysis as in the Hex and Diamond settings, and many fascinating problems remain. For instance, the density of Box 1, provided it exists at all, can depend on the initial seed. Namely, it is shown in (Gravner and Griffeath 1998) that Box 1 solidiﬁcation yields density 4/9 starting from a singleton. Later, D. Hickerson

(private communication) engineered ﬁnite initial seeds with asymptotic densities 29/64 and 61/128. The latter is achieved by an ingenious arrangement of 180 carefully placed occupied cells around the boundary of an 83 83 grid. The highest density with which Box 1 solidiﬁcation can ﬁll the plane is not known and neither is whether any seed ﬁlls with density less than 4/9. Most initial seeds generate what seems to be a chaotic growth with density about 0.51. Many other Box rules have known asymptotic densities started from a singleton. Table 1 is a sample (D. Griffeath, private communication). All exact density computations presented in this section are based on explicit recursions, made possible by an additive web. These recursions are in some cases far from simple, for example, D. Griffeath has shown that in the Box 12 case, the following formula holds for an = | A1 \ B1(0, 2n 1) |, n 12: an ¼

8 n 8 4 þ r1 gn3 3n 3 3 16 n 2 2 þ ð2Þn þ 4n 15 51 8 3 þ ð1Þn þ r2 gn1 þ r3 gn2 , 3

where g1 :675, g2 :461, g3 3:214 are the three real roots of the equation g3 3g2 g + 1 = 0, while r1 6:614, r2 2:126, r3 2:434

Growth Phenomena in Cellular Automata, Table 1 Densities of A1 from A0 = {0} for some Box rules Rule 12 13 15 16 17 18

Density 2/3 28/45 43/72 385/576 35/72 4/9

Growth Phenomena in Cellular Automata

297

Growth Phenomena in Cellular Automata, Fig. 1 Some Packard snowﬂakes. Clockwise from top left: Hex 1; Box 1; Box 1357; and again Box 1. The ﬁrst three are started from {0} and the last from an 8 8 box.

The web is black; otherwise, the updates are periodically shaded. Note that the chaotic growth can result from a chaotic web (bottom left) or from a leaky web (bottom right)

solve 3145r3 + 19832r2 22688r 107648 = 0 (Fig. 1). Apparently very similar rules to those in the above table seem unsolvable, such as Box 14, and the “odd” rule Box 1357 which does have an additive component, but the resulting web from A0 = {0} “leaks” and growth is apparently chaotic. The same problem plagues almost all Box rules started from general initial set. The sole exception seems to be the 12 rule, the best

candidate for a general theorem among the 128 rules, due to its quasiadditive web (Jen 1991). We should also mention that embedded additive dynamics have been used to study other models (Evans 2003). In all considered cases, the web consists of several copies of the ﬁnal set generated by the space-time solidiﬁcation associated to a onedimensional CA. When this CA is linear, the web’s fractal dimension can be computed using

298

Growth Phenomena in Cellular Automata

Growth Phenomena in Cellular Automata, Fig. 2 The Bell-Eppstein initial set (left) that results in for the Diamoeba rule. The set At, whose linear asymptotic shape is a rhombus with vertices (1/7, 0) and (0, 1/8), is shown at t = 500

the method from (Willson 1987). For example, the properly scaled webs in the top two frames on Fig. 2 approach a set with Hausdorff dimension log 3/log 2, while the ﬃﬃﬃ bottom right web, this forp dimension is log 1 þ 5 =log2. Given that all exactly given densities so far are rational, a natural question is whether there is an example of A1 with irrational density. Such example was given by Griffeath and Hickerson in (Griffeath and Hickerson 2003), where an initial state for the Game of Life is provided for which 1 the setptﬃﬃﬃ At converges to an asymptotic density 3 5 =90 on an appropriate ﬁnite set L. This formulation masks the fact that every site x eventually periodically changes its state, so A1 does not exist. However, a closer look at the construction shows that the ﬁnal periods are uniformly bounded. Therefore, if p is the lowest common multiple of all ﬁnal periods, the p th iterate of the Game of Life rule will generate A1 from the same A0 and with the same density. This is the only known example of a computable irrational density, and there is a good reason, which we now explain, why such examples are difﬁcult to come by. By analogy with statistical physics, we would call a set A ℤ2 exactly solvable, if there exists a formula which decides whether a given x is an element of A. More formally, we require that there exists a ﬁnite automaton which, upon encountering x as input, decides whether x A. Representation of x as input is given as (i11, i12, i21, i22, . . .), where i11, i12 are the most signiﬁcant binary digits of the ﬁrst and second coordinate of x; i21, i22 the next most signiﬁcant, etc. (Some initial ik1’s or ik2’s may be 0, and the representation is ﬁnite but of arbitrary length). This means that A is

automatic (Allouche and Shallit 2003) or equivalently a uniform tag system (Cobham 1972). With a slight abuse of terminology, we call a solidiﬁcation CA exactly solvable (from A0) if A1 is exactly solvable. To our knowledge, the simplest nontrivial example of an exactly solvable CA is Diamond 1 solidiﬁcation, for which it can be shown by induction that x 2 = A1 if max{k:ik1 = 1} = max 2 {k:ik = 1}. It is easy to construct a (two-state) ﬁnite automaton that checks this condition, and the density r of A1 evidently must satisfy the equation r = 1/2 + r/4, so that r = 2/3 as stated in Theorem 3. In fact, all of the CA in Theorem 3 with exactly given densities are exactly solvable, and then, by (Cobham 1972), Theorem 6, these densities must be rational. Therefore, the Griffeath-Hickerson example given above is not exactly solvable, and the mechanism that forms A1 must be more complex in this precise sense. We note that none of the other examples from Theorem 3 are exactly solvable either, but for a different reason (Gravner and Griffeath 2006a). This section’s ﬁnal example, like many other fascinating CA rules, is due to D. Hickerson (private communication). His Diamoeba is a rule with the Moore neighborhood and p(S) = 1 whenever one of the following two conditions is satisﬁed: 02 = S, and jS j f3,5,6,7,8g,or 0 S, and jS j f6,7,8,9g: This would be an easily analyzed monotone rule if the 3 were replaced by a 9, with A1 = ø for every ﬁnite A0. At ﬁrst, it seems that the Diamoeba shares this fate. In fact, D. Hickerson

Growth Phenomena in Cellular Automata

has demonstrated that, starting from A0 = B1(0, r) \ ℤ, At = ø at the smallest t given by 12r 8 4r1 þ r11 þ ðr

mod2Þ,

where r1 and r11 are, respectively, the number of 1’s and the number of 11’s in the binary representation of r. This interesting formula only gives a small taste of things to come (see (Gravner and Griffeath 1998) for a detailed discussion). One of the most intriguing examples is when A0 is a 2 59 rectangle with a corner cell removed. This grows to a fairly large set in about a million updates, then apparently stops for several million more, after which another growth spurt is possible. The question whether A1 = ℤ2 for this A0 is tantalizingly left open. However, there does exist an A0 for which A1 = ℤ2. This initialization was discovered by D. Bell and is an adaptation of a spaceship found by a search algorithm designed by D. Eppstein (Eppstein 2002). This startling object attests to the remarkable design expertise that Game of Life researchers have developed over the years.

Asymptotic Shapes After addressing a rule’s ability to grow in the previous section, we now turn to the geometry of growth: is it possible to predict the shape that the set of 1’s attains as it spreads? It turns out that the complete answer is known in the monotone case. Naturally, we need a notion of convergence of sets, and the most natural deﬁnition is due to Hausdorff (see (Gravner and Griffeath 1993, 1997a) for an introduction to such issues). We say that a sequence of compact sets Kn ℝd converges to a compact set K ℝd (in short, Kn ! K) if, for every > 0, Kn K + B2(0, ) and K Kn + B2(0, ), for n large enough. Then we say that a CA has a linear asymptotic shape L from a ﬁnite initial seed A0 if 1 At ! L t as t ! 1.

299

Turning to monotone CA, we recall the deﬁnition of half-space velocities w, and set K 1=w ¼ [ ½0,1=wðuÞ u:u S d1 and let L be the polar transform of K1/w, that is, L ¼ K 1=w ¼ x ℝd :hx,ui wðuÞ, for every u S d1 : In general, the polar of a set K ℝd is given by for every {x K}. The set L is known as a Wulff shape and is a very important notion in crystallography and statistical physics (Pimpinelli and Villain 1999). The next theorem was proved in the classic paper (Willson 1984). The core methods in its proof, as well as proofs of similar results (Gravner and Griffeath 1993), are those of convex and discrete geometry. Theorem 4 Assumes a monotone CA rule with all w(u) 0. Then there exists a large enough r so that for every ﬁnite initial set A0, which contains B2(0, r) \ ℤd, the linear asymptotic shape from A0 equals the Wulff shape L. Even more, the difference between At and tL is bounded: there exists a constant C, which depends on the rule and on A0, so that At tL + B2(0, C) and tL At + B2(0, C) for every t 0. Note that supercriticality is not assumed here. If w(u) = 0 for some u, then K1/w(u) is an inﬁnite object and L has dimension less than d. (The one trivial case is when w 0 and L = {0d}). Finally, note that if there exists a u so that w(u) < 0 (and hence w(u) < 0, by symmetry), then At is sandwiched between two hyperplanes which approach each other and so eventually At = ø (Fig. 3). It is also important to point out that K1/w is always a polytope, L is always a convex polytope, and both are, for small neighborhoods, readily computable by hand or by computer (Gravner and Griffeath 1996, 1997a, b). For example, the Moore neighborhood TG CA with y = 3 has K1/w with 16 vertices, of which three successive ones are (0, 1), (1, 2), and (1, 1), and the remaining 13 are

300

Growth Phenomena in Cellular Automata

Growth Phenomena in Cellular Automata, Fig. 3 The sets K1/w (left) and the asymptotic shapes for all 10 supercritical range 2 TG CA. Note that there are only 9 shapes, as those with y = 7 and y = 8 coincide

then continued by symmetry. It then follows that the limiting shape L is the convex hull of (1/2, 0), (0, 1/2),(1/3, 1/3). Matters become much murkier when the monotonicity assumption is dropped. We discuss a few interesting two-dimensional solidiﬁcation examples next. They all hinge on recursive speciﬁcation of iterates At for every t (see (Gravner and Griffeath 1998) for a deﬁnition). This is far from a general approach (and appears to fail even for simple monotone cases), but is the primary technique available. We begin with the Box 25 solidiﬁcation, starting from A0 = B2(0, r + 1/2) \ ℤ2. As was observed in (Gravner and Griffeath 1998), and can be quickly checked by computer, the linear asymptotic shape exists for r = 2, r = 9, and r = 13, but is in each case different, in fact it is convex in the ﬁrst case and nonconvex in the other two cases. This demonstrates that such shapes may depend on the initial seed. A very interesting example was discovered by D. Hickerson (private communication). Consider 2 Box 37 solidiﬁcation, with A0 = B2(0, 7/2) \ ℤ . p ﬃﬃﬃﬃﬃﬃﬃ ﬃ Then t1/2At converges to B1 0,2 2=3 as t ! 1. This demonstrates the possibility of nontrivial sublinear asymptotic shapes. We turn next to the Hex rules (Gravner and Griffeath 2006a). These exhibit subsequential limiting shapes, which are not always polygons, as we explain next. Theorem 5 Take any of the 16 Hex rules as in Theorem 3, and ﬁx a ﬁnite A0. There exists a oneparameter family of sets S a, a [0, 1], so that the following holds: for tn = a 2n,

2n Atn ! S a , as n ! 1. Furthermore, when 3 and 4 are not both on the solidiﬁcation list, the family S a is called simple and is independent of the initial set. In the opposite, diverse case, initial sets are divided into two classes, distinguished by two different families S a. For rational a, it can be shown that the Hausdorff dimension of @S a always exists and is in principle computable. For example, for the simple S a , this dimension equals 5/4 for a = 14/ 15, evidently producing a non-polygonal subsequential shape. This discussion brings forth the following question, which is probably the most interesting open problem on CA growth. For a prescribed set L, can we ﬁnd a CA with linear asymptotic shape L, attained from a “generic” collection of initial sets? In particular, can L be a circle, thereby giving rise to asymptotic isotropy? We note that the isotropic construction is possible for probabilistic CA (Gravner and Mastronarde in preparation), so it seems likely that the answer is yes for a properly constructed chaotic growth. However, techniques for such an approach are completely lacking at present. We should also remark that computational universality should allow for a construction of a CA and a carefully engineered initial state with circular (or any other) shape – although this has never been explicitly done. This would, however, violate the requirement of generic initialization. We conclude this section by a short review of reverse shapes (Gravner and Griffeath 1999a). The question here is, if the initial set A0 is a large hole, and evolves until shortly before the entire

Growth Phenomena in Cellular Automata

301

lattice is occupied, what is the resulting shape? The initial state has a large and persistent effect on the dynamics, and thus, the reverse shape geometry will depend on it. The detailed analysis depends on technical convexity arguments, but the cleanest instance is given by the following result (Fig. 4). Theorem 6 Assume a monotone CA, with w 0 but not identically 0 on Sd1. Assume also that its rule T preserves all symmetries of the lattice ℤd. Pick a closed convex set H ℝd, which has all symmetries of ℤd, and let A0 = (mH)c \ ℤd for some large m. Moreover, let T ¼ inf ft :0 At g: There is a nonempty bounded convex subset R(H) ℝd such that lim

lim

1

M !1 m!1 M

AT M ¼ RðH Þc ,

in the Hausdorff sense. Moreover, if h0 ¼ max h > 0:h H K 1=w , then RðH Þ ¼ h0 H \ @K 1=w : In words, one scales the polar H* so that it touches the boundary of K1/w; at this point, the intersection determines the reverse shape. (The shape does not change if H is multiplied by a constant, so h0 determines its natural scale). The paper (Gravner and Griffeath 1999a) has many more details and examples.

Nucleation In this section we assume that the initial state A0 is the product measure P(p), with density p > 0 that is typically very small. Initially, then, there will be no signiﬁcant activity on most of the space. Certainly this is no surprise as most of the space is

Growth Phenomena in Cellular Automata, Fig. 4 Superimposed convergence to the linear asymptotic shape and to the reverse shape, from, respectively, the interior and the exterior, of a large lattice circle. The rule is TG CA with range 2 and y = 6. Iterates are periodically shaded

empty, but isolated 1’s or small islands of them are often not able to accomplish much either. Most of the lattice is thus in a metastable state. However, at certain rare locations there may, by chance, occur local conﬁgurations, which are able to spread their inﬂuence over large distances until they statistically dominate the lattice. These locations are called nuclei, and their frequency and mechanism of growth are the main selforganizational aspects of the CA rule. The majority of results are conﬁned to two dimensions, so we will assume d = 2 for the rest of this section and relegate higher dimensions to remarks. We start with a simple example, for which we give a few details to introduce the basic ideas and demonstrate that a CA can go through more than one metastable state. For this example we do not specify the map p, but instead give a more informal description. In a conﬁguration A, we call an insurance ﬁve sites in a cross formation in the state 1, or, more formally, a translate of von Neumann neighborhood which is inside A. The map T changes any 0 with a 1 in its von Neumann neighborhood to 1. Moreover, it automatically changes any 1 to 0, except that any 1 whose von Neumann neighborhood intersects with an insurance remains 1. Then, for every > 0, as p ! 0,

302

Growth Phenomena in Cellular Automata

P 0 Act for all t p1=2þ ! 1,

have the leftmost among their lowest sites at the origin. (The last requirement ensures that n counts P 0 ðAt xor Atþ1 Þ for all p tp the number of distinct smallest “shapes” that ! 1, P 0 At for all p5=2 t ! 1: grow). We call the rule voracious if, started from any of the n initial sets A0 described above, 2 (Here, xor is the exclusive union). Roughly, A1 = ℤ . Voracity is a weak condition, which most sites are 0 up to time p1/2, then periodic assures a minimal regularity of growth and can, with period 2 up to time p5/2, and 1 afterwards. for any ﬁxed rule, be checked on ﬁnitely many (In fact, stronger statements, along the lines of cases (which is not true for the more restrictive omnivorous property). Theorem 7 below, are possible). For illustration, we brieﬂy discuss these for The proof has two phases: the ﬁrst determinisrange r Box neighborhood TG CA. For relatively tic and the second probabilistic. For the determin1 small y, g = y; for example, when r = 1, g = y istic one, let d1(x) be the ‘ distance from x to A0, for all three supercritical rules, while when r = 2, and assume that A0 contains no insurance. Then g exceeds y only for y = 10, when it equals 11. one can prove by induction that, ﬁrst, none of the For large r, and y ar2, g is asymptotically the At contains an insurance and second that for every 2 x and t d1(x), x At precisely when (t d1(x)) smallest possible (that is, g ar ) when a < ac mod2 = 0. On the other hand, an insurance in A0 for some ac (1.61,1.66) (Gravner and Griffeath centered at the origin will result in x At for 1997b). One can also compute some n, before every t d1(x) 1. The probabilistic part con- they become too large (Table 2). Returning to A0 = P(p), the most natural stasists of noting that, with overwhelming probabil1/2+ tistics to study is ity when p is small, B1(0, p ) (resp. 5/2+ B1(0, p )) contains no 1 (resp. insurance) T ¼ inf ft :0 At g, in A0 = P(p), while B1(0, p1/2 ) (resp. 5/2 B1(0, p )) does. The bulk of the mathematical theory of nucle- the ﬁrst time the CA occupies the origin. ation and metastability addresses monotone CA, although some work has been done on the Game Theorem 7 Assume a monotone, supercritical, of Life (Gotts 2003) and its generalizations and voracious CA, with nucleation parameters g (Adamatzky et al. 2006; Evans 2001), excitable and n. Then, as p ! 0, media dynamics (Durrett and Steif 1991; Fisch pﬃﬃﬃﬃﬃﬃﬃ et al. 1991, 1993; Greenberg and Hastings npg T 1978), and artiﬁcial life models (Lindgren and Nordahl 1994). converges in distribution to a nontrivial random Our ﬁrst general class is supercritical mono- variable t, which is a functional of a Poisson point tone solidiﬁcation CA. (In fact, the solidiﬁcation location P with unit intensity. assumption is not necessary, but reduces technical That T pg/2 can be easily guessed (and details so much that it is assumed in most proved), but the more precise asymptotics published works). Such rules have two nucleation described above require a considerable argument parameters. Let g be the smallest i for which there (Gravner and Griffeath 1996), as interaction exists an A0 with | A0 | = i that generates persis- between growing droplets is nontrivial. In partictent growth. Moreover, let n be the number of sets ular, the higher dimensional version has not been A0 of size g that generate persistent growth and proved, and the description of the limiting 1=2

5=2þ

Growth Phenomena in Cellular Automata, Table 2 Nucleation parameter n for small box neighborhood TG CA r=1 r=2

y=2 12 40

y=3 42 578

y=4

y=5

y=6

y=7

4,683

24,938

94,050

259,308

Growth Phenomena in Cellular Automata

“movie” from P probably cannot avoid viscosity methods from PDE (Song 2005). The most exciting nucleation results have been proved about critical models, for which w(u) vanishes for some direction u but is positive for others. Although a general framework is presented in (Gravner and Griffeath 1999b), we will instead focus on the most studied examples. Of these the most popular has been the bootstrap percolation (BP), which is TG CA with von Neumann neighborhood and y = 2 (Adler 1991; Adler et al. 1989; Aizenman and Lebowitz 1988; van Enter 1987). Its modiﬁed version (MBP) has the same neighborhood, still solidiﬁes, but when 0 2 = S, p(S) = 1 precisely when {e1} \ S 6¼ ø and {e2} \ S 6¼ ø. (Here e1 and e2 are the basis vectors). Now w(e1) = w(e2) = 0, so no ﬁnite set can generate persistent growth, and it is not immediately clear that P(T < 1) = 1. This is true (van Enter 1987), as very large sets are able to use sparse but helpful smattering of 1’s around them and so are unlikely to be stopped. To determine the size of T, one needs more information about the necessary size of these nuclei and the likelihood of their formation. This was started in (Aizenman and Lebowitz 1988) and culminated by the following theorem by A. Holroyd (Holroyd 2003), which is arguably the crowning achievement of CA nucleation theory to date. Theorem 8 For BP let l = p2/18, and for MBP let l = p2/6. Then, for every > 0, PðplogT ½l ,l þ Þ ! 1 as p ! 0. To summarize, T exp(l/p), which is for small p a long time indeed and amply justiﬁes the description of the almost empty lattice as metastable. The most common formulation of the theorem above involves ﬁnite L L squares with periodic boundary instead of inﬁnite lattices. Then I ðL,pÞ ¼ Pðthe entire square is eventually occupiedÞ and, as p ! 0,

303

I ðL,pÞ ! 1 I ðL,pÞ ! 0

if if

plogL l þ , plogL l þ :

Here L is of course assumed to increase with p. Before the value of l was known, this second formulation was used to estimate it by simulation. For example, (Adler et al. 1989) used L close to 30,000 and obtained l 0.245 for BP, about a factor of two smaller than the true value 0.548. . .. Other simulations of BP, MBP, and related models all exhibit a similar discrepancy. The reason apparently is that nuclei are, for realistic values of p, quite a bit more frequent than the asymptotics would suggest. Indeed, the following result from (Gravner and Holroyd 2008) conﬁrms this. Theorem 9 For BP and MBP, I ðL,pÞ ! 1 if

plogL l cðlogLÞ1=2 ,

for an appropriate constant c. This alone indicates that to halve the error in approximating l on an L L system, it is necessary to replace L by L4. In addition, (Gravner and Holroyd 2008) shows that for the more tractable MBP, one can do explicit calculations to conclude that to get an estimate of l within 2%, one would need L at least 10500, a non-achievable size. For BP, the quantity p log L is the “order parameter,” the quantity that, when varied, causes a phase transition (which, in addition, is sharp by Theorem 8). We will list now some other models with known order parameters – we also indicate the status of phase transition, when known: • CA with von Neumann neighborhood and p(S) = 1 when | S\{0} | 2: p2log L (Schonmann 1990) • TG CA with range r Box neighborhood, y [2r2 + r + 1, 2r2 + 2r]:py2r2rlog L (Gravner and Griffeath 1996) • TG CA with N ¼ fð0, 0Þ, ð0 1Þ, ð1,0Þ; ð2,0Þg , y = 2: p3/2 L, not sharp (Gravner and Griffeath 1996) • TG CA with N ¼ fð0, 0Þ, ð0 1Þ, ð1,0Þ; ð2,0Þg, y = 3: (log p)2p log L (Gravner

304

Growth Phenomena in Cellular Automata

and Griffeath 1996; van Enter and Hulshof 2007) • TG CA with range r cross neighborhood N ¼ fðx,yÞ: jxj p,jyj p,xy ¼ 0g and y = r + 1:p log L, sharp at l = p2/(3(r + 1)(r + 2)) (Holroyd et al. 2004. • TG CA on ℤd with N ¼ B1 ð0,1Þ \ ℤd and y [3, d], p1/(dy+1)logy1 L (where logk is the k th iterate of log) (Cerf and Manzo 2002), sharp at l = p2/6 for the modiﬁed version when y = d (Holroyd 2006) Note that when y = d = 3, the last example gives the metastable scale exp(exp(l/p)) (Cerf and Cirillo 1999; Schonmann 1992), making an even modest experimental approximation of l impossible. There are other interesting issues about critical growth models, which do not have to do with nucleation. One is decay rate for the ﬁrst passage time T (Andjel et al. 1995), which is connected to the properties of the very last holes to be ﬁlled in. Another is its ability to overtake random obstacles (Gravner and McDonald 1997). Apart from sending p ! 0, one could vary other parameters to get the metastability phenomena, and one natural example is the range. We explain this scenario on a non-monotone CA known as the Threshold Voter Automaton (TVA) (Durrett and Steif 1993; Gravner and Griffeath 1997a). For simplicity, assume N is range r Box neighborhood, and ﬁx a threshold y. This rule makes a site change its “opinion” by contact with at least y of the opposite opinions: pðS Þ ¼ 1 iff ð0 S and jS c j < yÞ or ð0 2 = S and jS j yÞ: As the two opinions are symmetric, the most natural initial state of TVA is P(1/2). We also assume that r is large and the scaling y ¼ ajN j, for some a (0, 1). It is proved in (Durrett and Steif 1993) that when a > 3/4, any ﬁxed x ℤ2 changes its opinion only ﬁnitely many times with probability approaching 1 as r ! 1 – and the rigorous results end there. The most interesting rare nucleation questions arise when a (1/4,

3/4)\{1/2}. According to simulations, under this assumption the nuclei are rare and eventually tessellate the lattice into regions of consensus with either stable or periodic boundaries (Gravner and Griffeath 1997a). However, the deﬁnition of a nucleus is unclear, and consequently their density cannot be estimated. Two torus simulations are given in Fig. 5; it is important to point out that, for such ﬁnite systems, Lyapunov methods of (Goles and Martinez 1990) imply that every site eventually ﬁxates or becomes periodic with period 2. The majority TVA, when a = 1/2, is perhaps the most appealing of all (Griffeath 1994). The nucleation is now not rare; instead, this CA quickly self-organizes into visually attractive curvature-driven dynamics. (Note that ﬂat interfaces between the two opinions are now stable, so one opinion can advance only when it forms a concavity). For any ﬁxed r this must eventually stop, as ﬁnite islands with uniformly small enough curvature of either opinion are stable. However, when r is increased this effect is with large probability not felt on any ﬁxed ﬁnite portion of space. (A similar effect is achieved by the Vichniac “twist” (Vichniac 1986)). Many fascinating questions remain about this case, especially on the initial nucleating phase, whose analysis depends on delicate properties of random ﬁelds and remains an open problem (Fig. 6).

Future Directions We will identify seven themes, which connect to open problems discussed in previous sections. Progress on each is bound to be a challenge, but also a signiﬁcant advance in understanding CA growth. Regularity of Growth It is often important, and of independent interest, to be able to conclude that a cellular automaton rule generates growth without arbitrarily large tentacles, holes, or other undesirable features. An omnivorous CA, for example, has this property. The natural goal would be to develop techniques to establish such regularity for much more

Growth Phenomena in Cellular Automata

305

Growth Phenomena in Cellular Automata, Fig. 5 Four nucleation examples, each on an 800 800 array with periodic boundary. Clockwise from top left: TGM CA with Moore neighborhood, y = 3, and p = 0.006; bootstrap percolation with p = 0.041; TVA

with r = 10 and y = 194; TVA with r = 10 and y = 260. The iterates are periodically colored to indicate growth, and, in the TVA frames, the lighter shades indicate 0’s

general monotone and non-monotone CA and for arbitrary dimension. Many rules give the impression that regular growth is a generic trait, i.e., holds for a majority of initial sets.

some initial sets, but perhaps there are other, more tractable, examples with identiﬁable mechanisms.

Oscillatory Growth Does there exist a class of CA with growing sets that oscillate on different scales? Hickerson’s Diamoeba might be able to accomplish this from

Analysis of Chaotic Growth One look at the growth of Box 1 solidiﬁcation from a 8 8 initial box (bottom left frame in Fig. 1) would convince most observers that it has a square asymptotic shape. However, there are no tools to prove, or disprove, this statement.

306

Growth Phenomena in Cellular Automata

Three-Dimensional Nucleation and Growth With advances in computer power, extensive three-dimensional CA simulations have become viable on commercial hardware. Therefore, it may be possible to investigate nucleation, droplet interaction, clustering mechanisms, and other staples of two-dimensional CA research, at least experimentally. Proper visualization tools of complex three-dimensional phenomena may well require some novel ideas in computer graphics.

Growth Phenomena in Cellular Automata, Fig. 6 Majority vote: TGM with r = 10, y = 221 on a 1,000 1,000 array with periodic boundary. Again, iterates are periodically colored with the lighter shades reserved for 0’s

A fully rigorous theory of chaotic CA, tailored to address such asymptotic issues, is almost nonexistent and constitutes perhaps the most important challenge for mathematicians in this area. Nucleation Theory for Non-monotone Models Once nucleation centers are established, growth most often proceeds in a random environment, which consists of debris leftover from the nucleation phase. This may help the analysis, as it adds a random perturbation to what may otherwise be intractable dynamics, but on the other hand random environment processes are notoriously tricky to analyze (Gravner et al. 2002). Robust Exact Constants and Sharp Transitions The nucleation phase transition has been proved sharp for a few critical models, by rather delicate arguments. A more robust approach would extend them and would perhaps provide further insights into the error terms, for which only one-sided estimates are now known. The apparent crossover (Adler et al. 1989) phenomenon would also be interesting to understand rigorously.

Generic Properties of CA with Large Range A TG CA with range r, say, has on the order of r2 possible thresholds y. When can it be established that some property holds for the majority of relevant choices? One such property (sensitivity of shapes to random perturbations in the rule) was analyzed from this perspective in (Gravner and Griffeath 2006b), but it would be interesting to provide further examples for TG or other classes of CA.

Bibliography Primary Literature Adamatzky A, Martínez GJ, Mora JCST (2006) Phenomenology of reaction-diffusion binary-state cellular automata. Int J Bifurc Chaos Appl Sci Eng 16:2985–3005 Adler J (1991) Bootstrap percolation. Phys A 171:453–4170 Adler J, Staufer D, Aharony A (1989) Comparison of bootstrap percolation models. J Phys A: Math Gen 22: L279–L301 Aizenman M, Lebowitz J (1988) Metastability effects in bootstrap percolation. J Phys A: Math Gen 21:3801–3813 Allouche J-P, Shallit J (2003) Automatic sequences: theory, applications, generalizations. Cambridge University Press, Cambridge Andjel E, Mountford TS, Schonmann RH (1995) Equivalence of decay rates for bootstrap percolation like cellular automata. Ann Inst H Poincaré 31:13–25 Berlekamp ER, Conway JH, Guy RK (2004) Winning ways for your mathematical plays, vol 4, 2nd edn. Peters, Natick Bohman T (1999) Discrete threshold growth dynamics are omnivorous for box neighborhoods. Trans Am Math Soc 351:947–983 Bohman T, Gravner J (1999) Random threshold growth dynamics. Random Struct Algorithms 15:93–111

Growth Phenomena in Cellular Automata Bramson M, Neuhauser C (1994) Survival of onedimensional cellular automata under random perturbations. Ann Probab 22:244–263 Brummitt CD, Delventhal H, Retzlaff M (2008) Packard snowﬂakes on the von Neumann neighborhood. J Cell Autom 3:57–80 Bäck T, Dörnemann H, Hammel U, Frankhauser P (1996) Modeling urban growth by cellular automata. In: Lecture notes in computer science. Proceedings of the 4th international conference on parallel problem solving from nature, vol 1141. Springer, Berlin, pp 636–645 Cerf R, Cirillo ENM (1999) Finite size scaling in threedimensional bootstrap percolation. Ann Probab 27:1837–1850 Cerf R, Manzo F (2002) The threshold regime of ﬁnite volume bootstrap percolation. Stoch Process Appl 101:69–82 Chopard B, Droz M (1998) Cellular automata modeling of physical systems. Cambridge University Press, Cambridge Cobham A (1972) Uniform tag sequences. Math Syst Theory 6:164–192 Cook M (2005) Universality in elementary cellular automata. Complex Syst 15:1–40 Deutsch A, Dormann S (2005) Cellular automata modeling of biological pattern formation. Birkhäuser, Boston Durrett R, Steif JE (1991) Some rigorous results for the Greenberg-Hastings model. J Theor Probab 4:669–690 Durrett R, Steif JE (1993) Fixation results for threshold voter systems. Ann Probab 21:232–247 Eppstein D (2002) Searching for spaceships. In: More games of no chance (Berkeley, CA, 2000). Cambridge University Press, Cambridge, pp 351–360 Evans KM (2001) Larger than life: digital creatures in a family of two-dimensional cellular automata. In: Cori R, Mazoyer J, Morvan M, Mosseri R (eds) Discrete mathematics and theoretical computer science, vol AA. pp 177–192 Evans KM (2003) Replicators and larger than life examples. In: Griffeath D, Moore C (eds) New constructions in cellular automata. Oxford University Press, New York, pp 119–159 Fisch R, Gravner J, Griffeath D (1991) Threshold-range scaling for the excitable cellular automata. Stat Comput 1:23–39 Fisch R, Gravner J, Griffeath D (1993) Metastability in the Greenberg-Hastings model. Ann Appl Probab 3:935–967 Gardner M (1976) Mathematical games. Sci Am 133:124–128 Goles E, Martinez S (1990) Neural and automata networks. Kluwer, Dordrecht Gotts NM (2003) Self-organized construction in sparse random arrays of Conway’s game of life. In: Griffeath D, Moore C (eds) New constructions in cellular automata. Oxford University Press, New York, pp 1–53 Gravner J, Griffeath D (1993) Threshold growth dynamics. Trans Am Math Soc 340:837–870

307 Gravner J, Griffeath D (1996) First passage times for the threshold growth dynamics on. Ann Probab 24:1752–1778 Gravner J, Griffeath D (1997a) Multitype threshold voter model and convergence to Poisson-Voronoi tessellation. Ann Appl Probab 7:615–647 Gravner J, Griffeath D (1997b) Nucleation parameters in discrete threshold growth dynamics. Exp Math 6:207–220 Gravner J, Griffeath D (1998) Cellular automaton growth on: theorems, examples and problems. Adv Appl Math 21:241–304 Gravner J, Griffeath D (1999a) Reverse shapes in ﬁrstpassage percolation and related growth models. In: Bramson M, Durrett R (eds) Perplexing problems in probability. Festschrift in honor of Harry Kesten. Birkhäuser, Boston, pp 121–142 Gravner J, Griffeath D (1999b) Scaling laws for a class of critical cellular automaton growth rules. In: Révész P, Tóth B (eds) Random walks. János Bolyai Mathematical Society, Budapest, pp 167–186 Gravner J, Griffeath D (2006a) Modeling snow crystal growth. I. Rigorous results for Packard’s digit snowﬂakes. Exp Math 15:421–444 Gravner J, Griffeath D (2006b) Random growth models with polygonal shapes. Ann Probab 34:181–218 Gravner J, Holroyd AE (2008) Slow convergence in bootstrap percolation. Ann Appl Probab 18:909–928 Gravner J, Mastronarde N Shapes in deterministic and random growth models (in preparation) Gravner J, McDonald E (1997) Bootstrap percolation in a polluted environment. J Stat Phys 87:915–927 Gravner J, Tracy C, Widom H (2002) A growth model in a random environment. Ann Probab 30:1340–1368 Greenberg J, Hastings S (1978) Spatial patterns for discrete models of diffusion in excitable media. SIAM J Appl Math 4:515–523 Griffeath D (1994) Self-organization of random cellular automata: four snapshots. In: Grimmett G (ed) Probability and phase transition. Kluwer, Dordrecht, pp 49–67 Griffeath D, Hickerson D (2003) A two-dimensional cellular automaton with irrational density. In: Griffeath D, Moore C (eds) New constructions in cellular automata. Oxford University Press, Oxford, pp 119–159 Griffeath D, Moore C (1996) Life without death is P-complete. Complex Syst 10:437–447 Holroyd AE (2003) Sharp metastability threshold for twodimensional bootstrap percolation. Probab Theory Relat Fields 125:195–224 Holroyd AE (2006) The metastability threshold for modiﬁed bootstrap percolation in d dimensions. Electron J Probab 11:418–433 Holroyd AE, Liggett TM, Romik D (2004) Integrals, partitions, and cellular automata. Trans Am Math Soc 356:3349–3368 Jen E (1991) Exact solvability and quasiperiodicity of one-dimensional cellular automata. Nonlinearity 4:251–276

308 Kier LB, Seybold PG, Cheng C-K (2005) Cellular automata modeling of chemical systems. Springer, Dordrecht Lindgren K, Nordahl MG (1994) Evolutionary dynamics of spatial games. Phys D 75:292–309 Meakin P (1998) Fractals, scaling and growth far from equilibrium. Cambridge University Press, Cambridge Packard NH (1984) Lattice models for solidiﬁcation and aggregation. Institute for advanced study preprint. Reprinted in: Wolfram S (ed) (1986) Theory and application of cellular automata. World Scientiﬁc, Singapore, pp 305–310 Packard NH, Wolfram S (1985) Two-dimensional cellular automata. J Stat Phys 38:901–946 Pimpinelli A, Villain J (1999) Physics of crystal growth. Cambridge University Press, Cambridge Schonmann RH (1992) On the behavior of some cellular automata related to bootstrap percolation. Ann Probab 20:174–193 Schonmann RH (1990) Finite size scaling behavior of a biased majority rule cellular automaton. Phys A 167:619–627 Song M (2005) Geometric evolutions driven by threshold dynamics. Interfaces Free Bound 7:303–318 Toffoli T, Margolus N (1997) Cellular automata machines. MIT Press, Cambridge van Enter ACD (1987) Proof of Straley’s argument for bootstrap percolation. J Stat Phys 48:943–945 van Enter ACD, Hulshof T (2007) Finite-size effects for anisotropic bootstrap percolation: logarithmic corrections. J Stat Phys 128:1383–1389 Vichniac GY (1984) Simulating physics with cellular automata. Phys D 10:96–116 Vichniac GY (1986) Cellular automata models of disorder and organization. In: Bienenstock E, Fogelman-SoulieF, Weisbuch G (eds) Disordered systems and biological organization. Springer, Berlin, pp 1–20 Wiener N, Rosenblueth A (1946) The math foundation of the problem of conduction of impulses in a network of connected excitable elements, speciﬁcally in cardiac muscle. Arch Inst Cardiol Mex 16:205–265 Willson SJ (1978) On convergence of conﬁgurations. Discret Math 23:279–300

Growth Phenomena in Cellular Automata Willson SJ (1984) Cellular automata can generate fractals. Discret Appl Math 8:91–99 Willson SJ (1987) Computing fractal dimensions for additive cellular automata. Phys D 24:190–206 Wójtowicz M (2001) Mirek’s celebration: a 1D and 2D cellular automata explorer, version 4.20. http://www. mirwoj.opus.chelm.pl/ca/

Books and Reviews Adamatzky A (1995) Identiﬁcation of cellular automata. Taylor & Francis, London Allouche J-P, Courbage M, Kung J, Skordev G (2001) Cellular automata. In: Encyclopedia of physical science and technology, vol 2, 3rd edn. Academic Press, San Diego, pp 555–567 Allouche J-P, Courbage M, Skordev G (2001b) Notes on cellular automata. Cubo, Matemática Educ 3:213–244 Durrett R (1988) Lecture notes on particle systems and percolation. Wadsworth & Brooks/Cole, Paciﬁc Grove Durrett R (1999) Stochastic spatial models. SIAM Rev 41:677–718 Gravner J (2003) Growth phenomena in cellular automata. In: Griffeath D, Moore C (eds) New constructions in cellular automata. Oxford University Press, New York, pp 161–181 Holroyd AE (2007) Astonishing cellular automata. Bull Centre Rech Math 10:10–13 Ilachinsky A (2001) Cellular automata: a discrete universe. World Scientiﬁc, Singapore Liggett TM (1985) Interacting particle systems. Springer, New York Liggett TM (1999) Stochastic interacting systems: contact, voter and exclusion processes. Springer, New York Rothman DH, Zaleski S (1997) Lattice-gas cellular automata. Cambridge University Press, Cambridge Toom A (1995) Cellular automata with errors: problems for students of probability. In: Snell JL (ed) Topics in contemporary probability and its applications. CRC Press, Boca Raton, pp 117–157

Emergent Phenomena in Cellular Automata James E. Hanson IBM T.J. Watson Research Center, Yorktown Heights, NY, USA

Article Outline Glossary Deﬁnition of the Subject Introduction Synchronization Domains in One Dimension Particles in One Dimension Emergent Phenomena in Two and Higher Dimensions Future Directions Bibliography

Glossary Cellular automaton A spatially-extended dynamical system in which spatially-discrete cells take on discrete values, and evolve according to a spatially-localized discretetime update rule. Emergent phenomenon A phenomenon that arises as a result of a dynamical system’s intrinsic dynamical behavior. Domain A spatio-temporal region of a cellular automation that conforms to a speciﬁc pattern. Particle A spatially-localized region of a cellular automaton that exists as a boundary or defect in a domain, and persists for a signiﬁcant amount of time.

Definition of the Subject In a dynamical system, an “emergent” phenomenon is one that arises out of the system’s own dynamical behavior, as opposed to being introduced from outside. Emergent phenomena are

ubiquitous in the natural world; as just one example, consider a shallow body of water with a sandy bottom. It often happens that small ridges form in the sand. These ridges emerge spontaneously, have a characteristic size and shape, and move across the bottom in a characteristic way – all due to the interaction of the sand and the water. In cellular automata (CA), the system’s state consists of an N-dimensional array of discrete cells that take on discrete values and the dynamics is given by a discrete time update rule (see below). The “phenomena” that emerge in CA therefore necessarily consist of spatio-temporal patterns and/or statistical regularities in the cell values. Therefore, the study of emergent phenomena is CA is the study of the spatio-temporal patterns and statistical regularities that arise spontaneously in cellular automata.

Introduction The study of emergent phenomena in cellular automata dates back at least to the beginnings of the modern era of CA investigation inaugurated by Stephen Wolfram and collaborators. Indeed, it was a central theme of the landmark paper that introduced the four “Wolfram classes” (Wolfram 1984a) shown in Fig. 1. Ever since, emergent phenomena have been the driving force behind a great deal of CA research. To be genuinely emergent, a phenomenon must arise out of conﬁgurations in which it is not present; and furthermore, to be of any signiﬁcance, it must do so with non-vanishing likehood, and persist for a measurable amount of time. Thus the proper study of emergent phenomena in CA excludes from consideration a broad subcategory of systems in which the initial condition and update rule are chosen a priori to exhibit some particular structural feature (lattice gases are a representative example). The fact that such systems are CA is an implementation detail; the CA is merely a substrate or means for the simulation of higher-order structures. Note also that the

# Springer-Verlag 2009 A. Adamatzky (ed.), Cellular Automata, https://doi.org/10.1007/978-1-4939-8700-9_51 Originally published in R. A. Meyers (ed.), Encyclopedia of Complexity and Systems Science, # Springer-Verlag 2009 https://doi.org/10.1007/978-0-387-30440-3_51

309

310

Emergent Phenomena in Cellular Automata

Emergent Phenomena in Cellular Automata, Fig. 1 Examples of Wolframs four qualitative classes. (a) Class 1: Spatiotemporally uniform conﬁguration of ECA 32. (b) Class 2: Separated simple or periodic structures of ECA 44. (c) Class 3: Chaotic space-time pattern of ECA 90. (d) Class 4: Complex localized structures of Binary radius-2 CA 1771476584. In all cases the initial condition is random. In this and subsequent ﬁgures, cells with value 0 are shown as white squares, cells with value 1 are black

essential issue is not whether the phenomena were intentionally designed into the CA rule; it is whether they arise naturally with any degree of frequency from conﬁgurations in which they are not present. Notation and Terminology A cellular automaton (CA) consists of a discrete N-dimensional array of sites or cells and a discrete-time local update rule f applied to all cells in parallel. The location of a cell is given by the N integervalued coordinates {i, j, k, . . .}. Cells take on values in a discrete set or alphabet, conventionally written 0, 1, . . ., k – 1, with k the alphabet size. An assignment of values to cells is called the conﬁguration of those cells. The value 0 is sometimes treated as a special “quiescent” value, particularly in rules that obey the quiescence condition f(. . .0. . .) = 0. The local update rule determines the value of a cell at time t + 1 as a function of the values at time t of the cells around it. Typical neighborhoods are

symmetrical, centered on the cell to be updated, and are parametrized by the radius r, which is the greatest distance from the center cell to any cell in the neighborhood. An assignment of values to the cells in a neighborhood is called a parent neighborhood, denoted by , and the value f() to which that parent neighborhood is mapped under the local update rule is its child value. The set of ordered pairs {, f()} is the rule table. The speed of light of a CA is the maximal rate at which information about a cell’s value may travel; in general it is given by the radius r. In two dimensions there are two common alternatives for the neighborhood’s shape: the von Neumann neighborhood includes the center cell and its four neighbors up, down, left, and right; and the Moore neighborhood, which also includes the four cells diagonally adjacent to the center cell. The so-called elementary cellular automata (ECA) are one-dimensional CA with k = 2, r = 1; a cell is denoted si, takes on values in {0, 1} and evolves over time according to the rule

Emergent Phenomena in Cellular Automata

i iþ1 sitþ1 ¼ f si1 . A neighborhood cont , st , st sists of three consecutive cells, so there are 8 distinct parent neighborhoods and 256 different rule tables. It is convenient to refer to an elementary CA by its rule number, which is determined as follows. The different parent neighborhoods are regarded as numbers in base k and are arranged in decreasing numerical order, from left to right. Immediately beneath each parent neighborhood its child value f() is written. The rule number is obtained by regarding the sequence of child symbols as another number, again in base k. This numbering scheme may be used for one-dimensional CA with any k and r, and may be extended to higher-dimensional CA by the adoption of a convention for assigning numerical values to parent neighborhoods. Different formulations of the local update rule are possible for CA in which symmetry or other constraints are present. For example, one important subclass of CA rules are the totalistic rules, in which the child value depends only on the sum of the values in the parent neighborhood, not on their positions. Totalistic rules may also be assigned a rule number, by writing down the different possible sums of cell values in the parent neighborhood in order, writing the child cell beneath each such sum, and interpreting the sequence of child cells as a number. In describing patterns in one-dimensional conﬁgurations, it is convenient to adopt a simpliﬁed form of regular expression notation, as follows: • symbols 0, 1, . . ., k 1 denote literal cell values • the symbol S denotes a “wild card” that may take on any value in the alphabet • the expression x* denotes any number of repetitions of the pattern x • [. . .] denotes grouping • concatenation denotes spatial adjacency. For example, 0* represents any number of consecutive 0s, while (Hanson and Crutchﬁeld 1997)* 1 is any conﬁguration consisting of some number of repetitions of the pattern 10 followed by a 1: e.g., 101, 10101, 1010101, and so forth.

311

Synchronization Possibly the simplest type of emergent phenomenon in CA is synchronization, which is the growth of spatial regions in which all cells have the same value. A synchronized region remains synchronized over time (except possibly at its borders) and it may either temporally invariant (i.e., the cell values to not change in time) or periodic (the cells all cycle together through the same temporal sequence of values). The temporal periodicity in the latter case is not greater than the alphabet size k. About the trivial case in which the CA rule maps all neighborhoods to the same value (e.g., ECA 0 or ECA 255), there is little to be said. However, other cases exist in which the synchronized regions emerge only gradually. Characteristic examples in one dimension are shown in Fig. 1a, c. It is evident from these examples that any initial condition can be roughly, but usefully, described in terms of four patterns: (a) pattern 0*, which represents the synchronized regions; (b and c) boundary regions 0* S* and S* 0*; and (d) S* for the interior of the non-synchronized regions. The behavior of the boundary regions determines whether the synchronized regions grow or shrink. For example, in ECA 32 (Fig. 1a), the parent neighborhoods in the boundary region are = {0SS, SS0}, all of which have child value 0; this means that the synchronized region grows as fast as is possible. Also not that since the only parent neighborhood that is not mapped to 0 is = 101. the time taken for a given conﬁguration in ECA 32 to reach a globally synchronized state is governed by the length of the longest region of pattern (Hanson and Crutchﬁeld 1997)* 1. In general, the growth (or shrinkage) of synchronized regions is determined by the aggregate behavior of the neighborhoods that occur its boundaries; if they recede from each other, the region will grow. The boundaries need not move at the speed of light; the left and right boundaries need not move at the same speed; and their motion need not be perfectly uniform over time. Figure 2a shows ECA 55, in which synchronized regions with temporal period p = 2 emerge from random initial conditions. Note, however,

312

Emergent Phenomena in Cellular Automata

Emergent Phenomena in Cellular Automata, Fig. 2 Synchronization and phase defects: (a) ECA 55. (b) ECA 17

that multiple distinct synchronized regions persist indeﬁnitely. This is an example of a temporal phase defect, which is a boundary between spatio-temporal regions that have the same overall pattern, but one of which is ahead of the other in time. In general, phase defects need not be stationary: an example is shown in Fig. 2b. Also note that for CA with k > 2 it is possible for several different synchronized patterns to emerge and coexist. For example, consider a CA with k = 3 in which the pattern 0* is temporally invariant, while 1* and 2* are mapped into each other to form a period-2 cycle.

Domains in One Dimension Synchronization is a special case of a more general emergent phenomenon, the domain. A domain is spatial region that conforms to some speciﬁc pattern which persists over time. As has been seen in the case of synchronization, the emergence of a domain is governed by the behavior of its boundaries. An important subclass of domain is the regular domain, in which the spatial pattern may be expressed in terms of a regular language (or equivalently, a ﬁnite state machine) (Hopcroft and Ullman 1979). As deﬁned in (Hanson and Crutchﬁeld 1992), a regular domain has two properties: all spatial sequences of cells in the domain are in a given regular language; and (2) the set of all sequences in that regular language is itself temporally invariant or periodic. Regular domains are a powerful tool for identifying and analyzing emergent phenomena in CA of one dimension. Generalization to two or more dimensions has proven challenging, though (Lindgren et al. 1998) made a signiﬁcant step in that direction. In studying domains in CA, it is useful to pass the space-time data through a domain ﬁlter to

help visualize them. A domain ﬁlter, which may be constructed for any regular domain, maps every cell that is in the domain to a chosen value (0, say) and maps all cells not in the domain to other values in a prescribed way. Multi-domain ﬁlters may be constructed in a similar fashion, to map cells in any of a set of distinct domains L1, L2, . . . onto distinct values s1, s2, . . .. See (Crutchﬁeld and Hanson 1993) for details. An illustrative example is ECA 54, shown in Fig. 3. On the left is the unﬁltered data; and on the right, the same data after passing through the domain ﬁlter for ECA 54’s primary domain. The domain has temporal period p = 2 and alternates between patterns [0001] and [110] The two patterns line up to form the interlocking white and black “T” shapes visible in the unﬁltered data. As the ﬁltered plot clearly shows, the cells not in the domain have patterns of their own; this will be discussed in the next section. For now, it is sufﬁcient to note that, in addition to the temporal phase defects seen in the emergence of temporally periodic synchronized regions, domains with nontrivial spatial structure may also show spatial phase defects, in which the pattern, in effect, skips or slips by a few cells. The spatial regions that make up a domain may themselves contain disorder; such domains are called chaotic. ECA 90 is the archetypical example of this see Fig. 1c. From a random initial condition, ECA 90 quickly evolves so that entire conﬁguration is in the domain [0S]*. ECA 18 see Fig. 4a, attempts to do the same, except that the global synchronization is frustrated by long-lived spatial phase defects. This is clearly visible in the ﬁltered space-time diagram shown in Fig. 4b. In this case the boundaries of the domain are inherently ambiguous: the pattern [0S]*[00]*[S0]* contains exactly one spatial phase defect, but it may be regarded as lying anywhere in the central [00]* region.

Emergent Phenomena in Cellular Automata

313

Emergent Phenomena in Cellular Automata, Fig. 3 Raw and domain-ﬁltered space-time diagrams of ECA 54

Emergent Phenomena in Cellular Automata, Fig. 4 Raw and domain-ﬁltered ECA 18

The ﬁlter used maps all cells in regions that contain a spatial phase defect to 1s. A single CA may support the emergence of multiple different domain patterns. In many cases one domain dominates and will eventually take over. But this is not always true. An interesting case in which two domains, both chaotic, compete on roughly equal status, is binary radius-2 rule 2614700074, shown in Fig. 5. The two domains have patterns L0 = [0S]* and L1 = [110S]*, respectively. In the ﬁltered plot, cells in L0 are shown in white, cells in L1 are gray, and all other cells are black. It appears that by about t = 200

L0 appears to be winning, but in fact, by about t = 700, the entire conﬁguration was in L1, where it remained indeﬁnitely. Depending on the initial condition, one or the other domain was always found to eventually take over with L0 winning about 80% of the time. The coexistence of multiple domains, each with its own spatial structure, gives rise to a large number of possible interfaces. In general, the number of distinct interface types is governed by the complexity of the pattern in each domain; for 2614700074 it turns out that there are 8 distinct possibilities. Six of these show qualitatively distinct behavior, and are

314

Emergent Phenomena in Cellular Automata

Emergent Phenomena in Cellular Automata, Fig. 5 Multiple coexisting chaotic domains

plotted (in ﬁltered form only) in Fig. 6. Note that of the six interfaces, two show a quickly growing region in which defects continually multiply, three of them appear to remain spatially localized, and one (at bottom left) is ambiguous.

Particles in One Dimension An immediate consequence of the emergence of domains is the simultaneous emergence of boundaries between them. These boundaries may be phase defects, as mentioned in section “Synchronization”, but they may also take the form of particles. A particle is a small region of cells that separates two domains, persists for a relatively long period of time and remains spatially localized. Particles may be stationary or may move; they may themselves exhibit a pattern that is temporally invariant, periodic, or even disordered. Solitons An interesting type of particle emerges in the so-called soliton CA, shown in Fig. 7. These CA rules received their name in analogy with the solitons of ﬂuid dynamics, which are solitary traveling waves with the interesting property that two solitons may collide, interact, and pass safely through each other, ultimately recovering their original form as if no collision had taken place. In soliton CA, something similar occurs.

Emergent Phenomena in Cellular Automata, Fig. 6 Domain interfaces in the CA of Fig. 5

In the simplest case, k = 2, the quiescence condition holds with the usual quiescent symbol 0. The solitons or particles embedded in a large lattice of 0s are ﬁnite sequences of 1s and 0s that are both

Emergent Phenomena in Cellular Automata

315

Emergent Phenomena in Cellular Automata, Fig. 7 Examples of solitons in the onedimensional Filtering Rule

temporally periodic (up to a spatial shift) and can collide and pass through each other without being destroyed. A particle consists of a ﬁnite sequence of basic strings of length r + 1 (where r is the CA radius). The leftmost cell of a particle is always a non-quiescent cell. A particle is bounded on the right by a sequence of r + 1 quiescent cells. Under the action of the CA rule, a particle may move to the left or right, may grow or shrink, but ultimately will come back to its original conﬁguration after a ﬁnite time p – though possibly shifted by some number of cells. The ratio of the shift and temporal period p determines the particle’s velocity V deﬁned in the obvious way: V = (spatial shift)/(temporal period). A particle may even temporarily split into two or more smaller particles, so long as eventually they rejoin to form the original conﬁguration. And, as the name implies, two particles with different velocities may collide and pass through each other without being destroyed. Particles and Defects Defined by Domains Given the wide variety of domains that arise in CA, the resultant variety of particles that they support is apparently limitless. However, two simple examples may sufﬁce to illustrate these phenomena: ECA 18 and ECA 54, both of which were discussed in the previous section. Particles in ECA 18 The spatial phase defects that occur in the domain of ECA 18 (see Fig. 4b) appear, on casual inspection, to be moving more or less at random. It turns out that to a very good approximation, an isolated defect performs a random walk on the lattice (Eloranta and Nummelin 1992; Grassberger 1984). When two of them meet, they mutually annihilate. This

Emergent Phenomena in Cellular Fig. 8 Long-term behavior of ECA 18

Automata,

behavior is purely deterministic, of course; it is caused entirely by the iterated action of the update rule on the initial condition. In effect, the disorder in the domains is causing disorder in the motion of their boundaries. For small systems, and eventually on all systems, ﬁnite-size effects cause departures from statistical randomness; but otherwise, except for a few highly atypical system-sizes, the defects’ behavior is statistically indistinguishable from random motion. Figure 8 shows the long-term behavior of a random initial condition on a relatively large lattice. Particles in ECA 54 ECA 54 represents an interesting case which can serve to illustrate many the emergent phenomena in one dimensional CA (Boccara et al. 1991; Hanson and Crutchﬁeld 1997). The primary domain gives rise to the so-called “fundamental particles”

316

Emergent Phenomena in Cellular Fig. 9 Fundamental particles in ECA54

Emergent Phenomena in Cellular Automata

Automata,

a, b and g, shown in Fig. 9. The unﬁltered spacetime diagrams are shown on the left, and their ﬁltered counterparts on the right. The interactions between the fundamental particles are shown in Fig. 10. In the ﬁltered ﬁgures, the numbers inscribed in the black squares are the different outputs of the domain ﬁlter; each different sequence of numbers represents a different way in which the domain pattern has been violated. The long-term behavior of the particles can be seen in Fig. 11. The bs decay relatively quickly, leaving only as and gs – except for rare cases where a b is created by the interaction in Fig. 10e and persists for a short while, and rarer cases where some other pattern is momentarily present. (Note that the scale of the ﬁgure is so compressed that only the as are visible.) It appears, and is borne out by numerical experiments, that the number of as decays extremely slowly, and that the system settles into a state in which the as are roughly equidistant, but move back and forth slightly in a

Emergent Phenomena in Cellular Automata, Fig. 10 Pairwise interactions between fundamental particles in ECA 54

disordered way. Unlike the case of ECA 18, the domains are not disordered, so the particle motion cannot be caused by disorder in the domain. Instead, it comes from the a–g interactions.

Emergent Phenomena in Two and Higher Dimensions As might be expected, the emergent phenomena in CA of more than one spatial dimension are at

Emergent Phenomena in Cellular Automata

317

once richer and less systematically studied. All of the phenomena that are observed in one dimension have their analogues in higher dimensions:

Emergent Phenomena in Cellular Fig. 11 Long-term behavior of ECA 54 Emergent Phenomena in Cellular Automata, Fig. 12 Conway’s Game of Life, starting from a random initial condition. (a) t = 0. (b) t = 50. (c) t = 900. (d) t = 1350

Automata,

domains and particle abound. In 2 or more dimensions, “particle” is no longer synonymous with “boundary”; one sees particles that are entirely surrounded by a domain, and spatially-extended boundaries that separate domains. Fundamentally new types of emergent phenomena appear as well. Domains, Particles, and Interfaces Many of the coherent structures found to exist in Conway’s famous Game of Life can be observed to arise spontaneously from random initial conditions, so they properly fall into the category of emergent phenomena. In Fig. 12 a conﬁguration of 100 100 cells is shown at four successive times t = 0, 50, 900,1350. From the random initial condition, a background pattern of 0s quickly emerges, against which there exist a rich variety of particles and disordered structures. By t = 1350 the conﬁguration has settled to its ﬁnal state, in which only a few particles remain, all of which are stationary and have temporal period p = 1 or

318

Emergent Phenomena in Cellular Automata

Emergent Phenomena in Cellular Automata, Fig. 13 Variant on Conway’s Game of Life, starting from the same random initial condition as in Fig. 12. (a) t = 10. (b) t = 100

p = 2. At intermediate times, various moving structures may be identiﬁed: see, for example, the “glider” at t = 900, about halfway between the center and the top. In moving about, these inevitably collide with each other or with the stationary particles, eventually leading to the ﬁnal state. Interestingly enough, a minor variation on the rule gives rise to the patterns shown in Fig. 13. Small regions of horizontal or vertical stripes emerge quickly. Boundaries between them settle down. By t = 100, a few non-striped areas persist, along with a few “dotted lines” that take the place of a stripe, and in which the “dots” oscillate. The non-striped areas eventually all disappear. The dotted lines persist indeﬁnitely. As these examples suggest, 2-dimensional CA support the emergence of synchronized regions, “domains”, and particles in close analogy to 1-D CA. The striped regions in Fig. 13 are an example of a two-dimensional, temporally-invariant domain. Fundamentally new features also appear in two and higher dimensions as well. The most obvious of these is the spatially-extended interface or boundary between two adjacent domains. Unlike the one-dimensional case, in which particles and interfaces are more or less the same thing, interfaces in two dimensions are themselves onedimensional. A characteristic example is seen in the voting rule, a 2-D binary CA with von Neumann neighborhood, in which the child cell is determined by the majority of the local update rule maps a the child cell is equal to the value held by the majority of cells in the parent

neighborhood, or if the vote is a tie, by a 0. Figure 14a shows a snapshot at t = 50 of the voting rule starting from a random initial condition. The system has organized itself into regions of two domain patterns. The pattern has stabilized by this time and does not change thereafter. A stochastic variation on the voting rule uses a random variable to break tie votes, resulting it patterns such as Fig. 14b–d. Over time, the long boundaries gradually straighten, and small regions of one domain embedded in the other gradually shrink. A number of extensive tours of patterns observed in selected 2-d CA may be found online; see, for example, (Griffeath 2008; Wojtowicz 2008). Spiral Waves Another important class of patterns in 2-D CA are expanding wavelike patterns, as shown in Fig. 15. These are typical of the class of rules called cyclic CA (Fisch et al. 1991), and generally evolve to conﬁgurations of spirals (as shown). These patterns are not domains in the usual sense, because they have a geometric center. The shape of the spiral is closely related to the shape of the parent neighborhood. Starting from a random initial condition, eventually some number of centers form out from which the spiral waves emanate. Quasiperiodicity The ﬁnal phenomenon to be mentioned here is an intriguing form of emergent phenomenon fundamentally different from what has been discussed above: the emergence of quasiperiodic

Emergent Phenomena in Cellular Automata

319

Emergent Phenomena in Cellular Automata, Fig. 14 Two variants of voter rule. (a) Voter rule at t = 50. This conﬁguration is time-invariant. (b) Voter rule with random tiebreaking at t = 50. (c) Voter rule with random tiebreaking at t = 250. (d) Voter rule with random tiebreaking at t = 750

Emergent Phenomena in Cellular Automata, Fig. 15 Spiral waves. (a) Cyclic CA with k = 16, von Neumann neighborhood. (b) Cyclic CA with k = 16, Moore neighborhood

oscillations in coarse statistical properties of the conﬁguration (such as, percentage of 1s). (Chate and Manneville 1992; Gallas et al. 1992) The evidence consists of return maps, in which the fraction mt of 1s at time t, is plotted against the fraction mt + 1 at time t + 1. A synchronized system would show a return map consisting of a single point: mt = mt + 1. A periodic system would show a sequence of points for the different values of

m at the different temporal phases of the sequence, and would have mt = mt + p, where p is the period. The observed return plots, however, showed the characteristic shape of quasiperiodic behavior in nonlinear dynamical systems, which is a sequence of points that eventually map out a roughly continuous, closed curve in the plane. This quasiperiodic behavior was found to occur only in CA of dimension N > 3.

320

Future Directions This short survey has only been able to hint at the vast wealth of emergent phenomena that arise in CA. Much work yet remains to be done, in classifying the different structures, identifying general laws governing their behavior, and determining the causal mechanisms that lead them to arise. For example, there are as yet no general techniques for determining whether a given domain is stable in a given CA; for characterizing the set of initial conditions that will eventually give rise to it; or for working out the particles that it supports. In CA or two or more dimensions, a large body of descriptive results are available, but these are more frequently anecdotal than systematic. A signiﬁcant barrier to progress has been the lack of good mathematical techniques for identifying, describing, and classifying domains. One promising development in this area is an information-theoretic ﬁltering technique that can operate on conﬁgurations of any dimension (Shalizi et al. 2006).

Bibliography Primary Literature Boccara N, Nasser J, Roger M (1991) Particlelike structures and their interactions in spatio-temporal patterns generated by one-dimensional deterministic cellular automaton rules. Phys Rev A 44:866 Chate H, Manneville P (1992) Collective behaviors in spatially extended systems with local interactions and synchronous updating. Profress Theor Phys 87:1 Crutchﬁeld JP, Hanson JE (1993) Turbulent pattern bases for cellular automata. Physica D 69:279 Eloranta K, Nummelin E (1992) The kink of cellular automaton rule 18 performs a random walk. J Stat Phys 69:1131 Fisch R, Gravner J, Griffeath D (1991) Threshold-range scaling of excitable cellular automata. Stat Comput 1:23–39 Gallas J, Grassberger P, Hermann H, Ueberholz P (1992) Noisy collective behavior in deterministic cellular automata. Physica A 180:19 Grassberger P (1984) Chaos and diffusion in deterministic cellular automata. Phys D 10:52 Griffeath D (2008) The primordial soup kitchen. http:// psoup.math.wisc.edu/kitchen.html Hanson JE, Crutchﬁeld JP (1992) The attractor-basin portrait of a cellular automaton. J Stat Phys 66:1415

Emergent Phenomena in Cellular Automata Hanson JE, Crutchﬁeld JP (1997) Computational mechanics of cellular automata: an example. Physica D 103:169 Hopcroft JE, Ullman JD (1979) Introduction to automata theory, languages, and computation. Addison-Wesley, Reading Lindgren K, Moore C, Nordahl M (1998) Complexity of two-dimensional patterns. J Stat Phys 91:909 Shalizi C, Haslinger R, Rouquier J, Klinker K, Moore C (2006) Automatic ﬁlters for the detection of coherent structure in spatiotemporal systems. Phys Rev E 73:036104 Wojtowicz M (2008) Mirek’s cellebration. http://www. mirekw.com/ca/ Wolfram S (1984a) Universality and complexity in cellular automata. Physica D 10:1

Books and Reviews Das R, Crutchﬁeld JP, Mitchell M, Hanson JE (1995) Evolving globally synchronized cellular automata. In: Eshelman LJ (ed) Proceedings of the sixth international conference on genetic algorithms. Morgan Kaufmann, San Mateo Gerhardt M, Schuster H, Tyson J (1990) A cellular automaton model of excitable medai including curvature and dispersion. Science 247:1563 Gutowitz HA (1991) Transients, cycles, and complexity in cellular automata. Phys Rev A 44:R7881 Henze C, Tyson J (1996) Cellular automaton model of three-dimensional excitable media. J Chem Soc Faraday Trans 92:2883 Hordijk W, Shalizi C, Crutchﬁeld J (2001) Upper bound on the products of particle interactions in cellular automata. Physica D 154:240 Iooss G, Helleman RH, Stora R (eds) (1983) Chaotic behavior of deterministic systems. North-Holland, Amsterdam Ito H (1988) Intriguing properties of global structure in some classes of ﬁnite cellular automata. Physica 31D:318 Jen E (1986) Global properties of cellular automata. J Stat Phys 43:219 Kaneko K (1986) Attractors, basin structures and information processing in cellular automata. In: Wolfram S (ed) Theory and applications of cellular automata. World Scientiﬁc, Singapore, p 367 Langton C (1990) Computation at the Edge of Chaos: phase transitions and emergent computation. Physica D 42:12 Lindgren K (1987) Correlations and random information in cellular automata. Complex Syst 1:529 Lindgren K, Nordahl M (1988) Complexity measures and cellular automata. Complex Syst 2:409 Lindgren K, Nordahl M (1990) Universal computation in simple one-dimensional cellular automata. Complex Syst 4:299 Mitchell M (1998) Computation in cellular automata: a selected review. In: Schuster H, Gramms T (eds) Nonstandard computation. Wiley, New York

Emergent Phenomena in Cellular Automata Packard NH (1984) Complexity in growing patterns in cellular automata. In: Demongeot J, Goles E, Tchuente M (eds) Dynamical behavior of automata: theory and applications. Academic, New York Packard NH (1985) Lattice models for solidiﬁcation and aggregation. In: Proceedings of the ﬁrst international symposium on form, Tsukuba Pivato M (2007) Defect particle kinematics in onedimensional cellular automata. Theor Comput Sci 377:205–228

321 Weimar J (1997) Cellular automata for reaction-diffusion systems. Parallel Comput 23:1699 Wolfram S (1984b) Computation theory of cellular automata. Commun Math Phys 96:15 Wolfram S (1986) Theory and applications of cellular automata. World Scientiﬁc Publishers, Singapore Wuensche A, Lesser MJ (1992) The global dynamics of cellular automata. Santa Fe Institute Studies in the Science of Complexity, Reference vol 1. AddisonWesley, Redwood City

Dynamics of Cellular Automata in Noncompact Spaces Enrico Formenti1 and Petr Kůrka2,3 1 Laboratoire I3S – UNSA/CNRS UMR 6070, Université de Nice Sophia Antipolis, Sophia Antipolis, France 2 Département d’Informatique, Université de Nice Sophia Antipolis, Nice, France 3 Center for Theoretical Study, Academy of Sciences and Charles University, Prague, Czechia

Article Outline Glossary Deﬁnition of the Subject Introduction Dynamical Systems Cellular Automata Submeasures The Cantor Space The Periodic Space The Toeplitz Space The Besicovitch Space The Generic Space The Space of Measures The Weyl Space Examples Future Directions Bibliography

Glossary Almost equicontinuous CA A CA which has at least one equicontinuous conﬁguration. Attraction basin The set of conﬁgurations whose orbit is eventually attracted by an attractor. Attractor A closed invariant set which attracts all orbits in some of its neighborhood. Besicovitch pseudometrics A pseudometric that quantiﬁes the upper-density of differences.

Blocking word A word that interrupts the information ﬂow. A conﬁguration containing an inﬁnite number of blocking words both to the right and to the is equicontinuous in the Cantor topology. Equicontinuous CA A CA in which all conﬁgurations are equicontinuous. Equicontinuous conﬁguration A conﬁguration for which nearby conﬁgurations remain close. Expansive CA Two distinct conﬁgurations, no matter how close, eventually separate during the evolution. Generic space The space of conﬁgurations for which upper-density and lower-density coincide. Sensitive CA In any neighborhood of any conﬁguration there exists a conﬁguration such that the orbits of the two conﬁgurations eventually separate. Spreading set A clopen invariant set propagating both to the left and to the right. Toeplitz space The space of regular quasiperiodic conﬁgurations. Weyl pseudometrics A pseudometric that quantiﬁes the upper density of differences with respect to all possible cell indices.

Definition of the Subject In topological dynamics, the assumption of compactness is usually adopted as it has far reaching consequences. Each compact dynamical system has an almost periodic point, contains a minimal subsystem, and each trajectory has a limit point. Nevertheless, there are important examples of non-compact dynamical systems like linear systems on ℝn and the theory should cover these examples as well. The study of dynamics of cellular automata (CA) in the compact Cantor space of symbolic sequences starts with Hedlund (1969) and is by now a ﬁrmly established discipline (see e.g., ▶ “Topological Dynamics of Cellular Automata”). The study of dynamics of CA in

# Springer-Verlag 2009 A. Adamatzky (ed.), Cellular Automata, https://doi.org/10.1007/978-1-4939-8700-9_138 Originally published in R. A. Meyers (ed.), Encyclopedia of Complexity and Systems Science, # Springer-Verlag 2009 https://doi.org/10.1007/978-0-387-30440-3_138

323

324

non-compact spaces like Besicovitch or Weyl spaces is more recent and provides an interesting alternative perspective. The study of dynamics of cellular automata in non-compact spaces has at least two distinct origins. The ﬁrst concerns the study of dynamical properties on peculiar countable dense sub-spaces of the Cantor space (the space of ﬁnite conﬁguration or the space of spatially periodic conﬁgurations, for instance). The idea is that on those spaces, some properties are easier to prove than on the full Cantor space. Once a property is proved on such a subspace, one can try to lift it to the original Cantor space by using denseness. Another advantage is that the conﬁgurations on these spaces are easily representable on computers. Indeed, computer simulations and practical applications of CA usually take place in these subspaces. The second origin is connected to the question of suitability of the classical Cantor topology for the study of chaotic behavior of CA and of symbolic systems in general. We brieﬂy recall the motivations. Consider sensitivity to initial conditions for a CA in the Cantor topology. The shift map s, which is a very simple CA, is sensitive to initial conditions since small perturbations far from the central region are eventually brought to the central part. However, from an algorithmic point of view, the shift map is very simple. We are inclined to regard a system as chaotic if its behavior cannot easily be reconstructed. This is not the case of the shift map whose chaoticity is more an artifact of the Cantor metric, rather than an intrinsic property of the system. Therefore, one may want to deﬁne another metric in which sensitive CA not only transport information (like the shift map) but also build/destroy new information at each time step. This basic requirement stimulated the quest for alternative topologies to the classical Cantor space. This lead ﬁrst to the Besicovitch topology and then to the Weyl topology in Cattaneo et al. (1997) used to investigate almost periodic real functions (see Besicovitch 1954; Iwanik 1988). Both these pseudometrics can be deﬁned starting from suitable semi-measures on the set ℤ of integers. This way of construction had a Pandora

Dynamics of Cellular Automata in Noncompact Spaces

effect opening the way to many new interesting topological spaces. Some of them are reported in this paper; others can be found in Cervelle and Formenti (▶ “Algorithmic Complexity and Cellular Automata”). Each topology focuses on some peculiar aspects of the dynamics under study but all of them have a common denominator, namely non-compactness.

Introduction A given CA over an alphabet A can be regarded as a dynamical system in several topological spaces: Cantor conﬁguration space CA, the space MA of shift-invariant Borel probability measures on Aℤ, the Weyl space W A, the Besicovitch space BA, the generic space GA , the Toeplitz space T A and the periodic space P A. We refer to various topological properties of these systems by preﬁxing the name of the space in question. Basic results correlate various dynamical properties of CA in these spaces. The Cantor topology corresponds to the point of view of an observer who can distinguish only a ﬁnite central part of a conﬁguration and sites outside this central part of the conﬁguration are not taken into account. The Besicovitch and Weyl topologies, on the other hand, correspond to a god-like position of someone who sees whole conﬁgurations and can distinguish the frequency of differences. In the Besicovitch topology, the centers of conﬁgurations still play a distinguished role, as the frequencies of differences are computed from the center. In the Weyl topology, on the other hand, no site has a privileged position. Both Besicovitch and Weyl topologies are deﬁned by pseudometrics. Different conﬁgurations can have zero distance and the topological space consists of equivalence classes of conﬁgurations which have zero distance. The generic space GA is a subspace of the Besicovich space of those conﬁgurations, in which each ﬁnite word has a well deﬁned frequency. These frequencies deﬁne a Borel probability measure on the Cantor space of conﬁgurations, so we have a projection from the

Dynamics of Cellular Automata in Noncompact Spaces

A dynamical system is a continuous map F: X ! X of a nonempty metric space X to itself. The nth iteration Fn: X ! X of F is deﬁned by F0(x) = x, Fn+1(x) = F(Fn(x)). A point x X is ﬁxed, if F(x) = x. It is periodic, if Fn (x) = x for some n > 0. The least positive n with this property is called the period of x. The orbit of x is the set OðxÞ ¼ fF n ðxÞ : n > 0g . A set Y X is positively invariant, if F(Y) Y and strongly invariant if F(Y) = Y. A point x X is equicontinuous (x E F) if the family of maps Fn is equicontinuous at X, i.e. x E F iff ð8e > 0Þð∃d > 0Þð8y Bd ðxÞÞð8n > 0Þ ðd ðF n ðyÞ, F n ðxÞÞ < eÞ:

ð∃e > 0Þð8x 6¼ y X Þð∃n 0Þ ðd ðf n ðxÞ, f n ðyÞÞ eÞ: A positively expansive system on a perfect space is sensitive. A system (X, F) is (topologically) transitive, if for any nonempty open sets U,V X there exists n 0 such that F n ðU Þ \ V 6¼ 0. If X is perfect and if the system has a dense orbit, then it is transitive. Conversely, if (X, F) is topologically transitive and if X is compact, then (X, F) has a dense orbit. A system (X, F) is mixing, if for any nonempty open sets U,V X there exists k > 0 such that for every n k we have F n ðU Þ \ V 6¼ 0. An e-chain (from x0 to xn) is a sequence of points x0,..., xn X such that d(F(xi), xi + 1) < e for 0 i < n. A system (X, F) is chain-transitive, if for any e > 0 and any x, y X there exists an e-chain from x to y. A strongly invariant closed set Y X is stable, if 8e > 0, ∃d > 0, 8x X , d ðx,Y Þ < d ) 8n > 0, d ðF n ðxÞ,Y Þ < e :

Dynamical Systems

equicontinuity points which are not sensitive. A system (X, F) is positively expansive, if

generic space G A to the space MA of Borel probability measures equipped with the weak* topology. This is a natural space for investigating the dynamics of CA on random conﬁgurations. The Toeplitz space T A consists of regular quasi-periodic conﬁgurations. This means that each pattern repeats periodically but different patterns have different periods. The Besicovitch and Weyl pseudometrics are actually metrics on the Toeplitz space and moreover they coincide on T A .

325

A strongly invariant closed stable set Y X is an attractor, if ∃d > 0, 8x X , ðd ðx, Y Þ < d ) lim d ðF n ðxÞ, Y Þ ¼ 0: n!1

The system (X, F) is almost equicontinuous if EF ¼ 6 0 and equicontinuous, if ð8e > 0Þð∃d > 0Þð8x X Þð8y Bd ðxÞÞ ð8n > 0Þðd ðF n ðyÞ, F n ðxÞÞ < eÞ: For an equicontinuous system E F = X. Conversely, if E F = X and if X is compact, then F is equicontinuous; this needs not be true in the noncompact case. A system (X, F) is sensitive (to initial conditions), if ð∃e > 0Þð8x X Þð8d > 0Þð∃y Bd ðxÞÞ ð∃n > 0Þðd ðf n ðyÞ, f n ðxÞÞ eÞ: A sensitive system has no equicontinuous point. However, there exist systems with no

Þ W o . In A set W X is inward, if F ðW compact spaces, attractors are exactly O-limits OF(W) = \n>0 F(W) of inward sets. Theorem 1 (Knudsen 1994) Let (X, F) be a dynamical system and Y X a dense, F-invariant subset. 1. (X, F) is sensitive iff (Y, F) is sensitive. 2. (X, F) is transitive iff (Y, F) is transitive. Recall that a space X is separable, if it has a countable dense set. Theorem 2 (Blanchard et al. 1999) Let (X, F) be a dynamical system on a non-separable space. If (X, F) is transitive, then it is sensitive.

Dynamics of Cellular Automata in Noncompact Spaces

Cellular Automata

For a ﬁnite alphabet A, denote by |A| the number of its elements, by A ≔ [ n 0 An the set of words over A, and by A+ ≔ [ n>0 An = A\{l} the set of nonempty words. The length of a word u An is denoted by |u| : n. We say that u A* is a subword of v A*(u v v) if there exists k such that vk + i = ui for all i < |u|. We denote by u[i, j) = ui . . . uj and u[i, j] = ui . . . uj subwords of u associated to intervals. We denote by Aℤ the set of A-conﬁgurations, or doubly-inﬁnite sequences of letters of A. For any u A+ we have a periodic conﬁguration u1 Aℤ deﬁned by (u1)k|u|+1 = ui for k ℤ and 0 i < |u|. The cylinder of a word u A located at l ℤ is the set [u]l = {x Aℤ : x[l,l+juj) = u}. The cylinder set of a set of words U A+ located at l ℤ is the set [U]l = [ u U[u]l. A subshift is a nonempty subset S Aℤ such that there existsa set D A+ of forbidden words and S ¼ SD ≔ x Aℤ : 8u v x, u D . A subshift SD is of ﬁnite type (SFT), if D is ﬁnite. A subshift is uniquely determined by its language LðSÞ≔ [ Ln ðSÞ, n0

where Ln ðSÞ≔fu An : ∃x S,u v xg: A cellular automaton is a map F : Aℤ ! Aℤ deﬁned by F(x)i = f(x[ir; i + r]), where r 0 is a radius and f: A2r+1 ! A is a local rule. In particular the shift map s : Aℤ ! Aℤ is deﬁned by s(x)i ≔ xi+1. A local rule extends to the map f : A ! A by f(u)i = f(u[i, i+2r]) so that jf(u) j = max {| u| 2r, 0}. ℤ

ℤ

Deﬁnition 3 Let F : A ! A be a CA. 1. A word u A is m-blocking, if j u j m and there exists offset d juj m such that 8x, y [u]0, 8n > 0, Fn(x)[d, d + m) = Fn(y)[d, d + m). 2. A set U A+ is spreading, if [U] is F-invariant and there exists n > 0 such that Fn([U]) s1([U]) \ s([U]). The following results will be useful in the sequel.

Proposition 4 (Formenti and Kůrka 2007) Let F : Aℤ ! Aℤ be a CA and let U A+ be an invariant set. Then OF([U]) is a subshift iff U is spreading. Theorem 5 (Hedlund 1969) Let F : Aℤ ! Aℤ be a CA with local rule f : A2r + 1 ! A. Then F is surjective iff f : A ! A is surjective iff j f1(u) j = |A|2r for each u A+.

Submeasures A pseudometric on a set X is a map d: X X ! [0; 1) which satisﬁes the following conditions: 1. d(x, y) = d(y, x), 2. d(x, z) : d(x, y) +d(y, z). If moreover d(x, y) > 0 for x 6¼ y, then we say that d is a metric. There is a standard method to create pseudometrics from submeasures. A bounded submeasure (with bound M ℝ+) is a map ’ : P ðℤÞ ! ½0,M which satisﬁes the following conditions: 1. ’ 0 ¼ 0, 2. ’ðU Þ ’ðU [ V Þ ’ðU Þ þ ’ðV Þ for U ,V ℤ:

326

A bounded submeasure ’ on ℤ deﬁnes a pseudometric d’ : Aℤ Aℤ ! [0, 1) by d’(x, y) ≔ ’({i ℤ : xi 6¼ yi}). The Cantor, Besicovich and Weyl pseudometrics on Aℤ are deﬁned by the following submeasures: ’C ðU Þ≔2min jij :i U ,

’B ðU Þ≔ limsup l!1

jU \ ½l,lÞj , 2l

’W ðU Þ≔ limsup sup l!1

kℤ

jU \ ½k,k þ lÞj : l

Dynamics of Cellular Automata in Noncompact Spaces

The Cantor Space The Cantor metric on Aℤ is deﬁned by d C ðx,yÞ ¼ 2k where k ¼ minfjij : xi 6¼ yi g, so dC (x, y) < 2k iff x[k,k] = y[k,k]. We denote by CA = (Aℤ, dC) the metric space of two-sided conﬁgurations with metric dC. The cylinders are clopen sets in CA. All Cantor spaces (with different alphabets) are homeomorphic. The Cantor space is compact, totally disconnected and perfect, and conversely, every space with these properties is homeomorphic to a Cantor space. Literature about CA dynamics in Cantor spaces is really huge. In this section, we just recall some results and deﬁnitions which will be used later. Theorem 6 (Kůrka 1997) Let (CA, F) be a CA with radius r. 1. (CA, F) is almost equicontinuous iff there exists a r-blocking word for F 2. (CA, F) is equicontinuous iff all sufﬁciently long words are r-blocking. Denote by E F the set of equicontinuous points of F. The sets of equicontinuous directions and almost equicontinuous directions of a CA (CA, F) (see Sablik 2006) are deﬁned by EðF Þ ¼

p þ ℤ : p ℤ, q ℕ , E F q sp ¼ A , q

AðF Þ ¼

p þ q : p ℤ, q ℕ , E F sp 6¼ 0 : q

The Periodic Space Deﬁnition 7 The periodic space P A ¼ x Aℤ : ∃n > 0, sn ðxÞ ¼ xg over an alphabet A consists of shift periodic conﬁgurations with Cantor metric dC.

327

All periodic spaces (with different alphabets) are homeomorphic. The periodic space is not compact, but it is totally disconnected and perfect. It is dense in CA. If (CA, F ) is a CA, Then F ðP A Þ P A . We denote by F P : P A ! P A the restriction of F to P A , so ðP A , F P Þ is a (non-compact) dynamical system. Every F P -orbit is ﬁnite, so every point x P A is F P -eventually periodic. Theorem 8 Let F be a CA over alphabet A. 1. (CA, F) is surjective iff ðP A , F P Þ is surjective. 2. (CA, F) is equicontinuous iff ðP A , F P Þ is equicontinuous. 3. (CA, F) is almost equicontinuous iff ðP A , F P Þ is almost equicontinuous. 4. (CA, F) is sensitive iff ðP A , F P Þ is sensitive. 5. (CA, F) is transitive iff ðP A , F P Þ is transitive. Proof (1a) Let F be surjective, let y P A and sn(y) = y. There exists z F1(y) and integers i < j such that z = z[jnr, jnr+r). Then [inr, inr+r) 1 x ¼ z½inr,jnrÞ P A and F P ðxÞ ¼ y , so F P is surjective. (1b) Let F P be surjective, and u A+. Then u1 has F P -preimage and therefore u has preimage under the local rule. By Hedlund Theorem, (CA; F) is surjective. (2a) Since P A C A , the equicontinuity of F implies trivially the equicontinuity of F P . (2b) Let F P be equicontinuous. There exist m > r such that if x,y P A and x[m, m] = y[m, m], then Fn(x)[r, r] = Fn(y)[r, r] for all n 0. We claim that all words of length 2m + 1 are (2r + 1)blocking with offset m r. If not, then for some x,y Aℤ with x[m, m] = y[m, m], there exists n > 0 such that Fn(x)[r, r] 6¼ Fn(y)[r, r]. For periodic conﬁgurations x0 = (x[m nr, m + nr])1; y0 = (y[m nr, m + nr])1 we get Fn(x0)[r, r] 6¼ Fn(y0)[r, r] contradicting the assumption. By Theorem 6, F is C-equicontinuous. (3a) If (CA, F) is almost equicontinuous, then there exists a r-blocking word u and u1 P A is an equicontinuous conﬁguration for ðP a , F P Þ. (3b) The proof is analogous as (2b). (4) and (5) follow from the Theorem 1 of Knudsen. □

Dynamics of Cellular Automata in Noncompact Spaces

The Toeplitz Space Deﬁnition 9 Let A be an alphabet 1. The Besicovitch pseudometric on Aℤ is deﬁned by jfj ½l,lÞ : xj 6¼ yj gj d B ðx,yÞ ¼ lim sup 2l l!1

2. The Weyl pseudometric on Aℤ is deﬁned by jfj ½k, k þ l : xj 6¼ yj gj d W ðx,yÞ ¼ lim sup max l l!1 k ℤ Clearly d B ðx, yÞ d W ðx, yÞ and d B ðx, yÞ < e , ∃l 0 ℕ, 8l l 0 , jf j ½l, l : xj 6¼ yj gj< ð2l þ 1Þe,

4. A quasi-periodic conﬁguration x Aℤ is regular, if for some periodic structure p of x we have limi!1qi(x)/pi = 0, where qi ðxÞ≔ jfk ½0,pi : rk ðxÞ j pi gj ðrk ðxÞ does not divide pi Þ.

328

Clearly every s periodic conﬁguration is quasiperiodic and has a ﬁnite periodic structure. Proposition 11 1. If x, y are regular quasi-periodic conﬁgurations, then d W ðx,yÞ ¼ d B ðx,yÞ. 2. If x 6¼ y are quasi-periodic conﬁgurations, then d W ðx,yÞ d B ðx,yÞ > 0. Proof 1. We must show d W ðx,yÞ d B ðx,yÞ. Let px ,py be the periodic structures for x and y, and let pj ¼ k xi pxi ¼ k yi pyi be the lowest common multiple of pxi and pyi . Then p ¼ ðpi Þi is a periodic structure for both x and y. For each i > 0 and for each k ℤ we have jf j ½k pi ,k þ pi Þ : xj 6¼ yj gj 2k xi qxi þ 2k yi qyi þ jfj ½pi ,pi Þ : xj 6¼ yj gj

d W ðx, yÞ < e , ∃l 0 ℕ, 8l l 0 , 8k ℤ, jf j ½k,k þ lÞ : xj 6¼ yj gj< le: Both d B and d B are symmetric and satisfy the triangle inequality, but they are not metrics. Distinct conﬁgurations x, y Aℤ can have zero distance. We construct a set of regular quasiperiodic conﬁgurations, on which d B and d W coincide and are metrics. Deﬁnition 10 1. The period of k ℤ in x Aℤ is rk(x) ≔ inf {p > 0 : 8 n ℤ, xk+np = xk}. We set rk(x) = 1 if the deﬁning set is empty. 2. x Aℤ is quasi-periodic, if rk(x) < 1 for all k ℤ. 3. A periodic structure for a quasi-periodic conﬁguration x is a sequence of positive integers p ¼ ðpi Þi 0 set d = e/(4m 2r + 1). If d T ðy,xÞ < d then there exists l0 such that for all l l0, j{i [l, l] : xi 6¼ yi}j < (2l + 1)d. For k ð2m þ 1Þ j < ðk þ 1Þð2m þ 1Þ, F n ðyÞj can differ from Fn(x)j only if y differs from x in some i [k(2m + 1) (m r), (k + 1) m + (m r)) Thus a change xi 6¼ yi can cause at most 2m + 1 + 2(mr) = 4m2r + 1 changes Fn(y)j 6¼ Fn(x)j. We get

This shows that F T is almost equicontinuous. In the general case that AðF Þ 6¼ 0, we get that F qT sp is almost equicontinuous for some p ℤ, q ℕ+. Since s is T -equicontinuous, F qT is almost is equicontinuous and therefore T A ,F T almost equicontinuous. 3. The proof is the same as in (2) with the only modiﬁcation that all u Am are (2r + 1)blocking. 4. The proof of Proposition 8 from Blanchard et al. (1999) works in this case too. 5. The proof of Proposition 12 of Blanchard et al. (2005) works in this case also. □

The Besicovitch Space On Aℤ we have an equivalence xB y iff d B ðx,yÞ ¼ 0. Denote by B A the set of equivalence classes of B and by pB : Aℤ ! B A the projection. The factor of dB is a metric on BA. This is the Besicovitch space on alphabet A. Using preﬁx codes, it can be shown that every two Besicovitch spaces (with different alphabets) are homeomorphic. By Proposition 11 each equivalence class contains at most one quasi-periodic sequence. Proposition 18 T A is dense in B A . The proof of Proposition 9 of Blanchard et al. (2005) works also for regular quasi-periodic sequences. Theorem 19 (Blanchard et al. 1999) The Besicovitch space is pathwise connected, inﬁnitedimensional dimensional, homogenous and complete. It is neither separable nor locally compact. The properties of path-connectedness and inﬁnite dimensionality is proved analogously as in Proposition 15. To prove that B A is neither separable nor locally compact, Sturmian conﬁgurations have been used in Blanchard et al. (1999). The completeness of

Dynamics of Cellular Automata in Noncompact Spaces

Theorem 20 (Blanchard et al. 1999) Let F be a CA on A.

1. (CA, F) is surjective iff ðB A , F B Þ is surjective. 2. If AðF Þ 6¼ 0 then ðB A , F B Þ is almost equicontinuous. 3. if EðF Þ 6¼ 0 then ðB A , F B Þ is equicontinuous. 4. If ðB A , F B Þ is sensitive, then (CA, F) is sensitive. 5. No cellular automaton ðBA , F B Þ is positively expansive. 6. If (CA, F) is chain-transitive, then ðB A , F B Þ is chaintransitive. Theorem 21 (Blanchard et al. 2005)

It is a closed subspace of B A . For n A denote by Fv : GA ! ½0,1 the common value of F and F. Using preﬁx codes, one can show that all generic spaces (with different alphabets) are homeomorphic. The generic space contains all uniquely ergodic subshifts, in particular all Sturmian sequences and all regular Toeplitz sequences. Thus the proofs in Blanchard et al. (1999) can be applied to the generic space too. In particular the generic space is homogenous. If we regard the alphabet A = {0, . . ., m 1} as the group ℤm = ℤ/m ℤ, then for every x GA there is an isometry H x : G A ! GA deﬁned by Hx(y) = x + y. Moreover, GA is pathwise connected, inﬁnite-dimensional and complete (as a closed subspace the full Besicovitch space). It is neither separable nor locally compact. If F : Aℤ ! Aℤ is a cellular automaton, then F ðGA Þ GA . Thus, the restriction of F B to GA deﬁnes a dynamical system GA , F G . See also Pivato for a similar approach. Theorem 22 Let F : Aℤ ! Aℤ be a CA. 1. (CA, F) is surjective iff GA , F G is surjective. 2. If AðF Þ 6¼ 0 , then GA , F G is almost equicontinuous. 3. if E ðF Þ 6¼ 0, then GA , F G is equicontinuous. 4. If GA , F G is sensitive, then (CA; F) is sensitive. 5. If F is C-chain transitive, then F is G -chain transitive.

1. No CA ðBA , F B Þ is transitive. 2. A CA ðBA , F B Þ has either a unique ﬁxed point and no other periodic point, or it has uncountably many periodic points. 3. If a surjective CA has a blocking word, then the set of its F B -periodic points is dense in B A .

G A ¼ x Aℤ : 8n A , Fv ðxÞ ¼ Fv ðxÞ :

B A has been proved by Marcinkiewicz (1939). Every cellular automaton F : Aℤ ! Aℤ is uniformly continuous with respect to d B , so it preserves the equivalence B. If d B ðx,yÞ ¼ 0 , then d B ðF ðxÞ, F ðyÞÞ ¼ 0 . Thus a cellular automaton F deﬁnes a uniformly continuous map F B : B A ! BA .

331

The Generic Space For a conﬁguration x Aℤ and word v A+ set Fv ðxÞ ¼ liminf jfi ½n,nÞ : x½i,iþjvjÞ ¼ vgj =2n, n!1

Fv ðxÞ ¼ limsup jfi ½n,nÞ : x½i,iþjvjÞ ¼ vgj =2n: n!1

The proofs are the same as the proofs of corresponding properties in Blanchard et al. (1999).

For every n Aþ ,Fv ,Fv : Aℤ ! ½0,1 are continuous in the Besicovitch topology. In fact we have jFv ðxÞ Fv ðyÞj d B ðx,yÞ j v j, jFv ðxÞ Fv ðyÞj d B ðx,yÞ j v j: Deﬁne the generic space (over the alphabet A) as

The Space of Measures By a measure we mean a Borel shift-invariant probability measure on the Cantor space Aℤ (see ▶ “Ergodic Theory of Cellular Automata”). This

332

Dynamics of Cellular Automata in Noncompact Spaces

is a countably additive function m on the Borel sets of Aℤ which assigns 1 to the full space and satisﬁes m(U) = m(s1(U)). A measure on Aℤ is determined by its values on cylinders m(u) ≔ m([u]n) which does not depend on n ℤ. Thus a measure can be identiﬁed with a map m : A ! [0, 1] subject to bilateral Kolmogorov compatibility conditions

aA

X

mðauÞ ¼ mðuÞ, mðlÞ ¼ 1:

aA

Deﬁne the distance of two measures d M ðm,vÞ≔

X uA

mðvÞ ¼ Fv ðxÞdm: If F is a CA, we have a commutative diagram FF G ¼ F M F. GA F# MA

FG

! FM

!

GA #F MA

Theorem 23 Let F be a CA over A.

j mðuÞ vðuÞ j jAj2juj :

þ

This is a metric which yields the topology of weak* convergence on the compact space MA ≔ Ms Aℤ of shift-invariant Borel probability measures. A CA F : Aℤ ! Aℤ with local rule f determines a continuous and afﬁne map F M : MA ! MA by X ðF M ðmÞÞðuÞ ¼ mðnÞ: V f 1 ðuÞ

Moreover F and Fs determine the same dynamical system on MA : F M ¼ ðFsÞM . For x GA denote by Fx : A ! [0, 1] the function Fx(v) = Fv(x). For every x GA ,Fx is a shift-invariant Borel probability measure. The map F : GA ! MA is continuous with respect to the Besicovich and weak* topologies. In fact we have d M ðFx ,Fy Þ d B ðx,yÞ

X X

Proof 1. See Kůrka (2005) for a proof. 2. This holds since ðMA , F M Þ is a factor of GA , F G . 3. It sufﬁces to prove the claim for the case that F is almost equicontinuous. In this case there exists a blocking word u A+ and the Dirac measure du deﬁned by d u (v) =

j u j jAj2juj

þ

uA

¼ d B ðx,yÞ

1. (CA, F) is surjective iff ðMA , F M Þ is surjective. 2. If GA , F G has dense set of periodic points, then ðMA , F M Þ has dense set of periodic points. 3. If AðF Þ 6¼ 0 , then ðMA , F M Þ is almost equicontinuous. 4. If EðF Þ 6¼ 0 , then ð MA , F M Þ is equicontinuous.

mðuaÞ ¼

ð

X

ðGA Þ ¼ 1 and for every n A, the measure of v is the integral of its density Fv,

n jAjn

n>0

¼ d B ðx,yÞ j A j =ðjAj 1Þ2 : By a theorem of Kamae (1973), F is surjective. Every shifti-invariant Borel probability measure has a generic point. It follows from the ergodic theorem that if m is a s-invariant measure, then m

1/|u|

if v

u

0

if v

u

is equicontinuous for ðMA , F M Þ. 4. If (CA, F) is equicontinuous, then all sufﬁciently long words are blocking and there exists d > 0 such that for all n > 0, and for all x,y Aℤ such that x[n d, n + d] = y[n d, k k n + d] we have F (x)[n, n] = F (y)[n, n] for all k > 0. Thus there are maps gk : A ! A such that jgk(u)j = max{|u| 2d, 0} and for every x Aℤ we have Fk(x)[n, n] = Fk(x[n kd, n

Dynamics of Cellular Automata in Noncompact Spaces

333

= gk(x[n d, n+d]), where f is the local rule for F. We get

WA p# BA

+kd] )

n¼1 v Anþ2d

jAj4d d M ðm,vÞ:

□

The Weyl Space Deﬁne the following equivalence relation on Aℤ : xW y iff d W ðx,yÞ ¼ 0. Denote by W A the set of equivalence classes of W and by pW : Aℤ ! W A the projection. The factor of d W is a metric on W A. This is the Weyl space on alphabet A. Using preﬁx codes, it can be shown that every two Weyl spaces (with different alphabets) are homeomorphic. The Toeplitz space is not dense in the Weyl space (see Blanchard et al. 2005). Theorem 24 (Blanchard et al. 1999) The Weyl space is pathwise connected, inﬁnite-dimensional and homogenous. It is neither separable nor locally compact. It is not complete. Every cellular automaton F : Aℤ ! Aℤ is continuous with respect to d W , so it preserves the equivalence w. If d W ðx,yÞ ¼ 0 , then d W ðF ðxÞ, F ðyÞÞ ¼ 0. Thus a cellular automaton F deﬁnes a continuous map F W : W A ! W A . The shift map s : W A ! W A is again an isometry, so in W A many topological properties are preserved if F is composed with a power of the shift. This is true for example for equicontinuity, almost continuity and sensitivity. If p : W A ! B A is the (continuous) projection and F a CA, then the following diagram commutes.

Theorem 25 (Blanchard et al. 1999) Let F be a CA on A. 1. (CA, F) is surjective iff W A , F W is surjective. 2. If AðF Þ 6¼ 0 , then W A , F W is almost equicontinuous. is W A, F W 3. If E ðF Þ 6¼ 0 , then equicontinuous. 4. If (CA, F) is chain-transitive, then W A , F W is chain-transitive.

d M F kM ðmÞ, F kM ðv Þ

1 X

X X

¼ ðmðnÞ vðnÞÞ

jAj2n

n¼1 u An v f k ðuÞ

1 X

X X

jAj2n

¼ ð m ð n Þ v ð n Þ Þ

n

n¼1 u A v g1 ðuÞ k 1 X X j mðvÞ vðvÞ j jAj2n

FB

!

WA #p BA

FW

!

Theorem 26 (Blanchard et al. 2005) No CA is W A , F W is transitive. Theorem 27 Let S be a subshift attractor of ﬁnite type for F (in the Cantor space). Then there exists d > 0 such that for every x W A satisfying d W ðx,SÞ < d,F n ðxÞ S for some n > 0. Thus a subshift attractor of ﬁnite type is a W attractor. Example 2 shows that it need not be Battractor. Example 3 shows that the assertion need not hold if is not of ﬁnite type. Proof Let U Aℤ be a C -clopen set such that = OF(U). Let U be a union of cylinders of words of length q. Set O~s ðU Þ ¼ \n ℤ sn ðU Þ. By a generalization of a theorem of Hurd (1990) (see ▶ “Topological Dynamics of Cellular Automata”), there exists m > 0 such that S ¼ F m O~s . If d W P ðx, Þ < 1=q then there exists l > 0 such that for every k ℤ there exists a nonnegative j < l such that sk+j(x) U. It follows that there exists n > 0 such that F n ðxÞ O~s ðU Þ and therefore Fn+m(x) S. □

Examples Example 1 The identity rule Id(x) = x. (B A , IdB ) and (W A , IdW ) are chain-transitive (since both B A and W A are connected). However,

334

Dynamics of Cellular Automata in Noncompact Spaces

and ( W A , F W ). This shows that item (2) of Theorems 17, 20 and 25 cannotbe converted. The maximal C-attractor OF ¼ x Aℤ : 8n > 0, 1ð10Þn 0 v xg is not SFT. We show that it does

Example 2 The product rule ECA128 F(x)i = xi 1 xi xi +1.

not W -attracts points from any of its neighborhood. For a given even integer q > 2 deﬁne x A ℤ by

(CA, F), (B A , F B ) and (W A , F W ) are almost equicontinous and the conﬁguration 01 is equicontinuous in all these versions. By Theorem 27, {01} is a W-attractor. However, contrary to a mistaken Proposition 9 in Blanchard et al. (1999), {01} is not B -attractor. For a given 0 < e < 1 deﬁne x Aℤ by xi = 1 iff 3n (1 e) < |i| 3n for some n 0. Then d B (x, 01) = e but x is a ﬁxed point, since d B (F(x), x) = limn!1 2n/3n = 0 (see Fig. 1). Example 3 The trafﬁc ECA184 F(x)i = 1 iff x[i 1,i] = 10 or x[i,i + 1] = 11.

No Fq s p is C-almost equicontinuous, so AðF Þ 6 0. However, if d W (x, 01) < d, then d W (Fn (x), ¼ 01) < d for every n > 0, since F conserves the number of letters 1 in a conﬁguration. Thus 01 is a point of equicontinuity in (T A , F T ), (B A , F B ),

(CA, Id) is not chain-transitive. Thus the converse of Theorem 20(6) and of Theorem 25(4) does not hold.

8 0 (see Fig. 2, where q = 8). Example 4 The sum ECA90 F(x)i = (xi 1 + xi +1) mod 2. Both ( B A , F B ) and ( W A , F W ) are sensitive (Cattaneo et al. 1997). For a given n > 0 deﬁne a conﬁguration z by zi = 1 iff i = k2n for some k n1 ℤ. Then F 2 ðzÞ ¼ ð01Þ1 . For any x Aℤ, we have dW (x, x + z) = 2n but n1 n1 d W F 2 ðxÞ, F 2 ðx þ zÞ ¼ 1=2: The same argument works for (BA , F B ).

Dynamics of Cellular Automata in Noncompact Spaces, Fig. 1 The product ECA184

Dynamics of Cellular Automata in Noncompact Spaces, Fig. 2 The trafﬁc ECA184

Dynamics of Cellular Automata in Noncompact Spaces, Fig. 3 The sum ECA90

Dynamics of Cellular Automata in Noncompact Spaces

335

Example 5 The shift ECA170 F(x)i = xi + 1.

Bibliography

Since the system has ﬁxed points 01 and 11, it has uncountable number of periodic points. However, the periodic points are not dense in B A (Blanchard et al. 2005) (Fig. 3).

Primary Literature

Future Directions One of the promising research directions is the connection between the generic space and the space of Borel probability measures which is based on the factor map F. In particular Lyapunov functions based on particle weight functions (see Kůrka 2003) work both for the measure space MA and the generic space GA . The potential of Lyapunov functions for the classiﬁcation of attractors has not yet been fully explored. This holds also for the connections between attractors in different topologies. While the theory of attractors is well established in compact spaces, in noncompact spaces there are several possible approaches. Finally, the comparison of entropy properties of CA in different topologies may be revealing for classiﬁcation of CA. There is even a more general approach to different topologies for CA based on the concept of submeasure on ℤ. Since each submeasure deﬁnes a pseudometric, it would be interesting to know, whether CA are continuous with respect to any of these pseudometrics, and whether some dynamical properties of CA can be derived from the properties of deﬁning submeasures. Acknowledgments We thank Marcus Pivato and Francois Blanchard for careful reading of the paper and many valuable suggestions. The research was partially supported by the Research Program Project “Sycomore” (ANR-05-BLAN-0374).

Besicovitch AS (1954) Almost periodic functions. Dover, New York Blanchard F, Formenti E, Kůrka P (1999) Cellular automata in the Cantor, Besicovitch and Weyl spaces. Complex Syst 11(2):107–123 Blanchard F, Cervelle J, Formenti E (2005) Some results about the chaotic behaviour of cellular automata. Theor Comput Sci 349(3):318–336 Cattaneo G, Formenti E, Margara L, Mazoyer J (1997) A shiftinvariant metric on Sℤ inducing a nontrivial topology, Lecture notes in computer science, vol 1295. Springer, Berlin Formenti E, Kůrka P (2007) Subshift attractors of cellular automata. Nonlinearity 20:105–117 Hedlund GA (1969) Endomorphisms and automorphisms of the shift dynamical system. Math Syst Theory 3:320–375 Hurd LP (1990) Recursive cellular automata invariant sets. Complex Syst 4:119–129 Iwanik A (1988) Weyl almost periodic points in topological dynamics. Colloquium Mathematicum 56:107–119 Kamae J (1973) Subsequences of normal sequences. Isr J Math 16(2):121–149 Knudsen C (1994) Chaos without nonperiodicity. Am Math Mon 101:563–565 Kůrka P (1997) Languages, equicontinuity and attractors in cellular automata. Ergod Theory Dyn Syst 17:417–433 Kůrka P (2003) Cellular automata with vanishing particles. Fundamenta Informaticae 58:1–19 Kůrka P (2005) On the measure attractor of a cellular automaton. Discret Continuous Dyn Syst 2005(suppl):524–535 Marcinkiewicz J (1939) Une remarque sur les espaces de a.s. Besicovitch, vol 208. C R Acad Sci, Paris, pp 157–159 Sablik M (2006) étude de l’action conjointe d’un automate cellulaire et du décalage: une approche topologique et ergodique. Université de la Mediterranée, PhD thesis

Books and Reviews Besicovitch AS (1954) Almost periodic functions. Dover, New York Kitchens BP (1998) Symbolic dynamics. Springer, Berlin Kůrka P (2003) Topological and symbolic dynamics, Cours spécialisés, vol 11. Société Mathématique de France, Paris Lind D, Marcus B (1995) An introduction to symbolic dynamics and coding. Cambridge University Press, Cambridge

Orbits of Bernoulli Measures in Cellular Automata Henryk Fukś Department of Mathematics and Statistics, Brock University, St. Catharines, ON, Canada

Article Outline Glossary Introduction Construction of a Probability Measure Description of Probability Measures by Block Probabilities Cellular Automata Bayesian Approximation Local Structure Maps Exact Calculations of Probabilities of Short Blocks Along the Orbit Examples of Exact Results for Probabilistic CA Rules Future Directions Bibliography

Glossary Block evolution operator When the cellular automaton rule of radius r is deterministic, its transition probabilities take values in the set {0, 1}. For such rules and for A ¼ f0, 1g , deﬁne the local function f : A 2rþ1 ! A by f(x1, x2, . . .x2r+1) = w(1| x1, x2, . . . x2r+1) for all x1 , x2 , . . . x2rþ1 A . A block evolution operator corresponding to f is a mapping f : A ⋆ 7! A ⋆ deﬁned for a ¼ a0 a1 . . . an1 A n by n2r1 f ðaÞ ¼ f aj , aiþ1 , . . . , aiþ2r i¼0 . For a deterministic cellular automaton F its local function is denoted by the corresponding lowercase italic form of the same letter, f, while the block evolution operator is the bold form of the same letter, f. The set of preimages of the block

a under f is called block preimage set, denoted by f1(a). Block or word A ﬁnite sequence of symbols of the alphabet A . Set of all blocks of length n is denoted by A n, while the set of all possible blocks of all lengths by A ⋆. Blocks are denoted by bold lowercase letters a, b, c, etc. Individual symbols of the block b are denoted by indexed italic form of the same letter, b = b1, b2, . . . , bn. To make formulae more compact, commas are sometimes dropped (if no confusion arises), and we simply write b = b1b2 . . . bn. Block probability Probability of occurrence of a given block b (or word) of symbols. Formally deﬁned as a measure of the cylinder set generated by the block b and anchored at i, and denoted by P(b) = m([b]i). In this entry, we are exclusively dealing with shiftinvariant probability measures, thus m([b]i) is independent of i. Probability of occurrence of a block b after n iterations of cellular automaton F starting from initial measure m is denoted by Pn(b) and deﬁned as Pn(b) = (Fnm)([b]i). Here again we assume shift invariance, thus (Fnm)([b]i) is independent of i. Cellular automaton In this entry, cellular automaton is understood as a map F in the space of shift-invariant probability measures over the conﬁguration space A ℤ . To deﬁne F, two ingredients are needed, a positive integer r called radius and a function w : A A 2rþ1 ! ½0, 1 , whose values are called transition probabilities. The image of a measure m under the action of F is thendeﬁned by probabilities of cylinder sets, ðFmÞ ½aj ¼ P jajþ2r wðaj bÞm ½bir where i ℤ, a bA A ⋆, and where w(a| b) is deﬁned as wðaj bÞ jaj ¼ ∏j¼1 w aj j bj bjþ1 . . . bjþ2r . Cellular automaton is called deterministic if transition probabilities take values exclusively in the set {0, 1}, otherwise it is called probabilistic.

# Springer Science+Business Media LLC, part of Springer Nature 2018 A. Adamatzky (ed.), Cellular Automata, https://doi.org/10.1007/978-1-4939-8700-9_676 Originally published in R. A. Meyers (ed.), Encyclopedia of Complexity and Systems Science, # Springer Science+Business Media LLC 2017 https://doi.org/10.1007/978-3-642-27737-5_676-1

337

338

Orbits of Bernoulli Measures in Cellular Automata

Complete set A set of words C = {a1, a2, a3, . . .} is called complete with respect to a CA rule F if for every a C and n ℕ, Pn+1(a) can be expressed as a linear combination of Pn(a1), Pn(a2), Pn(a3), . . .. Conﬁguration space Set of all bisequences of symbols from the alphabet A of N symbols, A ¼ f0, 1 , . . . , N 1g , denoted by A ℤ . Elements of A ℤ are called conﬁgurations and denoted by bold lowercase letters: x, y, etc. Cylinder set For a block b of length n, the cylinder set generated by b and anchored at i is the subset of conﬁgurations such that symbols at positions from i to i + n 1 are ﬁxed and equal to symbols in the block b, while the remaining symbols are arbitrary. Denoted by ½bj ¼ x A ℤ : xði, iþnÞ ¼ b . Local structure approximation Approximation of points of the orbit of a measure m under a given cellular automaton F by Markov measures, that is, measures maximizing entropy and completely determined by probabilities of blocks of length k. The number k is called the order or level of local structure approximation. Orbit of a measure For a given cellular automaton F and a given shift invariant probability measure m, the orbit of m under F is a sequence m, Fm, F2m, F3m, . . .. The main subject of this entry are orbits of Bernoulli measures on {0, 1}ℤ, that is, measures parametrized by p [0, 1] and deﬁned by m ð½bÞ ¼ p#1 ðbÞ p

ð1 pÞ#0 ðbÞ , where #k(b) denotes the number of symbols k in b. Short/long block representation Shift invariant probability measures on A ℤ are unambiguously determined by block probabilities P(b), b A ⋆ . For a given k, probabilities of blocks of length 1, 2, . . . , k are not all independent, as they have to satisfy measure additivity conditions, known as Kolmogorov consistency conditions. One can show that only (N 1) Nk1 of them are linearly independent. If one declares as independent the set of (N 1)Nk1 blocks chosen so that they are as short blocks as possible, one can express the remaining blocks probabilities in terms of these. An algorithm for selection of shortest possible blocks

is called short block representation. If, on the other hand, one chooses the longest possible blocks to be declared independent, this is called long block representation.

Introduction In both theory and applications of cellular automata (CA), one of the most natural and most frequently encountered problems is what one could call the density response problem: If the proportion of ones (or other symbols) in the initial conﬁguration drawn from a Bernoulli distribution is known, what is the expected proportion of ones (or other symbols) after n iterations of the CA rule? One could rephrase it in a slightly different form: if the probability of occurrence of a given symbol in an initial conﬁguration is known, what is the probability of occurrence of this symbol after n iterations of this rule? A similar question could be asked about the probability of occurrence of longer blocks of symbols after n iterations of the rule. Due to complexity of CA dynamics, there is no hope to answer questions like this in a general form, for an arbitrary rule. The situation is somewhat similar to what we encounter in the theory of differential equations: there is no general algorithm for solving initial value problem for an arbitrary rule, but one can either solve it approximately (by a numerical method) or, for some differential equations, one can construct the solution formula in terms of elementary functions. In cellular automata, there are also two ways to make progress. One is to use some approximation techniques and compute approximate values of the desired probabilities. Another is to focus on narrower classes of CA rules, with sufﬁciently simple dynamics, and attempt to compute these probabilities in a rigorous ways. Both these approaches are discussed in this entry. We will treat cellular automata as maps in the space of Borel shift-invariant probability measures, equipped with the so-called weak⋆ topology (Kůrka and Maass 2000; Kůrka 2005; Pivato 2009; Formenti and Kůrka 2009). In this setting, the aforementioned problem of computing block

Orbits of Bernoulli Measures in Cellular Automata

probabilities can be posed as the problem of determining the orbit of a given initial measure m (usually a Bernoulli measure) under the action of a given cellular automaton. Since computing the complete orbit of a measure is, in general, very difﬁcult, approximate methods have been developed. The simplest of these methods is called the mean-ﬁeld theory, and it has its origins in statistical physics (Wolfram 1983). The main idea behind the meanﬁeld theory is to approximate the consecutive iterations of the initial measure by Bernoulli measures, ignoring correlations between sites. While this approximation is obviously very crude, it is sometimes quite useful in applications. In 1987, H. A. Gutowitz, J. D. Victor, and B. W. Knight proposed a generalization of the mean-ﬁeld theory for cellular automata which, unlike the mean-ﬁeld theory, takes into account correlations between sites, although only in an approximate way (Gutowitz et al. 1987). The basic idea is to approximate the consecutive iterations of the initial measure by Markov measures, also called ﬁnite block measures. Finite block measures of order k are completely determined by probabilities of blocks of length k. For this reason, one can construct a map on these block probabilities which, when iterated, approximates probabilities of occurrence of the same blocks in the actual orbit of a given cellular automaton. The construction of Markov measures is based on the idea of “Bayesian extension,” introduced in 1970s and 1980s in the context of lattice gases (Brascamp 1971; Fannes and Verbeure 1984). The local structure theory produces remarkably good approximations of probabilities of small blocks, provided that one uses sufﬁciently high order of the Markov measure. For deterministic CA, if one wants to compute probabilities of small blocks exactly, without using any approximations, one has to study the combinatorial structure of preimages of these block under the action of the rule. In many cases, this reveals some regularities which can be exploited in the computation of block probabilities. For a number of elementary CA rules, this approach has been used to construct probabilities of short blocks, typically block of up to three symbols. For probabilistic cellular automata, one can try to compute n-step

339

transition probabilities, and in some cases these transition probabilities are expressible in terms of elementary functions. This allows to construct formulae for block probabilities. In the rest of this entry we will discuss how to construct shift-invariant probability measures over the space of bisequences of symbols, and how to describe such measures in terms of block probabilities. We will then deﬁne cellular automata as maps in the space of measures and discuss orbits of shift-invariant probability measures under these maps. Subsequently, the local structure approximation will be discussed as a method to approximate orbits of Bernoulli measures under the action of cellular automata. The ﬁnal sections present some known examples of cellular automata, both deterministic and probabilistic, for which elements of the orbit of the Bernoulli measure (probabilities of short blocks) can be determined exactly.

Construction of a Probability Measure Let A ¼ f0, 1, . . . , N 1g be called an alphabet, or a symbol set, and let X ¼ A ℤ be called the conﬁgurations space. The Cantor metric on X is deﬁned as d(x, y)=2k, where k = min {| i| :xj 6¼ yj}. X with the metric d is a Cantor space, that is, compact, totally disconnected, and perfect metric space. A ﬁnite sequence of elements of A , b ¼ b1 b2 . . . , bn will be called a block (or word) of length n. Set of all blocks of elements of A of all possible lengths will be denoted by A ⋆. A cylinder set generated by the block b = b1b2 . . . , bn and anchored at i is deﬁned as ½bj ¼ x A ℤ : x½i, iþnÞ ; ¼ b :

(1)

When one of the indices i, i + 1, . . . , i + n 1 is equal to zero, the cylinder set will be called elementary. The collection (class) of all elementary cylinder sets of X together with the empty set and the whole space X will be denoted by Cyl(X). One can show that Cyl(X) constitutes a semi-algebra over X. Moreover, one can show that any ﬁnitely additive map m : Cyl(X) ! [0, 1]

340

Orbits of Bernoulli Measures in Cellular Automata

for which m(Ø) = 0 is a measure on the semialgebra of elementary cylinder sets Cyl(X). The semi-algebra of elementary cylinder sets equipped with a measure is still “too small” a class of subsets of X to support all requirements of the probability theory. For this we need a s-algebra, that is, a class of subsets of X that is closed under the complement and under the countable unions of its members. Such s-algebra can be deﬁned as an “extension” of Cyl(X). The smallest s-algebra containing Cyl(X) will be called s-algebra generated by Cyl(X). As it tums out, it is possible to extend a measure on semi-algebra to the s-algebra generated by it, by using Hahn-Kolmogorov theorem. In what follows, we will only consider measures for which m(X) = 1 (probability measures). Moreover, we will only limit our attention to the case of translationally invariant measures (also called shift-invariant), by requiring that, for all b A ⋆ , m ½bi is independent of i. To simplify notation, we then deﬁne P : A ⋆ ! ½0, 1 as PðbÞ≔m ½bi :

(2)

Values P(b) will be called block probabilities. Application of Hahn-Kolmogorov theorem to the case of shift-invariant probability measure m yields the following result. Theorem 1 Let conditions PðbÞ ¼

X

P : A ⋆ ! ½0, 1

PðbaÞ ¼

aA

X

PðabÞ

satisfy the

8b A ⋆ ,

aA

1¼

X

(3) PðaÞ:

(4)

aA

Then P uniquely determines shift-invariant probability measure on the s-algebra generated by elementary cylinder sets of X. The set of shift-invariant probability measures on the s-algebra generated by elementary cylinder sets of X will be denoted by MðXÞ. Conditions (3 and 4) are often called consistency conditions, although they are essentially

equivalent to measure additivity conditions. Some consequences of consistency conditions in the context of cellular automata have been studied in detail by McIntosh (2009).

Description of Probability Measures by Block Probabilities Since the probabilities P(b) uniquely determine the probability measure, we can deﬁne a shiftinvariant probability measure by specifying P(b) for all b A ⋆. Obviously, because of consistency conditions, block probabilities are not independent, thus in order to deﬁne the probability measure, we actually need to specify only some of them, but not necessarily all – the missing ones can be computed by using consistency conditions. Deﬁne P(k) to be the column vector of all probabilities of blocks of length k arranged in the lexical order. For example, for A ¼ f0, 1g , these are Pð1Þ ¼ ½Pð0Þ, Pð1ÞT , Pð2Þ ¼ ½Pð00Þ, Pð01Þ, Pð10Þ, Pð11ÞT , Pð3Þ ¼ , ½Pð000Þ, Pð001Þ, Pð010Þ, Pð011Þ, Pð100Þ, Pð101Þ, Pð110Þ, Pð111ÞT The following result (Fukś 2013) is a direct consequence of consistency conditions of Eqs. 3 and 4. Proposition 1 Among all block probabilities constituting components of P(1), P(2), , P(k) only (N 1)Nk1 are linearly independent. For example, for N = 2 and k = 3, among P(1) , P(2) , P(3) (which have, in total, 2 + 4 + 8 = 14 components), there are only four independent blocks. These four blocks can be selected somewhat arbitrarily (but not completely arbitrarily). Two methods or algorithms for selection of independent blocks are especially convenient. The ﬁrst one is called the long block representation. It is based on the following property (cf. ibid.)

Orbits of Bernoulli Measures in Cellular Automata

341

Proposition 2 Let P(k) be partitioned into two ðk Þ ðkÞ ðk Þ sub-vectors, PðkÞ ¼ PTop , PBot , where PTop con-

2

3

ðkÞ BðkÞ . . . BðkÞ 5, AðkÞ ¼ ½J1 J2 . . . JN1 þ 4B |ﬄﬄﬄﬄﬄﬄﬄﬄﬄﬄﬄﬄ{zﬄﬄﬄﬄﬄﬄﬄﬄﬄﬄﬄﬄ} N1

ðkÞ

tains ﬁrst Nk Nk1 entries of P(k), and PBot the remaining Nk1 entries. Then 2

ðkÞ

PBot

3 0 6 ⋮ 7 ðkÞ 1 ðkÞ ðkÞ 7 ¼6 A PTop : 4 0 5 B 1

(5)

In the above, the matrix B(k) is constructed from zero Nk1 Nk1 matrix by placing 1s on the diagonal, and then ﬁlling the last row with 1s, so that 2

BðkÞ

1 6 0 ¼6 4 ⋮ 1

0

0 1

3

7 7: 5 ⋱ 1 1

1

(6)

The matrix A(k) is a bit more complicated, 2

Pð100Þ

3

2

6 Pð101Þ 7 6 6 7 6 6 7¼6 4 Pð110Þ 5 4

(7) where Jm is an Nk1 Nk1 matrix in which m-th row consists of all 1s, and all other entries are equal to 0. The above proposition means that among block probabilities constituting components of P(1), P(2), . . . , P(k), we can treat the ﬁrst Nk Nk 1 entries of P(k) as independent variables. The Remaining components of P(k) can be obtained by using Eq. 5, while P(1), P(2), . . . , P(k 1) can be obtained by Eq. 3. When applied to the N = 2 and k = 3 case, this yields the following choice of independent blocks: P(000) , P(001) , P(010), and P(011) . The remaining ten probabilities can then be expressed as follows, 3

Pð001Þ Pð001Þ þ Pð010Þ þ Pð011Þ Pð011Þ

7 7 7 5

1 Pð000Þ Pð001Þ 2Pð010Þ 3Pð011Þ Pð111Þ 2 3 2 3 Pð00Þ Pð000Þ þ Pð001Þ 6 Pð01Þ 7 6 7 Pð010Þ þ Pð011Þ 6 7 7 6 6 7 7¼6 4 Pð10Þ 5 4 5 Pð010Þ þ Pð011Þ

(8)

Pð11Þ 1 Pð000Þ Pð001Þ 2Pð010Þ 2Pð011Þ

Pð 0 Þ Pð000Þ þ Pð001Þ þ Pð010Þ þ Pð011Þ ¼ Pð 1 Þ 1 Pð000Þ Pð001Þ 2Pð010Þ 2Pð011Þ

Of course, the above is not the only choice. Alternatively, we can choose as independent blocks the shortest possible blocks. The algorithm resulting in such a choice will be called the short block representation. In order to describe it in a formal way, let us deﬁne a vector of admissible ðk Þ entries for short block representation, Padm , as follows. Let us take vector P(k) in which block probabilities are arranged in the lexicographical order, indexed by an index i which runs from 1 to ðk Þ Nk. The Vector Padm consists of all entries of P(k) for

which the index i is not divisible by N and for which i < Nk Nk1. For example, for N = 3 and k = 2, we have Pð2Þ ¼ ½Pð00Þ, Pð01Þ, Pð02Þ, Pð10Þ, Pð11Þ, Pð12Þ, Pð20Þ, Pð21Þ, Pð22ÞT , and we need to select entries with i not divisible by 3 and i < 6 which leaves i = 1 , 2 , 4 , 5, hence

342

Orbits of Bernoulli Measures in Cellular Automata ð2Þ

Padm ¼ ½Pð00Þ, Pð01Þ, Pð10Þ, Pð11ÞT : The vector of independent block probabilities in short block representation is now deﬁned as 2

ðkÞ

Pshort

3 ð1Þ Padm 6 ð2Þ 7 6 7 ¼ 6 Padm 7: 4 ⋮ 5 ðkÞ Padm

(9)

P satisfying a A wðaj bÞ ¼ 1 , be called the local transition function of radius r, and its values called local transition probabilities. The Probabilistic cellular automaton with local transition function w is a map F: MðXÞ ! MðXÞ deﬁned as ðFmÞ ½ai ¼

X b A jajþ2r

wðaj bÞm ½bir for all i ℤ,

a A ⋆,

(11)

The following result can be established. Proposition 3 Among block probabilities constituting components of P(1), P(2), . . . P(k), we can treat ðk Þ

entries of Pshort as independent variables. One can express all other components of P(1) , P(2) ðkÞ , . . . , P(k) in terms of components Pshort . The exact formulae expressing components of P(1) , P(2) , . . . , P(k) in terms of components ðk Þ

Pshort are rather complicated and can be found in (Fukś 2013). As an example, for N = 2 and k = 3, this algorithm yields P(0), P(00), P(000), and P(010) to be the independent block probabilities, ð3Þ that is, the components of Pshort . The remaining 10 dependent blocks probabilities can be expressed in terms of P(0), P(00), P(000), and P(010). 3 2 Pð001Þ 6 Pð011Þ 7 6 7 6 6 7 6 6 6 Pð100Þ 7 6 7 6 6 6 Pð101Þ 7 ¼ 6 7 6 6 7 6 6 4 Pð110Þ 5 4 2

3

Pð00Þ Pð000Þ Pð0Þ Pð00Þ Pð010Þ

7 7 7 7 7: 7 7 7 5

Pð00Þ Pð000Þ Pð0Þ 2Pð00Þ þ Pð000Þ Pð0Þ Pð00Þ Pð010Þ

1 3Pð0Þ þ 2Pð00Þ þ Pð010Þ Pð111Þ 2 3 2 3 Pð01Þ Pð0Þ Pð00Þ 6 7 6 7 4 Pð10Þ 5 ¼ 4 Pð0Þ Pð00Þ 5, Pð11Þ

1 2Pð0Þ þ Pð00Þ

Pð1Þ ¼ 1 Pð0Þ: (10)

Cellular Automata Let w : A A 2rþ1 ! ½0, 1 , whose values are denoted by w(a| b) for a A , b A 2rþ1 ,

where we deﬁne jaj wðaj bÞ ¼ ∏ w aj j bj bjþ1 . . . bjþ2r :

(12)

j¼1

When the function w takes values in the set {0, 1}, the corresponding cellular automaton is called deterministic cellular automaton. For any shift-invariant probability measure m MðXÞ, we deﬁne the orbit of m under F as f F n mg 1 n¼0 ,

(13)

where F0m = m. Points of the orbit of m under F are uniquely determined by probabilities of cylinder sets. Thus, if we deﬁne, for n 0 , Pn(a) = (Fnm)([a]i), then, for a A k , Eq. 11 becomes Pnþ1 ðaÞ ¼

X

wðaj bÞPn ðbÞ:

(14)

b A jajþ2r

In the above we assume that P0(a) = m([a]i). Given the measure m, Eq. 14 deﬁnes a system of recurrence relationship for block probabilities. Solving this recurrence system, that is, ﬁnding Pn(a) for all n ℕ and all a A ⋆, would be equivalent to determining the orbit of m under F. However, it is very difﬁcult to solve these equations explicitly, and no general method for doing this is known. To see the source of the difﬁculty, let us take A ¼ f0, 1g and let us consider the example of rule 14, for which the local transition probabilities are given by

Orbits of Bernoulli Measures in Cellular Automata

343

wð1j 000Þ ¼ 0, wð1j 001Þ ¼ 1, wð1j 010Þ ¼ 1, wð1j 011Þ ¼ 1, wð1j 100Þ ¼ 0, wð1j 101Þ ¼ 0, wð1j 110Þ ¼ 0, wð1j 111Þ ¼ 0, (15) and w(0| x1x2x3) = 1 w(1| x1x2x3) for all x1 , x2 , x3 {0, 1}. For k = 2, Eq. 14 becomes Pnþ1 ð00Þ ¼ Pn ð 0000 Þ þ Pn ð 1000 Þ þ Pn ð 1100 Þ þPn ð 1101 Þ þ Pn ð 1110 Þ þ Pn ð 1111 Þ, Pnþ1 ð01Þ ¼ Pn ð 0001 Þ þ Pn ð 1001 Þ þ Pn ð 1010 Þ þPn ð 1011 Þ, Pnþ1 ð10Þ ¼ Pn ð 0100 Þ þ Pn ð 0101 Þ þ Pn ð 0110 Þ þPn ð 0111 Þ, Pnþ1 ð11Þ ¼ Pn ð 0010 Þ þ Pn ð 0011 Þ: (16)

It is obvious that this system of equations cannot be iterated over n, because on the left-hand side we have probabilities of blocks of length 2, and on the right-hand side – probabilities of blocks of length 4. Of course, not all these probabilities are independent, thus it will be better to rewrite the above using the short form representation. Since among the block probabilities of length 2 only two are independent, we can take only two of the above equations and express all block probabilities occurring in them by their short form representation, using Eq. 10. This reduces Eq. 16 to Pnþ1 ð0Þ ¼ 1 Pn ð0Þ þ Pn ð000Þ, Pnþ1 ð00Þ ¼ 1 2Pn ð0Þ þ Pn ð00Þ þ Pn ð000Þ: (17) Although much simpler, the above system of equations still cannot be iterated, because on the right-hand side we have an extra variable Pn(000). To put it differently, one cannot reduce iterations of F to iterations of a ﬁnite-dimensional map (in this case, two-dimensional map). For this reason, a special method has been developed to approximate orbits of F by orbits of ﬁnite-dimensional maps.

Bayesian Approximation For a given measure m, it is clear that the knowledge of P(k) is enough to determine all P(i) with

i < k, by using consistency conditions. What about i > k? Obviously, since the number of independent components in P(i) is greater than in P(k) for i > k, there is no hope to determine P(i) using only P(k). It is possible, however, to approximate longer block probabilities by shorter block probabilities using the idea of Bayesian extension. Suppose now that we want to approximate P(a1a2 . . . ak+1) by P(a1a2 . . . ak). One can say that by knowing P(a1a2 . . . ak) we know how values of individual symbols in a block are correlated providing that symbols are not farther apart than k 1. We do not know, however, anything about correlations on the larger length scale. The only thing we can do in this situation is to simply neglect these higher length correlations and assume that if a block of length k is extended by adding another symbol to it on the right hand side, then the conditional probability of ﬁnding a particular value of that symbol does not signiﬁcantly depend on the left-most symbol, that is, Pða1 a2 . . . akþ1 Þ Pða2 . . . akþ1 Þ : Pð a 1 . . . a k Þ Pð a 2 . . . a k Þ

(18)

This produces the desired approximation of k + 1 block probabilities by k block and k 1 block probabilities, Pða1 a2 . . . akþ1 Þ

Pða1 . . . ak ÞPða2 . . . akþ1 Þ , Pð a 2 . . . ak Þ (19)

where we assume that the denominator is positive. If the denominator is zero, then we take P(a1a2 . . . ak+1) = 0. In order to avoid writing separate cases for denominator equal to zero, we will use the following convention, 8 a a < ≔ b b : 0

if b 6¼ 0,

(20)

if b ¼ 0:

Now, let m MðXÞ be a measure with associated probabilities P : A ⋆ ! ½0, 1, PðbÞ ¼ block m ½bi for all i ℤ and b A ⋆ . For k > 0, deﬁne P~ : A ⋆ ! ½0, 1 such that

344

Orbits of Bernoulli Measures in Cellular Automata

P~ a1 a2 . . . ap ¼ 8 > < P a1 a2 . . . ap ∏pkþ1 Pðai . . . aiþk1 Þ i¼1 > : pk ∏i¼1 Pðaiþ1 . . . aiþk1 Þ

if p k,

(21)

otherwise:

Then P~ determines a shift-invariant probability measure e m ðkÞ MðXÞ , to be called Bayesian approximation of m of order k. When there exists k such that Bayesian approximation of m of order k is equal to m, we call m a Markov measure or a ﬁnite block measure of order k. The space of shift-invariant probability Markov measures of order k will be denoted by MðkÞ ðXÞ, n o Mð k Þ ð X Þ ¼ m Mð X Þ : m ¼ e m ðk Þ :

(22)

It is often said that the Bayesian approximation “maximizes entropy.” Let us deﬁne the entropy density of a shift-invariant measure m MðXÞ as hðmÞ ¼ lim n!1

1 X PðbÞlogPðbÞ, n bA n

approximating orbits of F, known as the local structure theory (Gutowitz et al. 1987; Gutowitz and Victor 1987). Following these authors, let us deﬁne the scramble operator of order k, denoted by X(k), and deﬁned as m ðk Þ : XðkÞ m ¼ e

(26)

The scramble operator, when applied to a shift invariant measure m, produces a Markov measure of order k which agrees with m on all blocks of length up to k. The idea of local structure approximation is that each time step, instead of just applying F, we apply the scramble operator, then F, and then the scramble operator again. This yields a sequence of Markov measures vðnkÞ deﬁned recursively as ðkÞ

vnþ1 ¼ XðkÞ FXðkÞ vðnkÞ ,

ðk Þ

v0 ¼ m:

(27)

The sequence deﬁned as (23)

where, as usual, P(b) = m([b]i) for all i ℤ and b A ⋆ . It has been established by Fannes and Verbeure (1984) that for any m MðXÞ , the entropy density of the k-th order Bayesian approximation of m is given by X X h e m ðk Þ ¼ PðaÞlogPðaÞ PðaÞlogPðaÞ,

n

XðkÞ FXðkÞ

n o1 m

n¼0

(28)

will be called the local structure approximation of level k of the exact orbit fFn mg1 n¼0 . Note that all terms of this sequence are Markov measures, thus the entire local structure approximation of the orbit lies in

(24)

M k ðXÞ . The following theorem describes the local structure approximation in a formal way.

and that for any m MðXÞ and any k > 0, the entropy density of m does not exceed the entropy density of its k-th order Bayesian approximation,

Theorem 2 For any positive integer n, and for any shift invariant probability measure m, vðnkÞ weakly converges to Fnm as k ! 1.

a A k1

aA k

e ðkÞ : hðmÞ h m

(25)

Local Structure Maps Moreover, one can show that the sequence of k-th order Bayesian approximations ofm MðXÞweakly converges to m as k ! 1 (Gutowitz et al. 1987). Using the notion of Bayesian extension, H. Gutowitz et al. developed a method of

A nice feature of Markov measures is that they can be entirely described by specifying probabilities of a ﬁnite number of blocks. This makes construction of ﬁnite-dimensional maps

Orbits of Bernoulli Measures in Cellular Automata

345

generating approximate orbits of measures in CA possible. Deﬁne Qn ðbÞ ¼ vðnkÞ ð½bÞ. Using deﬁnitions of F and X, Eq. 27 yields, for any a A k, Qnþ1 ðaÞ ¼

X

wðaj bÞ

a A bjþ2r

∏2rþ1 i¼1 Qn b½i, iþk1 : 2rþ1 P ∏i¼1 c A Qn cb½iþ1, iþk1 (29) If we arrange Qn(a) for all a A k in the lexicographical order to form a vector Qn, we will obtain Qnþ1 ¼ LðkÞ ðQn Þ, k

(30)

k

where LðkÞ : ½0, 1jA j ! ½0, 1jA j has components deﬁned by Eq. 29. L(k) will be called the local structure map of level k. Of course, not all components of Q are independent, due to consistency conditions. We can, therefore, further reduce the dimensionality of the local structure map to (N 1)Nk 1 dimensions. This will be illustrated for rule 14 considered earlier. Recall that for rule 14, if we start with an initial measure m and deﬁne Pn(b) = (Fnm)[b], then Pnþ1 ð0Þ ¼ 1 Pn ð0Þ þ Pn ð000Þ, Pnþ1 ð00Þ ¼ 1 2Pn ð0Þ þ Pn ð00Þ þ Pn ð000Þ: (31) The corresponding local structure map can be obtained from the above by simply replacing P by Q and using the fact that block probabilities Q represent the Markov measure of order k, thus Qn ð000Þ ¼

Qn ð00ÞQn ð00Þ : Q n ð 0Þ

Equation 17 would then become

(32)

Qnþ1 ð0Þ ¼ 1 Qn ð0Þ þ

Qn ð00Þ2 , Qn ð0Þ

Qnþ1 ð00Þ ¼ 1 2Qn ð0Þ þ Qn ð00Þ þ

Qn ð00Þ2 , Q n ð 0Þ (33)

where Q0(0) = P0(0), Q0(00) = P0(00). The above is a formula for recursive iteration of a twodimensional map, thus one could compute Qn(0) and Qn(00) for consecutive n = 1, 2. . . without referring to any other block probabilities, in stark contrast with Eq. 17. Block probabilities Q approximate exact block probabilities P, and the quality of this approximation varies depending on the rule. Nevertheless, as the order of approximation k increases, the values of Q become closer and closer to P, due to the weak convergence of vðnkÞ to Fnm. As an illustration of this convergence, let us consider a probabilistic rule deﬁned by wð1j 000Þ ¼ 0, wð1j 001Þ ¼ a, wð1j 010Þ ¼ 1 a, wð1j 011Þ ¼ 1 a, wð1j 100Þ ¼ a, wð1j 101Þ ¼ 0, wð1j 110Þ ¼ 1 a, wð1j 111Þ ¼ 1 a, (34) and w(0| x1x2x3) = 1 w(1| x1x2x3) for all x1, x2, x3 {0, 1}, where a [0, 1] is a parameter. This rule is known as a-asynchronous elementary rule 18 (Fatès 2009), because for a = 1 it reduces to elementary CA rule 18. It is known that for this rule, if one starts with the initial symmetric Bernoulli measure m1/2, then limn ! 1 Pn(1) = 0 if a ac, and limn ! 1 Pn(1) > 0 if a > ac, where ac 0.7. This phenomenon can be observed in simulations if one iterates the rule for a large number of time steps T and records PT(1). The graph of PT(1) as a function of a for T=104, obtained by such direct simulations of the rule, is shown in Fig. 1. To approximate PT(1) by the local structure theory, one can construct local structure map of order k for this rule, iterate it T times, and obtain QT (1), which should approximate PT(1). The graphs of QT (1) versus a, obtained this way, are shown in Fig. 1 as dashed lines. One can clearly see that as k increases, the dashed curves approximate the graph of PT(1) better and better.

346 0.35 simulation LS 2 LS 3 LS 4 LS 5 0.25 LS 6 LS 9 0.2 0.3

PT (1)

Orbits of Bernoulli Measures in Cellular Automata, Fig. 1 Graph of PT(1) for T=104 as a function a for probabilistic CA rule deﬁned in Eq. 34. Continuous line represents values of PT(1) obtained by Monte Carlo simulations, and dashed lines values of QT (1) obtained by iterating local structure maps of level k = 2 , 3 , 4 , 5 , and 9

Orbits of Bernoulli Measures in Cellular Automata

0.15 0.1 0.05 0 0.1

0.2

For some simple CA rules, the local structure approximation is exact. Such is the case of idempotent rules, that is, CA rules for which F2 = F. Gutowitz et al. (1987) found that this is also the case for what he calls linear rules, toggle rules, and asymptotically trivial rules.

Exact Calculations of Probabilities of Short Blocks Along the Orbit If approximations provided by the local structure theory are not enough, one can attempt to compute orbits of Bernoulli measures exactly. Typically, it is not possible to obtain expressions for all block probabilities Pn(a) along the orbit, yet one can often compute Pn(a) if a is short, for example, containing just one, two, or three symbols. For elementary CA rules, the behavior of Pn(1) as a function of n has been studied extensively by many authors, starting from Wolfram (1983), who determined numerical values of P1(1) for a wide class of CA rules and postulated exact values for some of them. Later one exact values of Pn(1) have been established for some elementary rules, and in some cases, Pn(a) has been computed for all jaj 3. We will discuss these results in what follows. When the rule is deterministic, transition probabilities in Eq. 11 take values in the set

0.5 α

0.4

0.3

0.6

0.7

0.8

0.9

{0, 1}. Let us consider elementary cellular automata, that is, binary rules for which N ¼ 1, A ¼ f0, 1g and the radius r = 1. For such rules, deﬁne the local function f by f(x1, x2, x3) = w(1| x1x2x3) for all x1 , x2 , x3 {0, 1}. Elementary CA with the local function f are usually identiﬁed by their Wolfram number W(f), deﬁned as (Wolfram 1983)

W ðf Þ ¼

1 X

f ðx1 , x2 , x3 Þ2ð2 x1 þ2 2

1

x2 þ20 x3 Þ

:

x1 , x2 , x3 ¼0

A block evolution operator corresponding to f is a mapping f : A ⋆ 7! A ⋆ deﬁned as follows. Let a ¼ a0 a1 . . . an1 A n where n 3. Then n3 f ðaÞ ¼ f aj , aiþ1 , aiþ2 i¼0 :

(35)

For elementary CA Eq. 11 reduces to ðFmÞð½aÞ ¼

X

mð½bÞ,

(36)

b f 1 ðaÞ

where we dropped indices indicating where the cylinder set is anchored (we assume shiftinvariance of measure m), and where f1(a) is the set of preimages of a under the block evolution operator f. This can be generalized to the n-th iterate of F,

Orbits of Bernoulli Measures in Cellular Automata

X

347

(37)

5. Rules for which preimage sets are related to preimage sets of some known solvable rule

where, again, fn(a) is the set of preimages of a under fn, the n-th iterate of f. Thus, if we know the elements of the set of n-step preimages of the block a under the block evolution operator f, then we can easily compute the probability Pn(a). Now, let us suppose that the initial measure is a Bernoulli measure mp, deﬁned by mp ð½aÞ ¼ p#1 ðaÞ ð1 pÞ#0 ðaÞ, where # (a) denotes number of sym-

Selection of the most interesting examples in each category is given below.

Pn ðaÞ ¼ ðFn mÞð½aÞ ¼

mð½bÞ,

b f n ðaÞ

s

bols s in a and where p [0, 1] is a parameter. In such a case Eq. 37 reduces to Pn ð aÞ ¼

X bf

n

p#1 ðbÞ ð1 pÞ#0 ðbÞ :

(38)

ðaÞ

Balanced Preimages: Surjective Rules It is well known that the symmetric Bernoulli measure m1/2 is invariant under the action of a surjective rule (see Pivato 2009, and references therein). In one dimension, surjectivity is a decidable property, and the relevant algorithm is known, due to Amoroso and Patt (1972). Among elementary CA rules, surjective rules have the following Wolfram numbers: 15, 30, 45, 51, 60, 90, 105, 106, 150, 154, 170, and 204. For all of them, for the initial measure m = m1/2, and for any block a,

Furthermore, if p = 1/2, then the above reduces to even simpler form, pn ð aÞ ¼

X

1 card f n ðaÞ ¼ : 2jbj 2jajþ2n b f n ðaÞ

(39)

For many elementary CA rules and for short blocks a, the sets fn(a) exhibit simple enough structure to be described and enumerated by combinatorial methods, so that the formula for card fn can be constructed and/or the sum in Eq. 38 can be computed. Although there is no precise deﬁnition of “simple enough structure,” the known cases can be informally classiﬁed into ﬁve groups: 1. Rules with preimage sets that are “balanced” (have the same number of preimages for each block) 2. Rules with preimage sets mostly composed of long blocks of identical symbols (having long runs) or long blocks of arbitrary symbols 3. Rules with preimage sets that can be described as sets of strings in which some local property holds everywhere 4. Rules with preimage sets that can be described as strings in which some global (nonlocal) property holds

Pn ðaÞ¼ 2jaj :

(40)

The above result is a direct consequence of the Balance Theorem, ﬁrst proved by Hedlund (1969), which states that for a surjective rule, card f1(a) is the same for all blocks a of a given length. For elementary rules this implies that card f1(a) = 4, and, therefore, card fn(a)=4n. From Eq. 39 one then obtains Eq. 40. Preimages with Long Runs and Arbitrary Symbols: Rule 130 Consider the elementary CA with the local function f ðx1 , x2 , x3 Þ ¼

1 if ðx1 x2 x3 Þ ¼ ð001Þ or ð111Þ, 0 otherwise, (41)

Its Wolfram number is W(f) = 130, and we will refer to it as simply “rule 130.” Subsequently, any rule with Wolfram number W(f) will be referred to as “rule W(f).” For rule 130 and for mp, the probabilities Pn(a) are known for jaj 3 (Fukś and Skelton 2010). The corresponding formulae are rather long, thus we give only the expression for Pn(0).

348

Orbits of Bernoulli Measures in Cellular Automata

Pn ð0Þ ¼ 1 p2nþ1 p p4dðn2Þ=2eþ4 þ p4dðn2Þ=2eþ5 p4bn=2cþ3 þ p3 p þ 1 : p3 þ p2 þ p þ 1

(42) The above result is based on the fact that for rule 130, the set fn(111) has only one element, namely the block 11...1, hence card fn(111) = 1. Moreover, the set fn(001) consists of all blocks of the form ⋆ ..⋆ ...1 |ﬄﬄﬄﬄ.{zﬄﬄﬄ ﬄ} 1 0 11|ﬄﬄ{zﬄﬄ} 2n2i

or

ðif i is oddÞ

2i

...1 ⋆ ..⋆ |ﬄﬄﬄﬄ.{zﬄﬄﬄ ﬄ} 0 0 11|ﬄﬄ{zﬄﬄ} 2n2i

ðif i is evenÞ,

2i

where i {0 . . . n} and ⋆ denotes an arbitrary value in A . Probabilities of occurrence of blocks 111 and 001 can thus be easily computed. Using the fact that for this rule Pn(0) = 1 Pn 1(111) Pn1(001), one then obtains Eq. 42. The ﬂoor and ceiling operators appear in that formula because different expressions are needed for odd and even n, as it is evident from the structure of preimages of 001 described above. Rule 130 is an example of a rule where convergence of Pn(0) to its limiting value is essentially exponential (like in rule 172 discussed below, except that there are some small variations between values corresponding to even and odd n). Preimages Described by a Local Property: Rule 172 The local function of rule 172 is deﬁed as f ðx 1 , x 2 , x 3 Þ ¼

x2 if x1 ¼ 0, x3 if x1 ¼ 1:

Proposition 4 Block b of length 2n + 1 belongs to fn(1) for rule 172 if and only if it has the structure b ¼ ⋆⋆ . . . ⋆ 001⋆⋆ . . . ⋆ or b ¼ |ﬄﬄﬄﬄﬄ{zﬄﬄﬄﬄﬄ} |ﬄﬄﬄﬄﬄ{zﬄﬄﬄﬄﬄ} n

n2

a binary string which does not contain any pair of adjacent zeros, and c1 c2 ¼

1⋆, ⋆1,

if anþ1 ¼ 0, otherwise:

(44)

Since the number of binary strings of length n without any pair of consecutive zeros is known to be Fn+2, where Fn is the n-th Fibonacci number, it is not surprising that Fibonacci numbers appear in expressions for block probabilities of rule 172. For this rule and m = m1/2, probabilities Pn(a) are known for jaj 3, as shown below. 7 Fnþ3 Pn ð0Þ ¼ nþ2 , 8 2 Pn ð00Þ ¼ 3=4 2n2 Fnþ3 2n4 Fnþ2 , Pn ð000Þ ¼ 5=8 2n2 Fnþ3 2n4 Fnþ2 , Pn ð010Þ ¼ 1=8 2n3 Fnþ1 : (45) Note that the above are probabilities in the short block representation, thus all remaining probabilities of blocks of length up to 3 can be obtained using Eq. 10. More recently, Pn(0) has been computed for arbitrary mp (Fukś 2016b) Pn ð 0Þ ¼ 1 ð 1 p Þ 2 p

p2 n1 , a1 l1 þ a2 ln1 2 l2 l1

(46)

where 1 1 pﬃﬃﬃﬃﬃﬃﬃﬃﬃﬃﬃﬃﬃﬃﬃﬃﬃﬃﬃﬃ l1 , 2 ¼ p pð4 3pÞ, 2 2

(43)

The combinatorial structure of fn(a) for this rule can be described, for some blocks a, as binary strings with forbidden sub-blocks. More precisely, one can prove the following proposition (Fukś 2010).

n2

⋆⋆ . . . ⋆ a1 a2 . . . anþ1 c1 c2 , where a1a2 . . . an is |ﬄﬄﬄﬄﬄ{zﬄﬄﬄﬄﬄ}

a1, 2 ¼

(47)

p pﬃﬃﬃﬃﬃﬃﬃﬃﬃﬃﬃﬃﬃﬃﬃﬃﬃﬃﬃﬃ p2 1 pð4 3pÞ 1 : (48) 2 2

Preimages Described by a Nonlocal Property: Rule 184 While in rule 172 the combinatorial description of sets fn(a) involved some local conditions (e.g., two consecutive zeros are forbidden), in rule

Orbits of Bernoulli Measures in Cellular Automata

349

184, with the local function f(x1, x2, x3) = x1 + x2x3 x1x2, the conditions are more of a global nature, that is, involving properties of longer substrings. In particular, one can show the following. Proposition 5 The block b1b2 . . . b2n+2 belongs to fn(00) under rule 184 if and only if b1 = 0 , P b2 = 0 and 2 þ ki¼3 xðbi Þ > 0 for every 3 k 2n + 2, where x(0) = 1 , x(1) = 1. Proof of this property relies on the fact that rule 184 is known to be equivalent to a ballistic annihilation process (Krug and Spohn 1988; Fukś 1999; Belitsky and Ferrari 2005). Another crucial property of rule 184 is that it is number-conserving, that is, conserves the number of zeros and ones. Using this fact and the above proposition, probabilities Pn(a) can be computed for mp and jaj 2,

j 2n þ 1 Pn ð0Þ ¼ 1 p, Pn ð00Þ ¼ nþ1 nþ1j j¼1 nþ1 X

pnþ1j ð1 pÞnþ1þj :

Pn ð00Þ¼ 2

lim Pn ð00Þ ¼

n!1

1 2p if p < 1=2, 0 otherwise:

(50)

All the above results can be extended to generalizations of rule 184 with larger radius (Fukś 1999). A special case of m1/2 is particularly interesting, as in this case probabilities of blocks up to length 3 can be obtained, 1 Pn ð 0Þ ¼ , 2

(51)

2n þ 1 , nþ1

Pn ð000Þ¼ 22n3

2n þ 1 , nþ1

1 32n 2n þ 1 Pn ð010Þ ¼ 3 2 : nþ1 2

(52)

(53)

(54)

Using Stirling’s approximation for factorials for large n, one obtains Pn(00) n1/2, thus Pn(00) converges to 0 as a power law with the exponent 1/2. Preimage Sets Related to Preimages of Other Solvable Rules: Rule 14 The local function of rule 14 is deﬁed by f(0, 0, 1) = f(0, 1, 0) = f(0, 1, 1) = 1, and f(x0, x1, x2) = 0 for all other triples (x0, x1, x2) {0, 1}3. For rule 14 and m = m1/2, the probabilities Pn(a) are known for jaj 3 and are given by

1 2n 1 1þ C n1 , 2 4n

(55)

1 Pn ð00Þ¼ 222n ðn þ 1ÞCn þ , 4

(56)

Pn ð000Þ¼ 22n3 ð4n þ 3ÞCn ,

(57)

Pn ð010Þ¼ 222n ðn þ 1ÞCn ,

(58)

(49) The main idea which is used in deriving the above expression is the fact that preimage sets f1(00) have a similar structure to trajectories of one-dimensional random walk starting from the origin and staying on the positive semi-axis. Enumeration of such trajectories is a well-known combinatorial problem, and the binomial coefﬁcient appearing in the expression for Pn(00) indeed comes from this enumeration procedure. In the limit of large n one can demonstrate that

22n

Pn ð 0 Þ ¼

where Cn is the n-th Catalan number (Fukś and Haroutunian 2009). These formulae were obtained using the fact that this rule conserves the number of blocks 10 and that the combinatorial structure of preimage sets of some short blocks resembles the structure of related preimage sets under the rule 184. More precisely, computation of the above block probabilities relies on the following property (see ibid. for proof). Proposition 6 For any n ℕ, the number of n-step preimages of 101 under the rule 14 is the same as the number of n-step preimages of 000 under the rule 184, that is,

350

Orbits of Bernoulli Measures in Cellular Automata n card f n 14 ð101Þ ¼ card f 184 ð000Þ,

(59)

where subscripts 184 and 14 indicate block evolution operators for, respectively, CA rules 184 and 14. Moreover, the bijection Mn from the n set f n 184 ð000Þ to the set f 14 ð101Þ is deﬁned by ( Mn ðx0 x1 . . . xm Þ ¼ n þ j þ 1 þ

j X

)m xi mod2

i¼0

j¼0

(60) for m ℕ and for x0x1 . . . xm {0, 1}m. As in the case of rule 184, one can show that for rule 14 and for large n, Pn ð 0 Þ

1 1 1 þ pﬃﬃﬃ n2 : 2 4 p

(61)

The power law which appears here exhibits the same exponent as in the case of rule 184 for Pn(00).

Convergence of Block Probabilities The examples shown in the previous sections indicate that in all cases for which Pn(a) can be computed exactly, as n ! 1, Pn(a) remains either constant, or converges to its limiting value exponentially or as a power law. The exponential convergence is the most prevalent. Indeed, for many other elementary CA rules for which formulae for Pn(0) are either known or conjectured, the exponential convergence to P1(0) can be observed most frequently. This includes 15 elementary rules which are known as asymptotic emulators of identity (Rogers and Want 1994; Fukś and Soto 2014). Formulae for Pn(1) for the initial measure m1/2 for these rules are shown below. Starred rules are those for which a formal proof has been published in the literature (see Fukś and Soto 2014, and references therein). • • • • •

Rule 13: Pn(1) = 7/16 (2)n3 Rule 32*: Pn(1)=212n Rule 40: Pn(1)=2n1 Rule 44: Pn ð1Þ ¼ 1=6 þ 56 22n Rule 77⋆ : Pn(1) = 1/2

• • • • • • • • •

Rule 78: Pn(1) = 9/16 Rule 128⋆ : Pn(1)=212n Rule 132⋆ : Pn ð1Þ ¼ 1=6 þ 13 22n Rule 136⋆ : Pn(1)=2n1 Rule 140⋆ : Pn(1) = 1/4 + 2n2 Rule 160⋆ : Pn(1)=2n1 Rule 164 : Pn ð1Þ ¼ 1=12 13 4n þ 34 2n Rule 168⋆ : Pn(1)=3n22n1 Rule 172⋆: Pn(1)=18 þ pﬃﬃ pﬃﬃ pﬃﬃ pﬃﬃ

104 5

1 5

n

þ 10þ4 5

1þ 5

n

4022n

• Rule Pn(1) = 1/2 The formula for rule 172, included here for completeness, can obviously be obtained from Eq. 45 by using explicit expressions for Fibonacci numbers in terms of powers of the golden ratio. Power laws appearing in rules 184 and 14, as mentioned already, are a result of the fact that dynamics of these rules can be understood as a motion of deterministic “particles” propagating in a regular background. The same type of “defect kinematics” has been observed, among other elementary CA rules, in rule 18 (Grassberger 1984), for which Pn ð11Þ n1=2 : The above power law can be explained by the fact that in rule 18 one can view sequences of 0s of even length as “defects” which perform a random walk and annihilate upon collision, as discovered numerically by Grassberger (1984) and later formally demonstrated by Eloranta and Nummelin (1992). A very general treatment of particle kinematics in CA conﬁrming this result can be found in the work of Pivato (2007). Another example of an interesting power law appears in rule 54, for which Boccara et al. (1991) numerically veriﬁed that Pn ð1Þ ng , where g 0.15. Particle kinematics of rule 54 is now very well understood (Pivato 2007), but the

Orbits of Bernoulli Measures in Cellular Automata

351

above power law has not been formally demonstrated, and the exact value of the exponent g remains unknown.

X

P n ð aÞ ¼

bA

wn ðaj bÞP0 ðbÞ:

(65)

jajþ2nr

Since some of the transition probabilities may be zero, we deﬁne, for any block b A ⋆ ,

Examples of Exact Results for Probabilistic CA Rules

n o suppwn ðajÞ ¼ b A jajþ2nr : wn ðaj bÞ > 0 ,

For probabilistic rules, one cannot use Eq. 38 because the block evolution operator fn does not have any obvious nondeterministic version. One thus has to work directly with Eq. 11. Equation 11 can be written for the n-th iterate of F, ðFn mÞ ½ai ¼

X

wn ðaj bÞ

b Ajajþ2nr

m ½binr for all i ℤ, a A ⋆ , (62)

where we deﬁne the n-step block transition probability wn recursively, so that, when n 2 and for any blocks a A ⋆ and b A jajþ2rn , wn ðaj bÞ ¼

0 0 wn1 aj b w b j b :

X b0 A jajþ2rðn1Þ

(63) The n-step block transition probability wn(a| b) can be intuitively understood as the conditional probability of seeing the block a after n iterations of F, conditioned on the fact that the original conﬁguration contained the block b. Using the deﬁnition of w given in Eq. 12, one can produce an explicit formula for wn, wn ðaj bÞ ¼

X bn1 A jaj2rðn1Þ ⋮ b1 A jajþ2r

n2 wðaj b1 Þ ∏ wðbi j biþ1 Þ

(66) and then we have Pn ð a Þ ¼

X b supp wn

wn ðaj bÞP0 ðbÞ:

(67)

ðajÞ

In some cases, suppwn(a|) is small and has a simple structure, and the needed wn(a|b) can be computed directly from Eq. 64. This approach has been successfully used for a class of probabilistic CA rules known as a-asynchronous rules with single transitions (Fukś and Skelton 2011a). We show two examples of such rules below. Rule 200A Rule 200A, known as a-asynchronous rule 200, is deﬁned by transition probabilities 8 if b f000, 001, 200, 010, k2 < k1 X n1 nkþj n a nkþ1 n þb aj w ð1j bÞ ¼ b b k1 j > > j¼0 : 1

For all other blocks in suppwn(1| ) one has w (1| b) = 1. Using this result, probability Pn(0) can be computed assuming initial measure mp, although the summation in Eq. 62 is rather complicated. The end result, shown below, is nevertheless surprisingly simple. n

Pn ð0Þ ¼ 1 rð1 rÞ r2 ð1 ð1 rÞaÞn : (74) Corresponding formulae for Pn(a) for all jaj 3 have been constructed as well, but are omitted here. Complete Sets Another case when Eq. 14 becomes solvable is when there exists a subset of blocks which is called complete. A set of words A ⋆ C ¼

if k ¼ 1, if 2 k n,

(73)

if k ¼ n þ 1:

fa1 , a2 , a3 , . . .g is complete with respect to a CA rule F if for every a C and n ℕ , Pn +1(a) can be expressed as a linear combination of Pn(a1), Pn(a2), Pn(a3), . . .. In this case, one can write Eq. 14 for blocks of the complete set only, and the right-hand sides of them will also only include probabilities of blocks from the complete set. This way, a well-posed system of recurrence equations is obtained, and (at least in principle) it should be solvable. This approach has been recently applied to a probabilistic CA rule deﬁned by

wð1j 000Þ ¼ 0, wð1j 001Þ ¼ a, wð1j 010Þ ¼ 1, wð1j 011Þ ¼ 1, wð1j 100Þ ¼ b, wð1j 101Þ ¼ g, wð1j 110Þ ¼ 1, wð1j 111Þ ¼ 1, (75)

Orbits of Bernoulli Measures in Cellular Automata

353

and w(0| b) = 1 w(1| b) for all b {0, 1}3, where a, b, g [0, 1] are ﬁxed parameters. This rule can be viewed as a generalized simple model for diffusion of innovations on onedimensional lattice (Fukś 2016a). The complete set for this rule consists of blocks 101, 1001, 100001,. . . Eq. 14 for blocks of the complete set simpliﬁes to Pnþ1 ð101Þ ¼ ð1 gÞPn ð101Þ þða 2ab þ bÞPn ð1001Þ þabPn ð10001Þ,

Pnþ1 10k 1 ¼ ð1 aÞð1 bÞPn 10k 1 þ ða 2ab þ bÞPn 10kþ1 1 þ abPn 10kþ2 1 : (77) The above equations can be solved, and, using the cluster expansion formula (Stauffer and Aharony 1994),

(76)

and, for k > 1,

Pn ð 0 Þ ¼

1 X

kPn 10k 1 ,

(78)

k¼1

one obtains, assuming that the initial measure is mp,

Pn ð 0 Þ ¼

Eððpb 1Þðpa 1ÞÞn þ Fð1 gÞn ðG þ HnÞð1 gÞn1

where E, F, G, H are constants depending on parameters a, b, g and p (for detailed formulae, see Fukś 2016a). For abp2 (a + b)p + g = 0, this is an example of a linear-exponential convergence of Pn(0) toward its limiting value, the only one known for a binary rule.

Future Directions Both approximate and exact methods for computing orbits of Bernoulli measures under the action of cellular automata need further development. Regarding approximate methods, although some simple classes of CA rules for which local structure approximation becomes exact are known, it is not known if there exist any wider classes of nontrivial rules for which this would be the case. This is certainly an area which needs further research. There seems to be some evidence that orbits of many deterministic rules possessing additive invariants are very well approximated by local structure theory, but no general results are known.

if abp2 ða þ bÞp þ g 6¼ 0, if abp2 ða þ bÞp þ g ¼ 0,

(79)

Regarding exact methods, the situation is similar. Although methods for computing exact values of Pn(a) presented here are applicable to many different rules, it is still not clear if they are applicable to some wider classes of CA in general. Some such classes has been proposed, but formal results are still lacking. For example, there is a number of rules for which convergence of Pn(1) to its limiting value P1(1) is known to be exponential, and it has been conjectured that for all rules known as asymptotic emulators of identity this is indeed the case. However, there seems to be some recent evidence that for rule 164, which belongs to asymptotic emulators of identity, the convergence is not exactly exponential (A. Skelton, private communication). Are there any other classes of CA rules for which the convergence is always exponential? And, more importantly, are there any wide classes of nontrivial CA for which exact formulae for probabilities of short block are obtainable? Another interesting question is the relationship between exact orbits of CA rules and approximate orbits obtained by iterating local structure maps. Which features or exact orbits are “inherited” by approximate orbits? It seems that often the

354

existence of additive invariants is “inherited” by local structure maps, yet more work in this direction is needed. On a related note, such behavior of Pn(1) as observed in rules 172 or 140A (discussed earlier in this entry) strongly resembles hyperbolicity in ﬁnitely dimensional dynamical systems. Hyperbolic ﬁxed points are common type of ﬁxed points in dynamical systems. If the initial value is near the ﬁxed point and lies on the stable manifold, the orbit of the dynamical system converges to the ﬁxed point exponentially fast. One could argue that the exponential convergence to P1(1) observed in such rules as rule 172 or 140A is somewhat related to ﬁnitely dimensional hyperbolicity. Since local structure maps which approximate dynamics of a given CA are ﬁnitely dimensional, one could ask what is the nature of their ﬁxed points – are these hyperbolic for CA exhibiting hyperbolic-like dynamics? Is hyperbolicity of orbits of CA rules somewhat “inherited” by local structure maps? If so, under what conditions does this happen? All those questions need to be investigated in details in future years. Finally, one should mention that both theoretical developments and examples presented in this entry pertain to one-dimensional cellular automata. Higher-dimensional systems have been studied in the context of the local structure theory (Gutowitz and Victor 1987), and some examples or two-dimensional cellular automata with exact expressions for small block probabilities are known (Fukś and Skelton 2011b), yet the orbits of Bernoulli measures under higher-dimensional CA are still mostly an unexplored terrain. Given the importance of two- and three-dimensional CA in applications, this subject will likely attract some attention in the near future.

Bibliography Amoroso S, Patt YN (1972) Decision procedures for surjectivity and injectivity of parallel maps for tesselation structures. J Comput Syst Sci 6:448–464 Belitsky V, Ferrari PA (2005) Invariant measures and convergence properties for cellular automaton 184 and related processes. J Stat Phys 118(3–4):589–623

Orbits of Bernoulli Measures in Cellular Automata Boccara N, Nasser J, Roger M (1991) Particlelike structures and their interactions in spatiotemporal pattems generated by one-dimensional deterministic cellularautomaton rules. Phys Rev A 44:866–875 Brascamp HJ (1971) Equilibrium states for a one dimensional lattice gas. Commun Math Phys 21(1):56 Eloranta K, Nummelin E (1992) The kink of cellular automaton rule 18 performs a random walk. J Stat Phys 69(5):1131–1136 Fannes M, Verbeure A (1984) On solvable models in classical lattice systems. Commun Math Phys 96:115–124 Fatès N (2009) Asynchronism induces second order phase transitions in elementary cellular automata. J Cell Autom 4(1):21–38. http://hal.inria.fr/inria-00138051 Formenti E, Kůrka P (2009) Dynamics of cellular automata in non-compact spaces. In: Meyers RA (ed) Encyclopedia of complexity and system science. Springer, New York Fukś H (1999) Exact results for deterministic cellular automata trafﬁc models. Phys Rev E Stat Phys Plasmas Fluids Relat Interdiscip Topics 60:197–202, arXiv: comp-gas/9902001 Fukś H (2010) Probabilistic initial value problem for cellular automaton rule 172. DMTCS Proc AL:31–44, arXiv: 1007. 1026 Fukś H (2013) Construction of local structure maps for cellular automata. J Cell Autom 7:455–488, arXiv:1304.8035 Fukś H (2016a) Computing the density of ones in probabilistic cellular automata by direct recursion. In: Louis PY, Nardi FR (eds) Probabilistic cellular automata – theory, applications and future perspectives. Lecture notes in computer science, arXiv: 1506.06655. to appear Fukś H (2016b) Explicit solution of the cauchy problem for cellular automaton rule 172. J Cell Autom, 12 (6):423–444, 2017 Fukś H, Haroutunian J (2009) Catalan numbers and power laws in cellular automaton rule 14. J Cell Autom 4:99–110, arXiv:0711.1338 Fukś H, Skelton A (2010) Response curves for cellular automata in one and two dimensions – an example of rigorous calculations. Int J Nat Comput Res 1:85–99, arXiv: 1108.1987 Fukś H, Skelton A (2011a) Orbits of Bemoulli measure in asynchronous cellular automata. Dis Math Theor Comp Science AP:95–112 Fukś H, Skelton A (2011b) Response curves and preimage sequences of two-dimensional cellular automata. In: Proceedings of the 2011 international conference on scientiﬁc computing: CSC2011, CSERA Press, pp 165–171, arXiv: 1108.1559 Fukś H, Soto JMG (2014) Exponential convergence to equilibrium in cellular automata asymptotically emulating identity. Complex Syst 23:1–26, arXiv:1306.1189 Grassberger P (1984) Chaos and diffusion in deterministic cellular automata. Physica D10(1):52–58

Orbits of Bernoulli Measures in Cellular Automata Gutowitz HA, Victor JD (1987) Local structure theory in more than one dimension. Complex Syst 1:57–68 Gutowitz HA, Victor JD, Knight BW (1987) Local structure theory for cellular automata. Physica D28: 18–48 Hedlund G (1969) Endomorphisms and automorphisms of shift dynamical systems. Math Syst Theory 3:320–375 Krug J, Spohn H (1988) Universality classes for deterministic surface growth. Phys Rev A 38:4271–4283 Kůrka P (2005) On the measure attractor of a cellular automaton. Discrete Contin Dyn Syst 2005:524–535 Kůrka P, Maass A (2000) Limit sets of cellular automata associated to probability measures. J Stat Phys 100:1031–1047

355 McIntosh H (2009) One dimensional cellular automata. Luniver Press, Frome Pivato M (2007) Defect particle kinematics in onedimensional cellular automata. Theor Comput Sci 377(1):205–228 Pivato M (2009) Ergodic theory of cellular automata. In: Meyers RA (ed) Encyclopedia of complexity and system science. Springer, Berlin Rogers T, Want C (1994) Emulation and subshifts of ﬁnite type in cellular aut