Evolving robust asynchronous cellular automata for the density task

MaRDI QIDQ5321480zbMATH OpenFDO

Authors Marco Tomassini, Mattias Venzi

Publication date 22 July 2009

Mathematics Subject Classification ID

Dynamical aspects of cellular automata (37B15) Cellular automata (computational aspects) (68Q80)

Recommendations

• scientific article; zbMATH DE number 2016492
• An experimental study of robustness to asynchronism for elementary cellular automata
• Randomized Computation with Cellular Automata
• Asynchronous cellular automata and dynamical properties
• What do we mean by asynchronous CA? A reflection on types and effects of asynchronicity

Cited in

(7)

• Deducing local rules for solving global tasks with random Boolean networks
• A study on learning robustness using asynchronous 1D cellular automata rules
• scientific article; zbMATH DE number 2013547 (Why is no real title available?)
• scientific article; zbMATH DE number 2016492 (Why is no real title available?)
• PERFORMANCE AND ROBUSTNESS OF CELLULAR AUTOMATA COMPUTATION ON IRREGULAR NETWORKS
• Randomized Computation with Cellular Automata
• A comprehensive taxonomy of cellular automata

This page was built for publication: Evolving robust asynchronous cellular automata for the density task

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5321480)