The best currently known class of dynamically equivalent cellular automata rules for density classification


The possibility of performing computations with cellular automata (CAs) opens up new conceptual issues in emergent computation. Driven by this motivation, a recurring problem in this context is the automatic search for good one-dimensional, binary CA rules that can perform well in the density classification task (DCT), that is, the ability to discover which… (More)
DOI: 10.1016/j.neucom.2006.07.003

8 Figures and Tables


  • Presentations referencing similar topics