Evolving Asynchronous and Scalable Non-uniform Cellular Automata

Moshe Sipper; Marco Tomassini; Mathieu S. Capcarrère

doi:10.1007/978-3-7091-6492-1_15

Evolving Asynchronous and Scalable Non-uniform Cellular Automata

Moshe Sipper, Marco Tomassini, Mathieu S. Capcarrère

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

We have previously shown that non-uniform cellular automata (CA) can be evolved to perform computational tasks, using the cellular programming algorithm. In this paper we focus on two novel issues, namely, the evolution of asynchronous CAs, and the scalability of evolved synchronous systems. We find that asynchrony presents a more difficult case for evolution though good CAs can still be attained. We describe an empirically derived scaling procedure by which successful CAs of any size may be obtained from a particular evolved system. Our motivation for this study stems in part from our desire to attain realistic systems that axe more amenable to implementation as “evolving ware,” evolware.

Original language	English
Title of host publication	Artificial Neural Nets and Genetic Algorithms
Subtitle of host publication	Proceedings of the International Conference in Norwich, U.K., 1997
Editors	George D. Smith, Nigel C. Steele, Rudolf F. Albrecht
Publisher	Springer
Pages	66-70
Number of pages	5
ISBN (Electronic)	978-3-7091-6492-1
DOIs	https://doi.org/10.1007/978-3-7091-6492-1_15
State	Published - 1998
Externally published	Yes

Keywords

Cellular Automaton
Grid Size
Computational Task
Logical Step

Access to Document

10.1007/978-3-7091-6492-1_15

Cite this

@inproceedings{ed612328fae84c9db3849f01562d25b4,

title = "Evolving Asynchronous and Scalable Non-uniform Cellular Automata",

abstract = "We have previously shown that non-uniform cellular automata (CA) can be evolved to perform computational tasks, using the cellular programming algorithm. In this paper we focus on two novel issues, namely, the evolution of asynchronous CAs, and the scalability of evolved synchronous systems. We find that asynchrony presents a more difficult case for evolution though good CAs can still be attained. We describe an empirically derived scaling procedure by which successful CAs of any size may be obtained from a particular evolved system. Our motivation for this study stems in part from our desire to attain realistic systems that axe more amenable to implementation as “evolving ware,” evolware.",

keywords = "Cellular Automaton, Grid Size, Computational Task, Logical Step",

author = "Moshe Sipper and Marco Tomassini and Capcarr{\`e}re, {Mathieu S.}",

note = "DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.",

year = "1998",

doi = "10.1007/978-3-7091-6492-1_15",

language = "English",

pages = "66--70",

editor = "Smith, {George D.} and Steele, {Nigel C.} and Albrecht, {Rudolf F. }",

booktitle = "Artificial Neural Nets and Genetic Algorithms",

publisher = "Springer",

address = "Germany",

}

Evolving Asynchronous and Scalable Non-uniform Cellular Automata. / Sipper, Moshe; Tomassini, Marco; Capcarrère, Mathieu S.
Artificial Neural Nets and Genetic Algorithms : Proceedings of the International Conference in Norwich, U.K., 1997. ed. / George D. Smith; Nigel C. Steele; Rudolf F. Albrecht. Springer, 1998. p. 66-70.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Evolving Asynchronous and Scalable Non-uniform Cellular Automata

AU - Sipper, Moshe

AU - Tomassini, Marco

AU - Capcarrère, Mathieu S.

N1 - DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.

PY - 1998

Y1 - 1998

N2 - We have previously shown that non-uniform cellular automata (CA) can be evolved to perform computational tasks, using the cellular programming algorithm. In this paper we focus on two novel issues, namely, the evolution of asynchronous CAs, and the scalability of evolved synchronous systems. We find that asynchrony presents a more difficult case for evolution though good CAs can still be attained. We describe an empirically derived scaling procedure by which successful CAs of any size may be obtained from a particular evolved system. Our motivation for this study stems in part from our desire to attain realistic systems that axe more amenable to implementation as “evolving ware,” evolware.

AB - We have previously shown that non-uniform cellular automata (CA) can be evolved to perform computational tasks, using the cellular programming algorithm. In this paper we focus on two novel issues, namely, the evolution of asynchronous CAs, and the scalability of evolved synchronous systems. We find that asynchrony presents a more difficult case for evolution though good CAs can still be attained. We describe an empirically derived scaling procedure by which successful CAs of any size may be obtained from a particular evolved system. Our motivation for this study stems in part from our desire to attain realistic systems that axe more amenable to implementation as “evolving ware,” evolware.

KW - Cellular Automaton

KW - Grid Size

KW - Computational Task

KW - Logical Step

U2 - 10.1007/978-3-7091-6492-1_15

DO - 10.1007/978-3-7091-6492-1_15

M3 - Conference contribution

SP - 66

EP - 70

BT - Artificial Neural Nets and Genetic Algorithms

A2 - Smith, George D.

A2 - Steele, Nigel C.

A2 - Albrecht, Rudolf F.

PB - Springer

ER -

Evolving Asynchronous and Scalable Non-uniform Cellular Automata

Abstract

Keywords

Access to Document

Fingerprint

Cite this