Abstract
The density classification problem has long been recognized as a benchmark for exploring cellular automata rules with global properties. One of the major difficulties in evaluating rules is the enormous number of configurations which have to be tested, particularly important in any search process. We consider an approach to rule evaluation, which is in some ways the reverse of the standard methods, and discuss problems and opportunities raised by the approach.
Cite
CITATION STYLE
Bossomaier, T., Sibley-Punnett, L., & Cranny, T. (2000). Basins of attraction and the density classification problem for cellular automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1834, pp. 245–255). Springer Verlag. https://doi.org/10.1007/3-540-45016-5_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
