Genetic Programming Using a Turing-Complete Representation: Recurrent Network Consisting of Trees

Genetic Programming Using a Turing-Complete Representation: Recurrent Network Consisting of Trees

Taro Yabuki (The University of Tokyo, Japan) and Hitoshi Iba (The University of Tokyo, Japan)
Copyright: © 2005 |Pages: 21
DOI: 10.4018/978-1-59140-312-8.ch004
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

In this chapter, a new representation scheme for Genetic Programming (GP) is proposed. We need a Turing-complete representation for a general method of generating programs automatically; that is, the representation must be able to express any algorithms. Our representation is a recurrent network consisting of trees (RTN), which is proved to be Turing-complete. In addition, it is applied to the tasks of generating language classifiers and a bit reverser. As a result, RTN is shown to be usable in evolutionary computing.

Complete Chapter List

Search this Book:
Reset