Design of Evolvable Computer Languages

IEEE Transactions on Evolutionary Computation 6 (4):420–424 (2002)
  Copy   BIBTEX

Abstract

We investigate common design decisions for constructing a computational genetic language in an autoadaptive system. Such languages must support self-repl ication and are typically Turing-complete so as not to limit the types of computations they can perform. We examine the importance of using templates to denote locations in the genome, the methods by which those templates are located (direct-matching versus complement-matching), methods used in the calculation of genome length and the size and complexity of the language. For each test, we examine the effects on the rate of evolution of the populations and isolate those factors that contribute to it, most notably the organisms’ ability to withstand mutations.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,401

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2023-09-18

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references