Book review: Genetic Programming I1: Automatic Discovery of Reusable Programs by John R. Koza (The MIT Press 1994)

  • Authors:
  • Thomas Haynes

  • Affiliations:
  • Department of Mathematics and Computer Science University of Tulsa 600 South College Avenue Tulsa, OK USA 74104-3189 haynes@euler.mcs.utulsa.edu

  • Venue:
  • ACM SIGART Bulletin
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

Abstract

This book is a followon to the book in which John Koza introduced genetic programming (GP) to the world "enetic Programming: On the Programming of Computers by Means of Natural Selection" [5]1. As such, the primary intended audience is someone already familiar with GP; however, Koza does provide introductory material to both genetic algorithms (GA) and GP. The driving force behind this book is a method to automatically decompose a program into solvable components. The book presents this method, called automatically defined functions (ADF), and then presents case studies of the application of this method to a variety of problems. While this book's size is intimidating, there is a wealth of information to be found by the reader willing to conduct a prolonged campaign. The reader is advised to study the first seven chapters of the book to gain an understanding of the concepts behind ADFs. Then the reader should be able to select which case studies he or she finds to be of interest. If the reader is feeling overwhelmed by the information presented in the book, there are several concise chapters dealing with ADFs by Koza and others in Advances in Genetic Programming edited by Kenneth Kinnear [3]2.