Skip to main content

Evolution of Asynchronous Cellular Automata

Capcarrere, Mathieu S. (2002) Evolution of Asynchronous Cellular Automata. In: Merelo, Juan Julian, ed. Parallel Problem Solving from Nature. Lecture Notes in Computer Science , 1. pp. 903-912. Springer-Verlag, Berlin ISBN 3-540-44139-5. (doi:10.1007/3-540-45712-7_87) (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) (KAR id:13731)

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. (Contact us about this Publication)
Official URL
http://dx.doi.org/10.1007/3-540-45712-7_87

Abstract

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)
DOI/Identification number: 10.1007/3-540-45712-7_87
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Mark Wheadon
Date Deposited: 24 Nov 2008 17:59 UTC
Last Modified: 16 Feb 2021 12:24 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/13731 (The current URI for this page, for reference purposes)
  • Depositors only (login required):