1/f Noise in Elementary Cellular Automaton Rule 110
- Cite this paper as:
- Ninagawa S. (2006) 1/f Noise in Elementary Cellular Automaton Rule 110. In: Calude C.S., Dinneen M.J., Păun G., Rozenberg G., Stepney S. (eds) Unconventional Computation. UC 2006. Lecture Notes in Computer Science, vol 4135. Springer, Berlin, Heidelberg
Cellular Automata are considered to be discrete dynamical systems as well as computing systems. Spectral analysis has been employed to investigate the behavior of dynamical systems. We calculated the power spectra from the evolutions starting from a random initial configuration to analyze the temporal behavior in elementary cellular automata. As a result, rule 110 has 1/f spectrum for the longest time steps. Rule 110 alone has proved to be capable of supporting universal computation in elementary cellular automata. These results suggest that there is a relationship between computational universality and 1/f noise in cellular automata.
Unable to display preview. Download preview PDF.