DMCA
Evolving Turing-Complete Programs for a Register Machine with Self-modifying Code (1995)
| Venue: | Genetic algorithms: proceedings of the sixth international conference (ICGA95 |
| Citations: | 51 - 5 self |
BibTeX
@INPROCEEDINGS{Nordin95evolvingturing-complete,
author = {Peter Nordin and Wolfgang Banzhaf and Fachbereich Informatik and Fachbereich Informatik and Lehrstuhl Fur Systemanalyse and Lehrstuhl Fur Systemanalyse},
title = {Evolving Turing-Complete Programs for a Register Machine with Self-modifying Code},
booktitle = {Genetic algorithms: proceedings of the sixth international conference (ICGA95},
year = {1995},
pages = {318--325},
publisher = {Morgan Kaufmann}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
The majority of commercial computers today are register machines of von Neumann type. We have developed a method to evolve Turing-complete programs for a register machine. The described implementation enables the use of most program constructs, such as arithmetic operators, large indexed memory, automatic decomposition into subfunctions and subroutines (ADFs), conditional constructs i.e. if-then-else, jumps, loop structures, recursion, protected functions, string and list functions. Any C-function can be compiled and linked into the function set of the system. The use of register machine language allows us to work at the lowest level of binary machine code without any interpreting steps. In a von Neumann machine, programs and data reside in the same memory and the genetic operators can thus directly manipulate the binary machine code in memory. The genetic operators themselves are written in C-language but they modify individuals in binary representation. The result is an execution spe...
Keyphrases
register machine turing-complete program self-modifying code binary machine code genetic operator execution spe program construct loop structure von neumann type function set automatic decomposition interpreting step register machine language list function conditional construct data reside described implementation von neumann machine protected function large indexed memory binary representation commercial computer today arithmetic operator
