Designing cellular automata using a parallel evolutionary algorithm

Moshe Sipper, Marco Tomassini, Mathieu S. Capcarrere

Research output: Contribution to journalArticlepeer-review

4 Scopus citations


We have previously shown that non-uniform Cellular Automata (CA) can be evolved to perform computational tasks, using the cellular programming evolutionary algorithm. In this paper we focus on two novel issues, namely the evolution of asynchronous CAs, and the fault tolerance of our evolved systems. We find that asynchrony presents a more difficult case for evolution though good CAs can still be attained. We show that our evolved systems exhibit graceful degradation in performance, able to tolerate a certain level of faults. Our motivation for this study stems in part by our desire to attain realistic systems that are more amenable to implementation as 'evolving ware', evolware.

Original languageEnglish
Pages (from-to)278-283
Number of pages6
JournalNuclear Instruments and Methods in Physics Research, Section A: Accelerators, Spectrometers, Detectors and Associated Equipment
Issue number1-2
StatePublished - 11 Apr 1997
Externally publishedYes


  • Asynchronous cellular automata
  • Cellular programming
  • Evolutionary computation
  • Evolware
  • Fault tolerance
  • Non-uniform cellular automata

ASJC Scopus subject areas

  • Nuclear and High Energy Physics
  • Instrumentation


Dive into the research topics of 'Designing cellular automata using a parallel evolutionary algorithm'. Together they form a unique fingerprint.

Cite this