scispace - formally typeset
Journal ArticleDOI

Statistical mechanics of cellular automata

Stephen Wolfram
- 01 Jul 1983 - 
- Vol. 55, Iss: 3, pp 601-644
Reads0
Chats0
TLDR
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.
Abstract
Cellular automata are used as simple mathematical models to investigate self-organization in statistical mechanics. A detailed 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 definite rules involving the values of its nearest neighbors. With simple initial configurations, the cellular automata either tend to homogeneous states, or generate self-similar patterns with fractal dimensions \ensuremath{\simeq} 1.59 or \ensuremath{\simeq} 1.69. With "random" initial configurations, the irreversible character of the cellular automaton evolution leads to several self-organization phenomena. Statistical properties of the structures generated are found to lie in two universality classes, independent of the details of the initial state or the cellular automaton rules. More complicated cellular automata are briefly considered, and connections with dynamical systems theory and the formal theory of computation are discussed.

read more

Citations
More filters
Journal ArticleDOI

Cellular automata-based recursive pseudoexhaustive test pattern generator

TL;DR: This paper presents a recursive technique for generation of pseudoexhaustive test patterns that requires substantially less hardware than the existing methods and utilizes the regular, modular, and cascadable structure of local neighborhood Cellular Automata (CA), which is ideally suited for VLSI implementation.
Journal ArticleDOI

When Two and Two Make Four: A Structured Population Without Chaos

TL;DR: A metapopulation model which was built up by the interaction of local populations is considered, which indicates the emergence of self-organized criticality, if the interaction is strong enough.
Book ChapterDOI

Designing Evolware by Cellular Programming

TL;DR: In this article, the authors presented the cellular programming algorithm for co-evolving cellular automata to perform computational tasks such as density, synchronization, ordering, boundary computation, and thinning.
Journal ArticleDOI

Mountains Forest Fire Spread Simulator Based on Geo-Cellular Automaton Combined With Wang Zhengfei Velocity Model

TL;DR: The proposed Wang-Geophysical-CA model enables local managers to plan practical fire prevention activities in Southwest forest area of China as well as improve fire management skills, and will enhance the effectiveness of fire fighting strategies.
Journal ArticleDOI

Asynchronous random Boolean network model based on elementary cellular automata rule 126.

TL;DR: It is shown, both theoretically and by example, that the ARBNs generate an ordered behavior regardless of the updating scheme used, whereas the GARBNs have behaviors that range from order to chaos depending on the type of random variable used to determine the number of nodes to be updated and the parameter combinations.
References
More filters
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.
Journal ArticleDOI

The Chemical Basis of Morphogenesis

TL;DR: In this article, it is suggested that a system of chemical substances, called morphogens, reacting together and diffusing through a tissue, is adequate to account for the main phenomena of morphogenesis.
Journal ArticleDOI

On Computable Numbers, with an Application to the Entscheidungsproblem

TL;DR: This chapter discusses the application of the diagonal process of the universal computing machine, which automates the calculation of circle and circle-free numbers.
Journal ArticleDOI

Metabolic stability and epigenesis in randomly constructed genetic nets

TL;DR: The hypothesis that contemporary organisms are also randomly constructed molecular automata is examined by modeling the gene as a binary (on-off) device and studying the behavior of large, randomly constructed nets of these binary “genes”.
Journal ArticleDOI

Diffusion-limited aggregation, a kinetic critical phenomenon

Abstract: A model for random aggregates is studied by computer simulation The model is applicable to a metal-particle aggregation process whose correlations have been measured previously Density correlations within the model aggregates fall off with distance with a fractional power law, like those of the metal aggregates The radius of gyration of the model aggregates has power-law behavior The model is a limit of a model of dendritic growth