Evolving cellular automata to perform computations: Mechanisms and impediments
From MaRDI portal
Publication:1817054
DOI10.1016/0167-2789(94)90293-3zbMath0860.68076OpenAlexW2004539915WikidataQ56748288 ScholiaQ56748288MaRDI QIDQ1817054
Peter T. Hraber, James P. Crutchfield, Melanie Mitchell
Publication date: 1 December 1996
Published in: Physica D (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-2789(94)90293-3
Related Items (28)
A symbiosis between cellular automata and genetic algorithms ⋮ How random is spatiotemporal chaos of Langton's ant? ⋮ Complexity analysis to explore the structure of ancient stromatolites ⋮ Traveling patterns in cellular automata ⋮ Topological evolution for embodied cellular automata ⋮ Morphogenesis by coupled regulatory networks: reliable control of positional information and proportion regulation ⋮ Analytic proof of the attractors of a class of cellular automaton ⋮ Co-evolving non-uniform cellular automata to perform computations ⋮ Stochastic automated search methods in cellular automata: The discovery of tens of thousands of glider guns ⋮ Stochastic cellular automata solutions to the density classification problem. When randomness helps computing ⋮ Fitness landscape of the cellular automata majority problem: view from the ``Olympus ⋮ GENERATION OF SYMMETRICAL COLORED IMAGES VIA SOLUTION OF THE INVERSE PROBLEM OF CHEMICAL REACTIONS DISCRETE CHAOTIC DYNAMICS ⋮ Solving the density classification problem with a large diffusion and small amplification cellular automaton ⋮ On the relationship between cellular automata and L-systems: The self-replication case ⋮ Application of genetic algorithms for automatic construction of finite-state automata in the problem of flibs ⋮ Parameter characterization of two-dimensional cellular automata rule space ⋮ Evolving cellular automata rules for multiple-step-ahead prediction of complex binary sequences ⋮ A numerical investigation of adaptation in populations of random Boolean networks ⋮ Toward a viable, self-reproducing universal computer ⋮ Efficient system-wide coordination in noisy environments ⋮ Computation in artificially evolved, non-uniform cellular automata ⋮ Optimizing epochal evolutionary search: population-size independent theory. ⋮ Co-evolving architectures for cellular machines ⋮ Information modification and particle collisions in distributed computation ⋮ Deducing local rules for solving global tasks with random Boolean networks ⋮ Morphology of patterns of lattice swarms: interval parameterization. ⋮ Partial information decomposition as a spatiotemporal filter ⋮ Analysis of quantum particle automata for solving the density classification problem
Uses Software
Cites Work
- A hierarchical classification of cellular automata
- Transition phenomena in cellular automata rule space
- Some reversible image operators from the point of view of cellular automata
- Recombination dynamics and the fitness landscape
- The Gacs-Kurdyumov-Levin automaton revisited
- The attractor-basin portrait of a cellular automaton
- Turbulent pattern bases for cellular automata
- Symbolic dynamics of one-dimensional maps: Entropies, finite precision, and noise
- Auctions with artificial adaptive agents
- Real-time language recognition by one-dimensional cellular automata
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- A Genetic Algorithm for the Multiple-Choice Integer Program
- Cellular automata
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Evolving cellular automata to perform computations: Mechanisms and impediments