Computation at the edge of chaos: phase transitions and emergent computation
CNLS '89 Proceedings of the ninth annual international conference of the Center for Nonlinear Studies on Self-organizing, Collective, and Cooperative Phenomena in Natural and Artificial Computing Networks on Emergent computation
Numerical recipes in C (2nd ed.): the art of scientific computing
Numerical recipes in C (2nd ed.): the art of scientific computing
Evolving cellular automata to perform computations: mechanisms and impediments
Proceedings of the NATO advanced research workshop and EGS topical workshop on Chaotic advection, tracer dynamics and turbulent dispersion
1/f fluctuation in the “Game of Life”
Physica D
Simple Computation-Universal Cellular Spaces
Journal of the ACM (JACM)
A new kind of science
Cellular Automata
Theory of Self-Reproducing Automata
Theory of Self-Reproducing Automata
1/f noise in elementary cellular automaton rule 110
UC'06 Proceedings of the 5th international conference on Unconventional Computation
| Hi-index | 0.00 |
It is speculated that there is a relationship between 1/f noise and computational universality in cellular automata. We use genetic algorithms to search for one-dimensional and two-state, five-neighbor cellular automata which have 1/f-type spectrum. A power spectrum is calculated from the evolution starting from a random initial configuration. The fitness is estimated from the power spectrum in consideration of the similarity to 1/f-type spectrum. The result shows that the rule with the highest average fitness has a propagating structure like other computationally universal cellular automata, although computational universality of the rule has not been proved yet.