arXiv · 2605.22762
Minimality, transitivity and sensitivity of non-uniform cellular automata
Abstract
Every transitive cellular automaton (CA) is sensitive to initial conditions. We study this implication in the more general context of non-uniform cellular automata (NUCA) with finitely many different local update rules assigned to cells. We construct a two-dimensional NUCA that is minimal -- and hence transitive -- but that is not sensitive to initial conditions. The construction is based on an odometer NUCA on $\{0,1,2\}^\mathbb{N}$ which is nearly uniform in the sense that only the first cell uses a different local rule. Then we show that if the assignment of local rules in the cells is recurrent then transitivity implies sensitivity.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Supreeti Kamilya, Jarkko Kari, Katariina Paturi. 2026-05-21. Minimality, transitivity and sensitivity of non-uniform cellular automata. https://arxiv.org/abs/2605.22762
Cite the original work for its findings. Save a collection to share your selection of sources.