Abstract
This paper reviews the history of embedded, evolvable self-replicating structures implemented as cellular automata systems. We relate recent advances in this field to the concept of the evolutionary growth of complexity, a term introduced by McMullin to describe the central idea contained in von Neumann's self-reproducing automata theory. We show that conditions for such growth are in principle satisfied by universal constructors, yet that in practice much simpler replicators may satisfy scaled-down - yet equally relevant - versions thereof. Examples of such evolvable self-replicators are described and discussed, and future challenges identified.
| Original language | English |
|---|---|
| Pages (from-to) | 161-171 |
| Number of pages | 11 |
| Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Volume | 3305 |
| Publication status | Published - 2004 |
| Externally published | Yes |
Fingerprint
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)
Cite this
Heredity, complexity, and surprise : embedded self-replication and evolution in CA. / Salzberg, Chris; Sayama, Hiroki.
In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 3305, 2004, p. 161-171.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Heredity, complexity, and surprise
T2 - embedded self-replication and evolution in CA
AU - Salzberg, Chris
AU - Sayama, Hiroki
PY - 2004
Y1 - 2004
N2 - This paper reviews the history of embedded, evolvable self-replicating structures implemented as cellular automata systems. We relate recent advances in this field to the concept of the evolutionary growth of complexity, a term introduced by McMullin to describe the central idea contained in von Neumann's self-reproducing automata theory. We show that conditions for such growth are in principle satisfied by universal constructors, yet that in practice much simpler replicators may satisfy scaled-down - yet equally relevant - versions thereof. Examples of such evolvable self-replicators are described and discussed, and future challenges identified.
AB - This paper reviews the history of embedded, evolvable self-replicating structures implemented as cellular automata systems. We relate recent advances in this field to the concept of the evolutionary growth of complexity, a term introduced by McMullin to describe the central idea contained in von Neumann's self-reproducing automata theory. We show that conditions for such growth are in principle satisfied by universal constructors, yet that in practice much simpler replicators may satisfy scaled-down - yet equally relevant - versions thereof. Examples of such evolvable self-replicators are described and discussed, and future challenges identified.
UR - http://www.scopus.com/inward/record.url?scp=33847261635&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33847261635&partnerID=8YFLogxK
M3 - Article
VL - 3305
SP - 161
EP - 171
JO - Lecture Notes in Computer Science
JF - Lecture Notes in Computer Science
SN - 0302-9743
ER -