Evolvable Cellular Machines.

Moshe Sipper; Marco Tomassini

doi:10.1007/978-1-4471-0941-9_18

Evolvable Cellular Machines.

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

Abstract

A major impediment preventing ubiquitous computing with cellular automata (CA) stems from the difficulty of utilizing their complex behavior to perform useful computations. In this paper non-uniform CAs are studied, presenting the cellular programming algorithm for co-evolving such CAs to perform computations. The algorithm’s efficacy is demonstrated on two non-trivial computational tasks, namely synchronization and random number generation; furthermore, we present initial results demonstrating the robustness of our evolved systems. We believe that cellular programming holds potential for attaining ‘evolving ware’, evolware, which can be implemented in software, hardware, or other possible forms, such as bioware.

Original language	English
Title of host publication	Proceedings of the Second Conference on Cellular Automata for Research and Industry, Milan, Italy, 16–18 October 1996
Publisher	Springer London
Pages	177-186
Number of pages	10
ISBN (Electronic)	978-1-4471-0941-9
ISBN (Print)	978-3-540-76091-7
DOIs	https://doi.org/10.1007/978-1-4471-0941-9_18
State	Published - 1996
Externally published	Yes

Keywords

Genetic Algorithm
Cellular Automaton
Ubiquitous Computing
Artificial life

Access to Document

10.1007/978-1-4471-0941-9_18

https://dblp.org/db/conf/acri/acri1996.html#SipperT96

Cite this

@inproceedings{38f0681408cb45f9917bb41eb1e38052,

title = "Evolvable Cellular Machines.",

abstract = "A major impediment preventing ubiquitous computing with cellular automata (CA) stems from the difficulty of utilizing their complex behavior to perform useful computations. In this paper non-uniform CAs are studied, presenting the cellular programming algorithm for co-evolving such CAs to perform computations. The algorithm{\textquoteright}s efficacy is demonstrated on two non-trivial computational tasks, namely synchronization and random number generation; furthermore, we present initial results demonstrating the robustness of our evolved systems. We believe that cellular programming holds potential for attaining {\textquoteleft}evolving ware{\textquoteright}, evolware, which can be implemented in software, hardware, or other possible forms, such as bioware.",

keywords = "Genetic Algorithm, Cellular Automaton, Ubiquitous Computing, Artificial life",

author = "Moshe Sipper and Marco Tomassini",

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 = "1996",

doi = "10.1007/978-1-4471-0941-9_18",

language = "English",

isbn = "978-3-540-76091-7",

pages = "177--186",

booktitle = "Proceedings of the Second Conference on Cellular Automata for Research and Industry, Milan, Italy, 16–18 October 1996",

publisher = "Springer London",

address = "United Kingdom",

}

TY - GEN

T1 - Evolvable Cellular Machines.

AU - Sipper, Moshe

AU - Tomassini, Marco

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 - 1996

Y1 - 1996

N2 - A major impediment preventing ubiquitous computing with cellular automata (CA) stems from the difficulty of utilizing their complex behavior to perform useful computations. In this paper non-uniform CAs are studied, presenting the cellular programming algorithm for co-evolving such CAs to perform computations. The algorithm’s efficacy is demonstrated on two non-trivial computational tasks, namely synchronization and random number generation; furthermore, we present initial results demonstrating the robustness of our evolved systems. We believe that cellular programming holds potential for attaining ‘evolving ware’, evolware, which can be implemented in software, hardware, or other possible forms, such as bioware.

AB - A major impediment preventing ubiquitous computing with cellular automata (CA) stems from the difficulty of utilizing their complex behavior to perform useful computations. In this paper non-uniform CAs are studied, presenting the cellular programming algorithm for co-evolving such CAs to perform computations. The algorithm’s efficacy is demonstrated on two non-trivial computational tasks, namely synchronization and random number generation; furthermore, we present initial results demonstrating the robustness of our evolved systems. We believe that cellular programming holds potential for attaining ‘evolving ware’, evolware, which can be implemented in software, hardware, or other possible forms, such as bioware.

KW - Genetic Algorithm

KW - Cellular Automaton

KW - Ubiquitous Computing

KW - Artificial life

U2 - 10.1007/978-1-4471-0941-9_18

DO - 10.1007/978-1-4471-0941-9_18

M3 - Conference contribution

SN - 978-3-540-76091-7

SP - 177

EP - 186

BT - Proceedings of the Second Conference on Cellular Automata for Research and Industry, Milan, Italy, 16–18 October 1996

PB - Springer London

ER -

Evolvable Cellular Machines.

Abstract

Keywords

Access to Document

Fingerprint

Cite this