Cellular automata and communication complexity
Christoph Durr, Ivan Rapaport, Guillaume Theyssier
TL;DR
This paper explores the connection between cellular automata and communication complexity, offering a new classification of cellular automata based on theoretical insights into how local rules influence global behavior.
Contribution
It introduces a novel approach using communication complexity theory to classify cellular automata, linking local interactions to global computational properties.
Findings
New classification scheme for cellular automata
Application of communication complexity to cellular automata analysis
Insights into how local rules determine global behavior
Abstract
The model of cellular automata is fascinating because very simple local rules can generate complex global behaviors. The relationship between local and global function is subject of many studies. We tackle this question by using results on communication complexity theory and, as a by-product, we provide (yet another) classification of cellular automata.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCellular Automata and Applications · semigroups and automata theory · DNA and Biological Computing