Stochastic Cellular Automata Solve the Density Classification Problem with an Arbitrary Precision

DOI10.4230/LIPIcs.STACS.2011.284zbMath1230.68150OpenAlexW2132012412MaRDI QIDQ3113693

Nazim Fatès

Publication date: 23 January 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_31ed.html

zbMATH Keywords

stochastic processdensity classification problemmodels of spatially distributed computingstochastic and probabilistic cellular automata

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (5)

Solving the parity problem in one-dimensional cellular automata ⋮ Lost in Self-Stabilization ⋮ Maximum sensitivity to update schedules of elementary cellular automata over periodic configurations ⋮ Solving the density classification problem with a large diffusion and small amplification cellular automaton ⋮ Probabilistic Cellular Automata, Invariant Measures, and Perfect Sampling

This page was built for publication: Stochastic Cellular Automata Solve the Density Classification Problem with an Arbitrary Precision