Cellular Automata And Cooperative Systems

This book contains the lectures given at the NATO Advanced Study Institute on `Cellular Automata and Cooperative Systems', held at Les Houches, France, from June 22 to July 2, 1992. The book contains contributions by mathematical and theoretical physicists and mathematicians working in the field of local interacting systems, cellular probabilistic automata, statistical physics, and complexity theory, as well as the applications of these fields.

This book contains the courses given at the Third School on Statistical Physics and Cooperative Systems held at Santiago, Chile, from 14th to 18th December 1992. The main idea of this periodic school was to bring together scientists work with recent trends in Statistical Physics. More precisely ing on subjects related related with non linear phenomena, dynamical systems, ergodic theory, cellular au tomata, symbolic dynamics, large deviation theory and neural networks. Scientists working in these subjects come from several areas: mathematics, biology, physics, computer science, electrical engineering and artificial intelligence. Recently, a very important cross-fertilization has taken place with regard to the aforesaid scientific and technological disciplines, so as to give a new approach to the research whose common core remains in statistical physics. Each contribution is devoted to one or more of the previous subjects. In most cases they are structured as surveys, presenting at the same time an original point of view about the topic and showing mostly new results. The expository text of Fran

The main focus of the book is solvability of cellular automata, that is, expressing the state of a given cell after a given number of steps by an explicit formula. The author considers solutions of two types of initial value problems for cellular automata, the deterministic one and the probabilistic one. In the first chapter the basic concepts of cellular automata theory are introduced. Deterministic initial value problem is introduced next and solutions for selected simple rules are also presented. In the following chapters various techniques for solving the deterministic problem are introduced, using elementary CA rules of increasing complexity as examples. The second part of the book introduces the concept of probability measure in the context of cellular automata and the probabilistic initial value problem for both deterministic and probabilistic rules. The book is amply illustrated with examples and applications such as the density classification problem, phase transitions in traffic models or the diffusion of innovations model. In the appendix, solution formulae (both deterministic and probabilistic) for over 60 elementary cellular automata rules are listed. Ruelle-Frobenius-Perron equations for all 88 minimal elementary cellular automata are also provided.

Cellular automata make up a class of completely discrete dynamical systems, which have became a core subject in the sciences of complexity due to their conceptual simplicity, easiness of implementation for computer simulation, and their ability to exhibit a wide variety of amazingly complex behavior. The feature of simplicity behind complexity of cellular automata has attracted the researchers' attention from a wide range of divergent fields of study of science, which extend from the exact disciplines of mathematical physics up to the social ones, and beyond. Numerous complex systems containing many discrete elements with local interactions have been and are being conveniently modelled as cellular automata. In this book, the versatility of cellular automata as models for a wide diversity of complex systems is underlined through the study of a number of outstanding problems using these innovative techniques for modelling and simulation.

Cellular automata are a class of spatially and temporally discrete mathematical systems characterized by local interaction and synchronous dynamical evolution. Introduced by the mathematician John von Neumann in the 1950s as simple models of biological self-reproduction, they are prototypical models for complex systems and processes consisting of a large number of simple, homogeneous, locally interacting components. Cellular automata have been the focus of great attention over the years because of their ability to generate a rich spectrum of very complex patterns of behavior out of sets of relatively simple underlying rules. Moreover, they appear to capture many essential features of complex self-organizing cooperative behavior observed in real systems. This book provides a summary of the basic properties of cellular automata, and explores in depth many important cellular-automata-related research areas, including artificial life, chaos, emergence, fractals, nonlinear dynamics, and self-organization. It also presents a broad review of the speculative proposition that cellular automata may eventually prove to be theoretical harbingers of a fundamentally new information-based, discrete physics. Designed to be accessible at the junior/senior undergraduate level and above, the book will be of interest to all students, researchers, and professionals wanting to learn about order, chaos, and the emergence of complexity. It contains an extensive bibliography and provides a listing of cellular automata resources available on the World Wide Web.

This book constitutes the proceedings of the 11th International Conference on Cellular Automata for Research and Industry, ACRI 2014, held in Krakow, Poland, in September 2014. The 67 full papers and 7 short papers presented in this volume were carefully reviewed and selected from 125 submissions. They are organized in topical sections named: theoretical results on cellular automata; cellular automata dynamics and synchronization; modeling and simulation with cellular automata; cellular automata-based hardware and computing; cryptography, networks and pattern recognition with cellular automata. The volume also contains contributions from ACRI 2014 workshops on crowds and cellular automata; asynchronous cellular automata; traffic and cellular automata; and agent-based simulation and cellular automata.

The didactical level of exposition, together with many astonishing images and animations, accompanied by the related simple computer programming codes (in Python and POV-Ray languages) make this book an extremely and unique useful tool to test the power of algorithmic information in generating ordered structure models (2D and 3D) like regular geometric shapes, complex shapes like fractals and cellular automata, and biological systems as the organs of a living body. Informational biologists besides mathematicians and physicists of complexity may learn to test their own capabilities in programming and modelling ordered structures starting from random initial conditions at different scale of each system: from elementary particles, to biological systems, to galaxies and the whole universe. Moreover the philosophical comments comparing some aspects of modern information theory to the Aristotelian notion of 'form are very appealing also for the epistemologist and the philosopher involved in complexity matters.

This book constitutes the proceedings of the 13th International Conference on Cellular Automata for Research and Industry, ACRI 2018, held in Como, Italy, in September 2018. The 47 full papers presented in this volume were carefully reviewed and selected from 64 submissions. This volume contains invited contributions and accepted papers from the main track and from the three organized workshops. The volume is organized in the following topics: biological systems modeling; simulation and other applications of CA; multi-agent systems; pedestrian and traffic dynamics; synchronization and control; theory and cryptography; asynchronous cellular automata; and crowds, traffic and cellular automata.