Abstract
The evolution of asynchronous automata for the density task is presented and compared with the evolution of synchronous automata. We describe the influence of various asynchronous update policies on the computational strategy. We also investigate how synchronous and asynchronous cellular automata behave when the update policy is gradually changed, showing that asynchronous cellular automata are more robust.
Cite
CITATION STYLE
Tomassini, M., & Venzi, M. (2002). Evolution of asynchronous cellular automata for the density task. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2439, pp. 934–943). Springer Verlag. https://doi.org/10.1007/3-540-45712-7_90
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
