The evolution of emergent computation.
From MaRDI portal
Cited in
(20)- Quantum automata and quantum grammars
- Optimizing epochal evolutionary search: population-size independent theory.
- Morphology of patterns of lattice swarms: interval parameterization.
- Morphogenesis by coupled regulatory networks: reliable control of positional information and proportion regulation
- Critical market crashes
- Prediction and dissipation in nonequilibrium molecular sensors: conditionally Markovian channels driven by memoryful environments
- Co-evolving architectures for cellular machines
- Obtaining functional form for chaotic time series evolution using genetic algorithm
- Adaptive recommendation and open-ended semiosis
- Topological evolution for embodied cellular automata
- A SIMPLE CA MODEL FOR SIGNAL TRANSDUCTION IN PLANTS
- Partial information decomposition as a spatiotemporal filter
- Efficient system-wide coordination in noisy environments
- A MODEL OF GRAPH COLORING DYNAMICS WITH ATTENTION WAVES AND STRATEGIC WAITING
- Upper bound on the products of particle interactions in cellular automata
- Outer-totalistic cellular automata on graphs
- Simply modified GKL density classifiers that reach consensus faster
- Evolving cellular automata rules for multiple-step-ahead prediction of complex binary sequences
- Chance and necessity in evolution: lessons from RNA
- Computational mechanics of cellular automata: an example
This page was built for publication: The evolution of emergent computation.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4865421)
