Document Open Access Logo

Universality Frontier for Asynchronous Cellular Automata

Authors Ivan Baburin , Matthew Cook, Florian Grötschla, Andreas Plesner , Roger Wattenhofer

PDF HTML 5

Files

Thumbnail PDF
PDF
LIPIcs.MFCS.2025.11.pdf
  • Filesize: 1.39 MB
  • 18 pages
HTML5 Logo HTML (experimental)
LIPIcs.MFCS.2025.11.html

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Models of computation
Keywords
  • Universality
  • Asynchronous Cellular Automata
  • Automata Networks

Metrics

Abstract

In this work, we investigate computational aspects of asynchronous cellular automata (ACAs), a modification of cellular automata in which cells update independently, following an asynchronous update schedule. We introduce flip automata networks (FANs), a simple modification of automata networks that remain robust under any asynchronous updating order. By using FANs as a middleman, we show that asynchronous automata can efficiently simulate their synchronous counterparts with a linear memory overhead, which improves upon the previously established quadratic bound. Additionally, we address the universality gap for (a)synchronous cellular automata-the boundary separating universal and non-universal automata, which is still not fully understood. We tighten this boundary by proving that all one-way asynchronous automata lack universal computational power. Conversely, we establish the existence of a universal asynchronous 6-state first-neighbor automaton in one dimension and a 3-state von Neumann automaton in two dimensions, which represent the smallest known universal constructions to date.

Cite As Get BibTex

Ivan Baburin, Matthew Cook, Florian Grötschla, Andreas Plesner, and Roger Wattenhofer. Universality Frontier for Asynchronous Cellular Automata. In 50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 345, pp. 11:1-11:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.MFCS.2025.11

Author Details

Ivan Baburin
  • Department of Computer Science, ETH Zürich, Switzerland
Matthew Cook
  • Faculty of Science and Engineering, University of Groningen, The Netherlands
Florian Grötschla
  • Department of Electrical Engineering, ETH Zürich, Switzerland
Andreas Plesner
  • Department of Electrical Engineering, ETH Zürich, Switzerland
Roger Wattenhofer
  • Department of Electrical Engineering, ETH Zürich, Switzerland

