作者: Nazim Fatès
DOI: 10.1007/S00224-012-9386-3
关键词:
摘要: In the density classification problem, a binary cellular automaton should decide whether an initial configuration contains more 0s or 1s. The answer is given when all cells of CA agree on state (0 1). This problem known for having no exact solution in case deterministic one-dimensional CA. We investigate how randomness may help us solve problem. analyse behaviour stochastic rules that perform task. show describing as ''blend'' allows to derive quantitative results time and previously studied rules. introduce new rule whose effect spread defects wash them out. solves with arbitrary precision, is, its quality can be made arbitrarily high, though at price longer converge. experimentally demonstrate this exhibits good scaling properties it attains qualities never reached so far.