Genetic programming using a Turing complete representation: recurrent network consisting of trees
Created by W.Langdon from
gp-bibliography.bib Revision:1.8051
- @InCollection{yabuki04genetic,
-
author = "Taro Yabuki and Hitoshi Iba",
-
title = "Genetic programming using a {Turing} complete
representation: recurrent network consisting of trees",
-
booktitle = "Recent Developments in Biologically Inspired
Computing",
-
publisher = "Idea Group Publishing",
-
year = "2004",
-
editor = "Leandro N. {de Castro} and Fernando J. {Von Zuben}",
-
chapter = "4",
-
pages = "61--81",
-
keywords = "genetic algorithms, genetic programming, Recurrent
Network consisting of Trees, RTN",
-
ISBN = "1-59140-312-X",
-
URL = "http://www.iba.k.u-tokyo.ac.jp/~yabuki/paper/2003-yabuki-rtn-draft.pdf",
-
DOI = "doi:10.4018/978-1-59140-312-8.ch004",
-
size = "15 pages",
-
abstract = "a new representation scheme for Genetic Programming
(GP) is proposed. We need a Turing-complete
representation for a general method of generating
programs automatically, i.e. 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.",
-
notes = "broken August 2020
http://www.idea-group.com/books/details.asp?id=4376
2003-yabuki-rtn-draft.pdf may be slightly different
from published version
The University of Tokyo, Japan.",
- }
Genetic Programming entries for
Taro Yabuki
Hitoshi Iba
Citations