1/f Noise in Elementary Cellular Automaton Rule 110
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.
- 3.Martínez, G.J., McIntosh, H.V., Mora, J.C.S.T.: Gliders in Rule 110. Int. Journ. of Unconventional Computing 2, 1–49 (2005)Google Scholar
- 8.Press, W.H., Teukolsky, S.A., Vetterling, W.T., Flannery, B.P.: Numerical Recipes in C++, ch. 13, 2nd edn. Cambridge University Press, Cambridge (2002)Google Scholar
- 10.Wolfram, S.: A New Kind of Science. Wolfram Media (2002)Google Scholar