Show simple item record

Implementing Universal Computation in an Evolutionary System

dc.date.accessioned2004-10-08T20:38:09Z
dc.date.accessioned2018-11-24T10:21:34Z
dc.date.available2004-10-08T20:38:09Z
dc.date.available2018-11-24T10:21:34Z
dc.date.issued2002-07-01en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/6696
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/6696
dc.description.abstractEvolutionary algorithms are a common tool in engineering and in the study of natural evolution. Here we take their use in a new direction by showing how they can be made to implement a universal computer. We consider populations of individuals with genes whose values are the variables of interest. By allowing them to interact with one another in a specified environment with limited resources, we demonstrate the ability to construct any arbitrary logic circuit. We explore models based on the limits of small and large populations, and show examples of such a system in action, implementing a simple logic circuit.en_US
dc.format.extent17 p.en_US
dc.format.extent3942374 bytes
dc.format.extent1153028 bytes
dc.language.isoen_US
dc.subjectAIen_US
dc.titleImplementing Universal Computation in an Evolutionary Systemen_US


Files in this item

FilesSizeFormatView
AIM-2002-010.pdf1.153Mbapplication/pdfView/Open
AIM-2002-010.ps3.942Mbapplication/postscriptView/Open

This item appears in the following Collection(s)

Show simple item record