Time-evolution of the Rule 150 cellular automaton activity from a Fibonacci iteration
arXiv:math/0410429 · doi:10.1063/1.2939398
Abstract
The total activity of the single-seeded cellular rule 150 automaton does not follow a one-step iteration like other elementary cellular automata, but can be solved as a two-step vectorial, or string, iteration, which can be viewed as a generalization of Fibonacci iteration generating the time series from a sequence of vectors of increasing length. This allows to compute the total activity time series more efficiently than by simulating the whole spatio-temporal process, or even by using the closed expression.
4 pages (3 figs included)
References in corpus (10)
- Evolutionary games on graphs
- Topology of biological networks and reliability of information processing
- On computational irreducibility and the predictability of complex physical systems
- Similarity based cooperation and spatial segregation
- Segregation process and phase transition in cyclic predator-prey models with even number of species
- Topology regulates pattern formation capacity of binary cellular automata on graphs
- Evolution of Canalizing Boolean Networks
- spectra in elementary cellular automata and fractal signals
- Steady Stokes flow with long-range correlations, fractal Fourier spectrum, and anomalous transport
- Sierpinski signal generates spectra