References

  1. Susumu Adachi, Jia Lee, and Ferdinand Peper. Universal 2-state asynchronous cellular automaton with inner-independent transitions. Natural Computing, pages 107-116, 2010. URL: https://doi.org/10.1007/978-4-431-53868-4_12.
  2. Ivan Baburin, Matthew Cook, Florian Grötschla, Andreas Plesner, and Roger Wattenhofer. Universality frontier for asynchronous cellular automata, 2025. URL: https://doi.org/10.48550/arXiv.2502.05989.
  3. Edwin Roger Banks. Universality in cellular automata. 11th Annual Symposium on Switching and Automata Theory (swat 1970), pages 194-215, 1970. URL: https://doi.org/10.1109/SWAT.1970.27.
  4. Matthew Cook. Universality in elementary cellular automata. Complex Systems, 15(1), 2004. URL: http://www.complex-systems.com/abstracts/v15_i01_a01.html.
  5. Matthew Cook, David Soloveichik, Erik Winfree, and Jehoshua Bruck. Programmability of Chemical Reaction Networks, pages 543-584. Springer Berlin Heidelberg, Berlin, Heidelberg, 2009. URL: https://doi.org/10.1007/978-3-540-88869-7_27.
  6. Bruno Durand and Zsuzsanna Róka. The game of life: Universality revisited. Cellular Automata, pages 51-74, 1999. URL: https://doi.org/10.1007/978-94-015-9153-9_2.
  7. Nazim Fatès. A guided tour of asynchronous cellular automata. Cellular Automata and Discrete Complex Systems, pages 15-30, 2013. URL: https://doi.org/10.1007/978-3-642-40867-0_2.
  8. Li-Juan Fei, Jia Lee, Xin Huang, and Ferdinand Peper. Effect of random fluctuations on minimizing the complexity of universal asynchronous cellular automata. Physica D: Nonlinear Phenomena, 428:133052, 2021. URL: https://doi.org/10.1016/j.physd.2021.133052.
  9. Ehud Fonio, Yael Heyman, Lucas Boczkowski, Aviram Gelblum, Adrian Kosowski, Amos Korman, and Ofer Feinerman. A locally-blazed ant trail achieves efficient collective navigation despite limited information. eLife, 5:e20185, November 2016. URL: https://doi.org/10.7554/eLife.20185.
  10. Edward Fredkin and Tommaso Toffoli. Conservative logic. Collision-based Computing, pages 47-81, 2002. URL: https://doi.org/10.1007/978-1-4471-0129-1_3.
  11. Anahí Gajardo and Eric Goles. Circuit Universality of Two Dimensional Cellular Automata: A Review, pages 131-151. World Scientific, 2007. URL: https://doi.org/10.1142/9789812770837_0007.
  12. Martin Gardner. Mathematical games. Scientific American, 223(4):120-123, October 1970. URL: https://doi.org/10.1038/scientificamerican1070-120.
  13. Aviram Gelblum, Ehud Fonio, Yoav Rodeh, Amos Korman, and Ofer Feinerman. Ant collective cognition allows for efficient navigation through disordered environments. eLife, 9:e55195, May 2020. URL: https://doi.org/10.7554/eLife.55195.
  14. Leslie M. Goldschlager. The monotone and planar circuit value problems are log space complete for p. Acm Sigact News, 9(2):25-29, 1977. URL: https://doi.org/10.1145/1008354.1008356.
  15. Eric Goles and Servet Martínez. Automata networks. Neural and Automata Networks, pages 15-37, 1990. URL: https://doi.org/10.1007/978-94-009-0529-0_2.
  16. Ulrich Golze. (a-)synchronous (non-)deterministic cell spaces simulating each other. Journal of Computer and System Sciences, 17(2):176-193, 1978. URL: https://doi.org/10.1016/0022-0000(78)90003-X.
  17. David Griffeath and Cristopher Moore. Life without death is p-complete. Complex Systems, 10(6), 1996. URL: http://www.complex-systems.com/abstracts/v10_i06_a03.html.
  18. Peter Gács. Deterministic computations whose history is independent of the order of asynchronous updating, 2001. URL: https://arxiv.org/abs/cs/0101026.
  19. Jia Lee, Susumu Adachi, Ferdinand Peper, and Shinro Mashiko. Delay-insensitive computation in asynchronous cellular automata. Journal of Computer and System Sciences, 70(2):201-220, 2005. URL: https://doi.org/10.1016/j.jcss.2004.10.009.
  20. Jia Lee, Susumu Adachi, Ferdinand Peper, and Kenichi Morita. Embedding universal delay-insensitive circuits in asynchronous cellular spaces. Fundam. Informaticae, 58(2003):295-320, 2003. URL: http://content.iospress.com/articles/fundamenta-informaticae/fi58-3-4-07.
  21. Jia Lee, Susumu Adachi, Ferdinand Peper, and Kenichi Morita. Asynchronous game of life. Physica D: Nonlinear Phenomena, 194(3):369-384, 2004. URL: https://doi.org/10.1016/j.physd.2004.03.007.
  22. Jia Lee, F. Peper, S. Adachi, and S. Mashiko. Universal delay-insensitive systems with buffering lines. Ieee Transactions on Circuits and Systems I: Regular Papers, 52(4):742-754, 2005. URL: https://doi.org/10.1109/TCSI.2005.844229.
  23. Kristian Lindgren and Mats G. Nordahl. Universal computation in simple one-dimensional cellular automata. Complex Syst., 4(3), 1990. URL: http://www.complex-systems.com/abstracts/v04_i03_a04.html.
  24. Kenichi Morita. Theory of Reversible Computing. Monographs in Theoretical Computer Science. An EATCS Series. Springer, 2017. URL: https://doi.org/10.1007/978-4-431-56606-9.
  25. Katsuo Nakamura. Asynchronous cellular automata and their computational ability. Systems, computers, controls, 5(5):58-66, 1974. Google Scholar
  26. Turlough Neary and Damien Woods. The complexity of small universal turing machines: A survey. Sofsem 2012: Theory and Practice of Computer Science, pages 385-405, 2012. URL: https://doi.org/10.1007/978-3-642-27660-6_32.
  27. N. Ollinger and G. Richard. Four states are enough! Theoretical Computer Science, 412(1):22-32, 2011. Complexity of Simple Programs. URL: https://doi.org/10.1016/j.tcs.2010.08.018.
  28. Nicolas Ollinger. The intrinsic universality problem of one-dimensional cellular automata. Stacs 2003, pages 632-641, 2003. URL: https://doi.org/10.1007/3-540-36494-3_55.
  29. Nicolas Ollinger. Universalities in Cellular Automata*, pages 189-229. Springer Berlin Heidelberg, Berlin, Heidelberg, 2012. URL: https://doi.org/10.1007/978-3-540-92910-9_6.
  30. Emil L. Post. The Two-Valued Iterative Systems of Mathematical Logic. Princeton University Press, Princeton, 1942. URL: https://doi.org/10.1515/9781400882366.
  31. Gaétan Richard. Rule 110: universality and catenations. In Proceedings of the First Symposium on Cellular Automata "Journées Automates Cellulaires", Regular paper track, pages 141-160, Uzès, France, April 2008. ISBN 978-5-94057-377-7. URL: https://hal.science/hal-00273995.
  32. Oliver Schneider and Thomas Worsch. A 3-state asynchronous ca for the simulation of delay-insensitive circuits. Cellular Automata, pages 565-574, 2012. URL: https://doi.org/10.1007/978-3-642-33350-7_58.
  33. Jacob T. Schwartz, John von Neumann, and Arthur W. Burks. Theory of self-reproducing automata. Mathematics of Computation, 21(100):745, 1967. URL: https://doi.org/10.2307/2005041.
  34. Claude E. Shannon. A Universal Turing Machine with Two Internal States, pages 157-166. Princeton University Press, Princeton, 1956. URL: https://doi.org/10.1515/9781400882618-007.
  35. Andrew Trevorrow and Tom Rokicki. Golly (program). https://golly.sourceforge.io/. Accessed: 2024-11-14.
  36. A. M. Turing. On computable numbers, with an application to the entscheidungsproblem. Proceedings of the London Mathematical Society, s2-42(1):230-265, 1937. URL: https://doi.org/10.1112/plms/s2-42.1.230.
  37. Stephen Wolfram. A New Kind of Science. Wolfram Media, 2002. URL: https://www.wolframscience.com.
  38. Thomas Worsch. Towards intrinsically universal asynchronous ca. Natural Computing, 12(4):539-550, 2013. URL: https://doi.org/10.1007/s11047-013-9388-3.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact