This is a great "how to" book loaded with examples of how to implement genetic algorithms. The two main points this book makes is that many seemingly different problems can be reformulated as problems of program induction and that the genetic programming paradigm described in this book provides a way to do that program induction. No prior knowledge of conventional genetic algorithms is assumed. Thus the first three chapters are introductory material. In particular, chapter three describes the conventional genetic algorithm and introduces certain terms common to the conventional genetic algorithm and genetic programming. If you are already familiar with genetic algorithms you can skip ahead.

Chapter 4 discusses the representation problem for the conventional genetic algorithm operating on fixed-length character strings and variations of the conventional genetic algorithm dealing with structures more complex and flexible than fixed-length character strings. Since this book assumes no prior knowledge of the LISP programming language, section 4.2 describes LISP and section 4.3 outlines the reasons behind the choice of LISP for the implementation of solutions in this book. Chapter 5 provides an informal overview of the genetic programming paradigm and chapter 6 provides a detailed description of the techniques of genetic programming. Some readers may prefer to rely on chapter 5 and hold off on reading the detailed discussion in chapter 6 until they have read chapter 7 and the later chapters that contain examples.

Chapter 7 provides a detailed description of how to apply genetic programming to four introductory examples thus laying the groundwork for all of the problems to be described later in the book. Chapter 8 discusses the amount of computer processing required by the genetic programming paradigm to solve certain problems. Chapter 9 shows that the results obtained from genetic programming are not the fruits of a random search. Chapters 10 through 21 illustrate how to use genetic programming to solve a wide variety of problems from varying disciplines and are defined by the table of contents. The examples in these 12 chapters make up the heart of the book.

The final eight chapters discuss aspects of genetic algorithms common to all implementations. Chapter 22 discusses the implementation of genetic programming on parallel computer architectures. Chapter 23 discusses the ruggedness of genetic programming with respect to noise, sampling, change, and damage. Chapter 24 discusses the role of extraneous variables and functions, and chapter 25 presents the results of some experiments relating to operational issues in genetic programming. Chapter 26 summarizes the five major steps in preparing to use genetic programming while chapter 27 compares genetic programming to other machine learning paradigms. Chapter 28 is an interesting one in which the spontaneous emergence of self-replicating and self-improving computer programs is discussed. Chapter 29 attempts to wrap up the book with a conclusion.

This book is best used for its examples and practical viewpoint. There are certain matters, such as how to program in LISP, for which you will need dedicated books since the amount of detail in this book is not enough. I do highly recommend this book as a uniquely practical one on how to implement genetic algorithms via computer programs. I haven't found another with so much practical information.

I became interested in Genetic Programming after hearing one of the professors at our university lecture on it to a small group of students and other professors. I asked what book might be a good starting point and he pointed me here and i'm glad he did.

This first volume in the Genetic Programming series of books by Koza is very well organized and clear in its explanations. I have not tried the techniques presented yet, but I have some good ideas on how to proceed. The author uses LISP as the language of choice in the book, but practically any modern language should be sufficient.

If you have any interest in Genetic Programming, I encourage you to at least pick up this first volume and read through it. This technology is still relatively new and the application of the techniques seems virtually limitless.

If you are someone who plans to study Genetic Programming, or are already doing so and feel kind of lost about it, then you must read this book. It starts from the very top and brings you through all the steps of Genetic Programmin with tons of very useful examples.

This book is great!

Yeah, its a big book...weighs a ton. However, only the first few chapters are concerned with the basic mechanisms of GP (should be familiar to anyone with a background in genetic algorithms or evolutionary computation). The rest of the book is chock full of examples on how to apply GP. These examples are essential and very welcome. I've found that I can usually find a solved problem in Koza that is similar to what I'm after, then I adapt it to my needs. This is a great reference, but don't be fooled into thinking this book is a tutorial. Think of it more as an exposition of GP with examples. For a tutorial, look somewhere else.

The book was very large but enjoyable and made the subject very clear and easy to understand. It explained the genetic programming algorithm very well and showed the results of many experiments to show applicability, limitations, and characteristics of the method.

There was some repetition in places, maybe because the author wanted to emphasize some points and also to remain understandable to persons who may read selected chapters or examples rather than from cover to cover, page by page.

Although the book states that Genetic Programming does not depend on the LISP language or features, it uses LISP as its exclusive language of choice. I would like to implement these generally very computationally intensive Genetic Programming Algorithms in a very fast and efficient way, which for me implies assembly language, and although the author gives good tips about making the algorithm run faster the implementation shown is all LISP and nothing else. I am also interested in using the algorithm to generate efficient, parsimonious, code. The author described the additional problems of parsimony, but gave no information on generation of fast code from S expressions. I will have to refer to some compiler books and my own experiments to go further in this area.

I look forward to experimenting with the subject and reading some of Dr. Koza's other books on the subject.