Unraveling simplicity in elementary cellular automata
classification
💻 cs.CC
cs.DMcs.FLnlin.CG
keywords
automatacellularelementarycomplexitynetworksapplicationclassificationcommunication
read the original abstract
We show that a large number of elementary cellular automata are computationally simple. This work is the first systematic classification of elementary cellular automata based on a formal notion of computational complexity. Thanks to the generality of communication complexity, the perspectives of our method include its application to other natural systems such as neural networks and gene regulatory networks.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.