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

Author Nazim Fates



PDF
Thumbnail PDF

File

LIPIcs.STACS.2011.284.pdf
  • Filesize: 0.66 MB
  • 12 pages

Document Identifiers

Author Details

Nazim Fates

Cite AsGet BibTex

Nazim Fates. Stochastic Cellular Automata Solve the Density Classification Problem with an Arbitrary Precision. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 284-295, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
https://doi.org/10.4230/LIPIcs.STACS.2011.284

Abstract

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.
Keywords
  • stochastic and probabilistic cellular automata
  • density classification problem
  • models of spatially distributed computing
  • stochastic process

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail