Design of evolvable computer languages

Created by W.Langdon from gp-bibliography.bib Revision:1.8098

@Article{Ofria:2002:ieeeTEC,

• author = "Charles Ofria and Christoph Adami and Travis C. Collier",
• title = "Design of evolvable computer languages",
• journal = "IEEE Transactions on Evolutionary Computation",
• year = "2002",
• volume = "6",
• number = "4",
• pages = "420--424",
• month = aug,
• keywords = "genetic algorithms, genetic programming, artificial chemistry, Turing machines, computational complexity, high level languages, Turing-complete, autoadaptive system, complement matching, complexity, computational genetic language, evolvable computer languages, genome length, self replication, templates, Assembly, Bioinformatics, Computer languages, Evolution (biology), Genetic mutations, Genomics, Robustness, Testing",
• ISSN = "1089-778X",
• DOI = "doi:10.1109/TEVC.2002.802442",
• size = "5 pages",
• abstract = "We investigate common design decisions for constructing a computational genetic language in an autoadaptive system. Such languages must support self-replication 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",
• notes = "also known as \cite{1027753}",

}

Genetic Programming entries for Charles Ofria Christoph Adami Travis C Collier

Citations