Turing completeness in the language of genetic programming with indexed memory

Turing completeness in the language of genetic programming with indexed memory
复制标题

带有索引存储器的遗传编程语言的图灵完备性

DOI：
--
复制
发表时间：
1994
期刊：
Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence
影响因子：
--
通讯作者：
Astro Teller
Astro Teller
中科院分区：
--
文献类型：
--
作者：
Astro Teller

文献摘要

被引文献

相似文献

Genetic programming is a method for evolving functions that find approximate or exact solutions to problems. There are many problems that traditional genetic programming (GP) cannot solve, due to the theoretical limitations of its paradigm. A Turing machine (TM) is a theoretical abstraction that expresses the extent of the computational power of algorithms. Any system that is Turing complete is sufficiently powerful to recognize all possible algorithms. GP is not Turing complete. This paper proves that when GP is combined with the technique of indexed memory, the resulting system is Turing complete. This means that, in theory, GP with indexed memory can be used to evolve any algorithm.<<ETX>>