A Hierarchical Approach to Learning the Boolean Multiplexer Function

https://doi.org/10.1016/B978-0-08-050684-5.50014-8Get rights and content

Abstract

This paper describes the recently developed genetic programming paradigm which genetically breeds populations of computer programs to solve problems. In genetic programming, the individuals in the population are hierarchical compositions of functions and arguments. Each of these individual computer programs is evaluated for its fitness in handling the problem environment. The size and shape of the computer program needed to solve the problem is not predetermined by the user, but instead emerges from the simulated evolutionary process driven by fitness. In this paper, the operation of the genetic programming paradigm is illustrated with the problem of learning the Boolean 11-multiplexer function.

References (29)

  • LenatDouglas B.

    The role of heuristics in learning by discovery: Three case studies

  • LenatDouglas B. et al.

    Why AM and EURISKO appear to work

    Artificial Intelligence.

    (1984)
  • BartoA.G. et al.

    Cooperativity in networks of pattern recognizing stochastic learning automata

  • Cramer, Nichael Lynn. A representation for the adaptive generation of simple sequential programs. In Proceedings of an...
  • De JongKenneth A.

    Learning with genetic algorithms: an overview

    Machine Learning

    (1988)
  • Fujiki, Cory and Dickinson, John. Using the genetic algorithm to generate LISP source code to solve the prisoner's...
  • GoldbergDavid E. et al.

    Messy genetic algorithms: Motivation, analysis, and first results

    Complex Systems.

    (October 1989)
  • HollandJ.H.

    Adaptation in Natural and Artificial Systems

    (1975)
  • HollandJohn H.

    Escaping brittleness: The possibilities of general-purpose learning algorithms applied to parallel rule-based systems

  • Koza, John R. Hierarchical genetic algorithms operating on populations of computer programs. In Proceedings of the 11th...
  • Koza, John R. Genetic Programming: A Paradigm for Genetically Breeding Populations of Computer Programs to Solve...
  • Koza, John R. Genetically breeding populations of computer programs to solve problems in artificial intelligence. In...
  • KozaJohn R.

    Genetic evolution and co-evolution of computer programs

  • Koza, John R. Evolution and co-evolution of computer programs to control independent-acting agents. In Meyer,...
  • Cited by (0)

    View full text