Stochastic cellular automata solutions to the density classification problem. When randomness helps computing
From MaRDI portal
Recommendations
- Stochastic Cellular Automata Solve the Density Classification Problem with an Arbitrary Precision
- Solving two-dimensional density classification problem with two probabilistic cellular automata
- Solving the density classification problem with a large diffusion and small amplification cellular automaton
- Restricted density classification in one dimension
- Deterministic computing techniques for perfect density classification
Cites work
- A very effective density classifier two-dimensional cellular automaton with memory
- Density classification on infinite lattices and trees
- Evolving cellular automata to perform computations: Mechanisms and impediments
- Fully asynchronous behavior of double-quiescent elementary cellular automata
- scientific article; zbMATH DE number 3610746 (Why is no real title available?)
- scientific article; zbMATH DE number 1886322 (Why is no real title available?)
- Some investigations about synchronization and density classification tasks in one-dimensional and two-dimensional cellular automata rule spaces
- The Gacs-Kurdyumov-Levin automaton revisited
Cited in
(29)- Lost in self-stabilization: a local process that aligns connected cells
- Autonomous population regulation using a multi-agent system in a prey-predator model that integrates cellular automata and the African buffalo optimization metaheuristic
- Self-organisation in cellular automata with coalescent particles: qualitative and quantitative approaches
- Solving the density classification problem with a large diffusion and small amplification cellular automaton
- On density determination with cellular automata: results, constructions and directions
- Solving two-dimensional density classification problem with two probabilistic cellular automata
- Density classification on infinite lattices and trees
- The HPP rule with memory and the density classification task
- Stochastic Cellular Automata Solve the Density Classification Problem with an Arbitrary Precision
- Two-dimensional traffic rules and the density classification problem
- An exact solution to the two-dimensional arbitrary-threshold density classification problem
- Overview: PCA models and issues
- The density classification problem in the context of continuous cellular automata
- Around probabilistic cellular automata
- Efficient Solutions of the Density Classification Task in One-Dimensional Cellular Automata: Where Can They Be Found?
- Computational mechanisms for solving the density classification task by cellular automata
- Temporally Stochastic Cellular Automata: Classes and Dynamics
- Density-conserving affine continuous cellular automata solving the relaxed density classification problem
- Deterministic computing techniques for perfect density classification
- Randomized Computation with Cellular Automata
- Restricted density classification in one dimension
- Affine continuous cellular automata solving the fixed-length density classification problem
- A survey of cellular automata: types, dynamics, non-uniformity and applications
- Remarks on the cellular automaton global synchronisation problem: deterministic versus stochastic models
- CLOUDS IN THE BASINS OF FULLY ASYNCHRONOUS CELLULAR AUTOMATA
- Asynchronous cellular systems that solve the parity problem
- A note on skew-asynchronous cellular automata
- Cellular automata and self-organisation phenomena
- Simply modified GKL density classifiers that reach consensus faster
This page was built for publication: Stochastic cellular automata solutions to the density classification problem. When randomness helps computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q372972)
