Simply modified GKL density classifiers that reach consensus faster
From MaRDI portal
Abstract: The two-state Gacs-Kurdyumov-Levin (GKL) cellular automaton has been a staple model in the study of complex systems due to its ability to classify binary arrays of symbols according to their initial density. We show that a class of modified GKL models over extended neighborhoods, but still involving only three cells at a time, achieves comparable density classification performance but in some cases reach consensus more than twice as fast. Our results suggest the time to consensus (relative to the length of the CA) as a complementary measure of density classification performance.
Recommendations
- Modified traffic cellular automaton for the density classification task
- A very effective density classifier two-dimensional cellular automaton with memory
- Restricted density classification in one dimension
- An exact solution to the two-dimensional arbitrary-threshold density classification problem
- Solving two-dimensional density classification problem with two probabilistic cellular automata
Cites work
- scientific article; zbMATH DE number 711298 (Why is no real title available?)
- Around probabilistic cellular automata
- Density classification on infinite lattices and trees
- Ergodicity of some classes of cellular automata subject to noise
- On density determination with cellular automata: results, constructions and directions
- Overview: PCA models and issues
- Stable multi-level monotonic eroders
- Stochastic cellular automata solutions to the density classification problem. When randomness helps computing
- The Gacs-Kurdyumov-Levin automaton revisited
- The evolution of emergent computation.
This page was built for publication: Simply modified GKL density classifiers that reach consensus faster
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q820909)
