Avida is an artificial life software platform to study the evolutionary biology of self-replicating and evolving computer programs (digital organisms). Avida is under active development by Charles Ofria's Digital Evolution Lab at Michigan State University and was originally designed by Ofria, Chris Adami and C. Titus Brown at Caltech in 1993. The software was inspired by the Tierra system.
|
Contents
|
Tierra simulated an evolutionary system by introducing computer programs that competed for computer resources, specifically processor (CPU) time and access to main memory. In this respect it is similar to core wars, but differs in that the programs being run in the simulation are able to modify themselves, and thereby evolve. Tierra's programs are artificial life organisms.[citation needed]
Unlike in Tierra, Avida assigns every digital organism its own protected region of memory, and executes its with a separate virtual CPU. By default, other digital organisms cannot access this memory space, neither for reading nor for writing, and cannot execute code that is not in their own memory space.
A second major difference is that the virtual CPUs of different organisms can run at different speeds, such that one organism executes, for example, twice as many instructions in the same time interval as another organism. The speed at which a virtual CPU runs is determined by a number of factors, but most importantly, by the tasks that the organism performs: Tasks are logical computations that the organisms can carry out to reap extra CPU speed as bonus.
Adami and Ofria, in collaboration with others, have used Avida to conduct research in digital evolution, and the scientific journals Nature and Science have published four of their papers. The 2003 paper "The Evolutionary Origin of Complex Features" describes the evolution of a mathematical equals operation from simpler bitwise operations.[1]
|
|
This entry is from Wikipedia, the leading user-contributed encyclopedia. It may not have been reviewed by professional editors (see full disclaimer)