Heredity, complexity, and surprise

embedded self-replication and evolution in CA

Chris Salzberg, Hiroki Sayama

Research output: Contribution to journalArticle

2 Citations (Scopus)

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 languageEnglish
Pages (from-to)161-171
Number of pages11
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3305
Publication statusPublished - 2004
Externally publishedYes

Fingerprint

Self-replication
Self reproducing automata
Automata theory
Automata Theory
Cellular automata
Cellular Automata
Term
Review
History
Concepts

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

@article{3009f867621247edb80ad3cfbf6a764c,
title = "Heredity, complexity, and surprise: embedded self-replication and evolution in CA",
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.",
author = "Chris Salzberg and Hiroki Sayama",
year = "2004",
language = "English",
volume = "3305",
pages = "161--171",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

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 -