@incollection{yabuki04genetic,
	title = {Genetic programming using a {Turing} complete
                 representation: recurrent network consisting of trees},
	author = {Taro Yabuki and Hitoshi Iba},
	booktitle = {Recent Developments in Biologically Inspired
                 Computing},
	chapter = {4},
	editor = {Leandro N. {de Castro} and Fernando J. {Von Zuben}},
	pages = {61--81},
	publisher = {Idea Group Publishing},
	url = {http://www.iba.k.u-tokyo.ac.jp/~yabuki/paper/2003-yabuki-rtn-draft.pdf},
	year = {2004},
	biburl = {http://www.bibsonomy.org/bibtex/25f6e05ee6bdfbc1310952a6b3b5056c3/brazovayeye},
	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, 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.},
	size = {15 pages}, isbn = {1-59140-312-X}, notes = {http://www.idea-group.com/books/details.asp?id=4376

                 2003-yabuki-rtn-draft.pdf may be slightly different
                 from published version

                 },
	keywords = {algorithms, genetic programming }
}