Open Access
Universality and complexity in cellular automata
Reads0
Chats0
TLDR
In this article, it was shown that all one-dimensional cellular automata fall into four distinct universality classes: limit points, limit cycles, chaotic attractors, and limit cycles.Abstract:
Cellular automata are discrete dynamical systems with simple construction but complex self-organizing behaviour. Evidence is presented that all one-dimensional cellular automata fall into four distinct universality classes. Characterizations of the structures generated in these classes are discussed. Three classes exhibit behaviour analogous to limit points, limit cycles and chaotic attractors. The fourth class is probably capable of universal computation, so that properties of its infinite time behaviour are undecidable.read more
Citations
More filters
Journal ArticleDOI
Evolutionary games on graphs
György Szabó,Gábor Fáth +1 more
TL;DR: The major theme of the review is in what sense and how the graph structure of interactions can modify and enrich the picture of long term behavioral patterns emerging in evolutionary games.
BookDOI
Lattice-Gas Cellular Automata and Lattice Boltzmann Models
TL;DR: In this paper, the authors provide an introduction to lattice gas cellular automata (LGCA) and lattice Boltzmann models (LBM) for numerical solution of nonlinear partial differential equations.
Journal ArticleDOI
Cellular automata as models of complexity
TL;DR: Natural systems from snowflakes to mollusc shells show a great diversity of complex patterns that can be investigated through mathematical models termed ‘cellular automata’, which consist of many identical components, each simple.
Journal ArticleDOI
A Self-Modifying Cellular Automaton Model of Historical Urbanization in the San Francisco Bay Area
TL;DR: A cellular automaton simulation model developed to predict urban growth as part of a project for estimating the regional and broader impact of urbanization on the San Francisco Bay area's climate is described.
References
More filters
Book
The Fractal Geometry of Nature
TL;DR: This book is a blend of erudition, popularization, and exposition, and the illustrations include many superb examples of computer graphics that are works of art in their own right.
Book
Introduction to Automata Theory, Languages, and Computation
TL;DR: This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.
Book
Information Theory and Reliable Communication
TL;DR: This chapter discusses Coding for Discrete Sources, Techniques for Coding and Decoding, and Source Coding with a Fidelity Criterion.
Journal ArticleDOI
Statistical mechanics of cellular automata
TL;DR: Analysis is given of ''elementary'' cellular automata consisting of a sequence of sites with values 0 or 1 on a line, with each site evolving deterministically in discrete time steps according to p definite rules involving the values of its nearest neighbors.