Advertisement

Complexity of Maxmin-\(\omega \) Cellular Automata

  • Ebrahim L. Patel
Conference paper
Part of the Springer Proceedings in Complexity book series (SPCOM)

Abstract

We present an analysis of an additive cellular automaton (CA) under asynchronous dynamics. The asynchronous scheme employed is maxmin-\(\omega \), a deterministic system, introduced in previous work with a binary alphabet. Extending this work, we study the impact of a varying alphabet size, i.e., more than the binary states often employed. Far from being a simple positive correlation between complexity and alphabet size, we show that there is an optimal region of \(\omega \) and alphabet size where complexity of CA is maximal. Thus, despite employing a fixed additive CA rule, the complexity of this CA can be controlled by \(\omega \) and alphabet size. The flavour of maxmin-\(\omega \) is, therefore, best captured by a CA with a large number of states.

References

  1. 1.
    Fatès, N.A., Morvan, M.: An experimental study of robustness to asynchronism for elementary cellular automata. Complex Syst. 16, 1–27 (2005)MathSciNetzbMATHGoogle Scholar
  2. 2.
    Granovetter, M.: Threshold models of collective behavior. Am. J. Sociol. 83(6), 1420–1443 (1978)CrossRefGoogle Scholar
  3. 3.
    Gutowitz, H., Langton, C.: Mean field theory of the edge of chaos. In: European Conference on Artificial Life, pp. 52–64. Springer, Heidelberg (1995)Google Scholar
  4. 4.
    Heidergott, B., Olsder, G.J., Van der Woude, J.: Max Plus at Work: Modeling and Analysis of Synchronized Systems: A Course on Max-Plus Algebra and Its Applications. Princeton University Press, Princeton (2006)zbMATHGoogle Scholar
  5. 5.
    Lopez-Ruiz, R., Mancini, H.L., Calbet, X.: A statistical measure of complexity. Phys. Lett. A 209(5–6), 321–326 (1995)CrossRefADSGoogle Scholar
  6. 6.
    Marr, C., Hütt, M.T.: Topology regulates pattern formation capacity of binary cellular automata on graphs. Phys. A Stat. Mech. Appl. 354, 641–662 (2005)CrossRefGoogle Scholar
  7. 7.
    McCulloch, W.S., Pitts, W.: A logical calculus of the ideas immanent in nervous activity. Bull. Math. Biophys. 5(4), 115–133 (1943)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Patel, E.L.: Maxmin-plus models of asynchronous computation. Ph.D. thesis, University of Manchester (2012)Google Scholar
  9. 9.
    Patel, E.L.: Maxmin-\(\omega \): a simple deterministic asynchronous cellular automaton scheme. In: International Conference on Cellular Automata, pp. 192–198. Springer, Cham (2016)Google Scholar
  10. 10.
    Rényi, A.: On measures of entropy and information. Technical report, Hungarian Academy of Sciences, Budapest (1961)Google Scholar
  11. 11.
    Schönfisch, B., de Roos, A.: Synchronous and asynchronous updating in cellular automata. BioSystems 51(3), 123–143 (1999)CrossRefGoogle Scholar
  12. 12.
    Watts, D.J.: A simple model of global cascades on random networks. Proc. Natl. Acad. Sci. 99(9), 5766–5771 (2002)MathSciNetCrossRefADSGoogle Scholar
  13. 13.
    Wolfram, S.: Statistical mechanics of cellular automata. Rev. Mod. Phys. 55, 601–644 (1983)MathSciNetCrossRefADSGoogle Scholar
  14. 14.
    Wolfram, S.: Universality and complexity in cellular automata. Phys. D Nonlinear Phenom. 10(1–2), 1–35 (1984)MathSciNetCrossRefADSGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.Mathematical Institute, University of OxfordOxfordUK

Personalised recommendations