Cellular automata complexity threshold and classification: a geometric perspective
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1462667
- scientific article; zbMATH DE number 17562
- A full computation-relevant topological dynamics classification of elementary cellular automata
- Computational complexity of dynamical systems: the case of cellular automata
- Evolution complexity of the elementary cellular automaton rule 18
Cited in
(5)- Complexity index of outer-totalistic binary cellular automata with arbitrary dimension and neighborhood
- scientific article; zbMATH DE number 1462667 (Why is no real title available?)
- Bulking II: Classifications of cellular automata
- Classifying 1D elementary cellular automata with the 0-1 test for chaos
- Representation of geometrical and topological quantities in cellular automata
This page was built for publication: Cellular automata complexity threshold and classification: a geometric perspective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2965903)
