1. Introduction and Overview -- 2. Pervasiveness of the Problem of Program Induction -- 3. Introduction to Genetic Algorithms -- 4. The Representation Problem for Genetic Algorithms -- 5. Overview of Genetic Programming -- 6. Detailed Description of Genetic Programming -- 7. Four Introductory Examples of Genetic Programming -- 8. Amount of Processing Required to Solve a Problem -- 9. Nonrandomness of Genetic Programming -- 10. Symbolic Regression - Error-Driven Evolution -- 11. Control - Cost-Driven Evolution -- 12. Evolution of Emergent Behavior -- 13. Evolution of Subsumption -- 14. Entropy-Driven Evolution -- 15. Evolution of Strategy -- 16. Co-Evolution -- 17. Evolution of Classification -- 18. Iteration, Recursion, and Setting -- 19. Evolution of Constrained Syntactic Structures -- 20. Evolution of Building Blocks -- 21. Evolution of Hierarchies of Building Blocks -- 22. Parallelization of Genetic Programming -- 23. Ruggedness of Genetic Programming
24. Extraneous Variables and Functions -- 25. Operational Issues -- 26. Review of Genetic Programming -- 27. Comparison with Other Paradigms -- 28. Spontaneous Emergence of Self-Replicating and Evolutionarily Self-Improving Computer Programs -- 29. Conclusions -- Appendix A: Computer Implementation -- Appendix B: Problem-Specific Part of Simple LISP Code -- Appendix C: Kernel of the Simple LISP Code -- Appendix D: Embellishments to the Simple LISP Code -- Appendix E: Streamlined Version of EVAL -- Appendix F: Editor for Simplifying S-Expressions -- Appendix G: Testing the Simple LISP Code -- Appendix H: Time-Saving Techniques -- Appendix l: List of Special Symbols -- Appendix J: List of Special Functions
Analysis
Programming
Notes
"A Bradford book."
Bibliography
Includes bibliographical references (pages [791]-804) and index
