Cellular Automata: Theory and Experiment
Cellular automata, dynamic systems in which space and time are discrete, are yielding interesting applications in both the physical and natural sciences. The thirty four contributions in this book cover many aspects of contemporary studies on cellular automata and include reviews, research reports, and guides to recent literature and available software. Chapters cover mathematical analysis, the structure of the space of cellular automata, learning rules with specified properties: cellular automata in biology, physics, chemistry, and computation theory; and generalizations of cellular automata in neural nets, Boolean nets, and coupled map lattices.
Current work on cellular automata may be viewed as revolving around two central and closely related problems: the forward problem and the inverse problem. The forward problem concerns the description of properties of given cellular automata. Properties considered include reversibility, invariants, criticality, fractal dimension, and computational power. The role of cellular automata in computation theory is seen as a particularly exciting venue for exploring parallel computers as theoretical and practical tools in mathematical physics.
The inverse problem, an area of study gaining prominence particularly in the natural sciences, involves designing rules that possess specified properties or perform specified task. A long-term goal is to develop a set of techniques that can find a rule or set of rules that can reproduce quantitative observations of a physical system. Studies of the inverse problem take up the organization and structure of the set of automata, in particular the parameterization of the space of cellular automata. Optimization and learning techniques, like the genetic algorithm and adaptive stochastic cellular automata are applied to find cellular automaton rules that model such physical phenomena as crystal growth or perform such adaptive-learning tasks as balancing an inverted pole.
Howard Gutowitz is Collaborateur in the Service de Physique du Solide et Resonance Magnetique, Commissariat a I'Energie Atomique, Saclay, France.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Aperiodicity in onedimensional cellular automata
Cyclic cellular automata and related processes
Dimension spectra of linear cellular automata
A cellular automaton ruled by an eccentric conservation
Boolean derivatives on cellular automata
Transition phenomena in cellular automata rule space
Is there a sharp phase transition for deterministic cellular automata?
A comparison of spin exchange and cellular automaton models for diffusioncontrolled reactions
Reversible cellular automata and chemical turbulence
Soliton turbulence in onedimensional cellular automata
Knot invariants and cellular automata
Critical dynamics of onedimensional irreversible systems
Computation theoretic aspects of cellular automata
Reversibility of 2D cellular automata is undecidable
Classifying circular cellular automata
Extracting cellular automaton rules directly from experimental data
Physics and chemistry
An informational process based on reversible universal cellular automata
Representations of geometrical and topological quantities in cellular automata
Relaxation properties of elementary reversible cellular automata
Formal languages and global cellular automaton behavior
A characterization of constanttime cellular automata computation
Constructive chaos by cellular automata and possible sources of an arrow of time
Attractor dominance patterns in sparsely connected Boolean nets
A brief review of cellular automata packages
Maps of recent cellular automata and lattice gas automata literature
algorithm approximation attractor automaton rule behavior binary block Boolean cells cellular automata chaotic classification coefficient complex computation configuration corresponding coupled map lattice cyclic cellular automata DC DC defined definition denote deterministic diagram diffusion dimension distribution dominance dynamical systems entropy equation evolution example finite fixed point function given global graph infinite initial conditions injective input interaction invariant invertible Ising model iterations language lattice learning lemma length linear Margolus Markov mean field mean field theory measure mutual information neighborhood neighbors neural networks North-Holland one-dimensional order of approximation parameter particles pattern periodic phase transition Phys physics probability problem properties quiescent random recursively reversible RUCA rule space rule table sequence simulation solitons spatial statistical mechanics step stochastic structure subshifts surjectivity theorem theory tile tion Toffoli tomata tomaton transient turbulence Turing machine two-dimensional undecidable values Wolfram zero