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

The density classification problem consists in using a binary cellular automaton (CA) to decide whether an initial configuration contains more 0s or 1s. This problem is known for having no exact solution in the case of binary, deterministic, one-dimensional CA. Stochastic cellular automata have been studied as an alternative for solving the problem. This paper is aimed at presenting techniques to analyse the behaviour of stochastic CA rules, seen as a ``blend'' of deterministic CA rules. Using analytical calculations and numerical simulations, we analyse two previously studied rules and present a new rule. We estimate their quality of classification and their average time of classification. We show that the new rule solves the problem with an arbitrary precision. From a practical point of view, this rule is effective and exhibits a high quality of classification, even when the simulation time is kept small.

[1]  Norman H. Packard,et al.  Dynamic Patterns in Complex Systems , 1988 .

[2]  Nino Boccara,et al.  Number-conserving cellular automaton rules , 1999, Fundam. Informaticae.

[3]  Christopher Stone,et al.  Evolution of cellular automata with memory: The Density Classification Task , 2009, Biosyst..

[4]  Gina Maira Barbosa de Oliveira,et al.  The best currently known class of dynamically equivalent cellular automata rules for density classification , 2006, Neurocomputing.

[5]  H. Fuks Solution of the density classification problem with two cellular automata rules , 1997, comp-gas/9703001.

[6]  Land,et al.  No perfect two-state cellular automata for density classification exists. , 1995, Physical review letters.

[7]  Paula Gonzaga Sá,et al.  The Gacs-Kurdyumov-Levin automaton revisited , 1992 .

[8]  Capcarrere,et al.  Two-state, r=1 Cellular Automaton that Classifies Density. , 1996, Physical review letters.

[9]  Gina Maira Barbosa de Oliveira,et al.  Some Investigations About Synchronization and Density Classification Tasks in One-dimensional and Two-dimensional Cellular Automata Rule Spaces , 2009, Electron. Notes Theor. Comput. Sci..

[10]  Nazim Fatès,et al.  Fully asynchronous behavior of double-quiescent elementary cellular automata , 2006, Theor. Comput. Sci..

[11]  H. Fuks Nondeterministic density classification with diffusive probabilistic cellular automata. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  Larry Bull,et al.  A very effective density classifier two-dimensional cellular automaton with memory , 2009 .

[13]  Melanie Mitchell,et al.  Evolving cellular automata to perform computations: mechanisms and impediments , 1994 .

[14]  Pedro P. B. de Oliveira,et al.  Evolving Sequential Combinations of Elementary Cellular Automata Rules , 2005, ECAL.

[15]  Ruedi Stoop,et al.  Computing with Probabilistic Cellular Automata , 2009, ICANN.