Open-ended artificial evolution
Created by W.Langdon from
gp-bibliography.bib Revision:1.8051
- @Article{Standish03a,
-
author = "Russell K. Standish",
-
title = "Open-ended artificial evolution",
-
journal = "International Journal of Computational Intelligence
and Applications",
-
year = "2003",
-
volume = "3",
-
number = "2",
-
pages = "167--175",
-
keywords = "genetic algorithms, genetic programming, Open-ended
evolution; complexity, Tierra, digital organisms,
neutral networks",
-
ISSN = "1469-0268",
-
URL = "http://arxiv.org/PS_cache/nlin/pdf/0210/0210027.pdf",
-
URL = "http://arxiv.org/abs/nlin/0210027",
-
DOI = "doi:10.1142/S1469026803000914",
-
size = "9 pages",
-
abstract = "Of all the issues discussed at Alife VII: Looking
Forward, Looking Backward, the issue of whether it was
possible to create an artificial life system that
exhibits open-ended evolution of novelty is by far the
biggest. Of the 14 open problems settled on as a result
of debate at the conference, some 6 are directly, or
indirectly related to this issue. Most people equate
open-ended evolution with complexity growth, although a
priori these seem to be different things. In this paper
I report on experiments to measure the complexity of
Tierran organisms, and show the results for a
size-neutral run of Tierra. In this run, no increase in
organismal complexity was observed, although organism
size did increase through the run. This result is
discussed, offering some signposts on path to solving
the issue of open ended evolution.",
-
notes = "IJCIA Copyright: Imperial College Press
arXiv:nlin.AO/0210027",
- }
Genetic Programming entries for
Russell K Standish
Citations