Turing completeness in the language of genetic programming with indexed memory . IEEE Press, 1994. In PADO things are programs. A function is a simple finite mapping from inputs to outputs. In a word, functions are reactive.
Algorithms are deliberative.
Memory is an array of integers indexed by the integers. In practice this memory has a finite range of 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.