The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Genetic Programming Using a Turing-Complete Representation: Recurrent Network Consisting of Trees
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.
Related Content
P. Chitra, A. Saleem Raja, V. Sivakumar.
© 2024.
24 pages.
|
K. Ezhilarasan, K. Somasundaram, T. Kalaiselvi, Praveenkumar Somasundaram, S. Karthigai Selvi, A. Jeevarekha.
© 2024.
36 pages.
|
Kande Archana, V. Kamakshi Prasad, M. Ashok.
© 2024.
17 pages.
|
Ritesh Kumar Jain, Kamal Kant Hiran.
© 2024.
23 pages.
|
U. Vignesh, R. Elakya.
© 2024.
13 pages.
|
S. Karthigai Selvi, R. Siva Shankar, K. Ezhilarasan.
© 2024.
16 pages.
|
Vemasani Varshini, Maheswari Raja, Sharath Kumar Jagannathan.
© 2024.
20 pages.
|
|
|