Keele Research Repository
Explore the Repository
Channon, AD (2019) Maximum Individual Complexity is Indefinitely Scalable in Geb. Artificial Life, 25 (2). pp. 134-144. ISSN 1530-9185
This is the latest version of this item.
channon-ArtificialLifeJournal2019a-authorsFinalVersion2.pdf - Accepted Version
Available under License Creative Commons Attribution Non-commercial.
Download (559kB) | Preview
Abstract
Geb was the first artificial life system to be classified as exhibiting open-ended evolutionary dynamics according to Bedau and Packard’s evolutionary activity measures and is the only one to have been classified as such according to the enhanced version of that classification scheme. Its evolution is driven by biotic selection, that is (approximately) by natural selection rather than artificial selection. Whether or not Geb can generate an indefinite increase in maximum individual complexity is evaluated here by scaling two parameters: world length (which bounds population size) and the maximum number of neurons per individual. Maximum individual complexity is found to be asymptotically bounded when scaling either parameter alone. However, maximum individual complexity is found to be indefinitely scalable, to the extent evaluated so far (with runtimes in years and billions of reproductions per run), when scaling both world length and the maximum number of neurons per individual, together. Further, maximum individual complexity is shown to scale logarithmically with (the lower of) maximum population size and maximum number of neurons per individual. This raises interesting questions and lines of thought about the feasibility of achieving complex results within open-ended evolutionary systems and how to improve on this order of complexity growth.
Item Type: | Article |
---|---|
Additional Information: | This is the accepted author manuscript (AAM). The final published version (version of record) will be available online via MIT Press at https://doi.org/10.1162/artl_a_00285 - please refer to any applicable terms of use of the publisher. |
Uncontrolled Keywords: | open-ended evolution, biotic selection, ongoing growth of complexity, diversity, indefinite scalability |
Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
Divisions: | Faculty of Natural Sciences > School of Computing and Mathematics |
Depositing User: | Symplectic |
Date Deposited: | 04 Apr 2019 07:23 |
Last Modified: | 16 Jul 2019 13:48 |
URI: | https://eprints.keele.ac.uk/id/eprint/6158 |
Available Versions of this Item
-
Maximum Individual Complexity is Indefinitely Scalable in Geb. (deposited 20 Feb 2019 14:01)
- Maximum Individual Complexity is Indefinitely Scalable in Geb. (deposited 04 Apr 2019 07:23) [Currently Displayed]