IEEE World Congress on Computational Intelligence, 1994. In both normal and genetic programming considerable benefits have been found in adopting a structured approach . Turing completeness in the language of genetic programming with indexed memory . In Proceedings of the 1994 IEEE World Congress on Computational Intelligence, volume 1. IEEE Press, Jun 1994.
Memory is an array of integers indexed by the integers.
In practice this memory has a finite range of the integers over which it is indexed and each element can hold integers in a finite range. However , indexed memory can been seen as the simplest memory structure that can practically support all other memory structures. Turing completeness in the language of genetic programming with indexed memory . IEEE Press, 1994. Turing completeness in the language of genetic programming with indexed memory .