Evolvable Cellular Machines.

Moshe Sipper, Marco Tomassini

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 languageEnglish
Title of host publicationProceedings of the Second Conference on Cellular Automata for Research and Industry, Milan, Italy, 16–18 October 1996
PublisherSpringer London
Pages177-186
Number of pages10
ISBN (Electronic)978-1-4471-0941-9
ISBN (Print)978-3-540-76091-7
DOIs
StatePublished - 1996

Keywords

  • Genetic Algorithm
  • Cellular Automaton
  • Ubiquitous Computing
  • Artificial life

Fingerprint

Dive into the research topics of 'Evolvable Cellular Machines.'. Together they form a unique fingerprint.

Cite this