Evolution of Asynchronous Cellular Automata

Capcarrere, Mathieu S. (2002) Evolution of Asynchronous Cellular Automata. In: The seventh Conference on Parallel Problem Solving From Nature, PPSN 2002, September 7-11, 2002, Granada, Spain. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

The full text of this publication is not available from this repository. (Contact us about this Publication)
Official URL


One of the prominent features of the Cellular Automata (CA) model is its synchronous mode of operation, meaning that all cells are updated simultaneously. but this feature is far from being realistic from a biological point of view as well as from a computational point of view. Past research has mainly concentrated on studying Asynchronous CAs in themselves, trying to determine what behaviours were an "artifact" of the global clock. In this paper, I propose to evolve Asynchronous CAs that compute successfully one of the well-studied task for regular CSs: The synchronisation task. As I will show evolved solutions are both unexpected and best for uncertain criteria.

Item Type: Conference or workshop item (Paper)
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Applied and Interdisciplinary Informatics Group
Depositing User: Mark Wheadon
Date Deposited: 24 Nov 2008 17:59
Last Modified: 06 May 2014 09:29
Resource URI: https://kar.kent.ac.uk/id/eprint/13731 (The current URI for this page, for reference purposes)
  • Depositors only (login required):