• Corpus ID: 31978081

Genetic programming - on the programming of computers by means of natural selection

  title={Genetic programming - on the programming of computers by means of natural selection},
  author={John R. Koza},
  booktitle={Complex adaptive systems},
  • J. Koza
  • Published in Complex adaptive systems 1993
  • Computer Science
Background on genetic algorithms, LISP, and genetic programming hierarchical problem-solving introduction to automatically-defined functions - the two-boxes problem problems that straddle the breakeven point for computational effort Boolean parity functions determining the architecture of the program the lawnmower problem the bumblebee problem the increasing benefits of ADFs as problems are scaled up finding an impulse response function artificial ant on the San Mateo trail obstacle-avoiding… 

Figures and Tables from this paper

Human-Competitive Evolvable Hardware Created by Means of Genetic Programming
This chapter concentrates on the automatic synthesis of six 21st century patented analog electrical circuits by means of genetic programming, which is done "from scratch" without starting from a preexisting good design and without prespecifying the circuit’s topology or number or sizing of components.
Gene Expression Programming: A New Adaptive Algorithm for Solving Problems
Gene expression programming, a genotype/phenotype genetic algorithm (linear and ramified), is presented here for the first time as a new technique for the creation of computer programs with high efficiency that greatly surpasses existing adaptive techniques.
Genetic programming as a means for programming computers by natural selection
The recently developed genetic programming paradigm described herein provides a way to search the space of possible computer programs for a highly fit individual computer program to solve (or approximately solve) a surprising variety of different problems from different fields.
Evolution of Both the Architecture and the Sequence of Work-Performing Steps of a Computer Program Using Genetic Programming with Architecture-Altering Operations
This chapter describes how the biological theory of gene duplication described in Susumu Ohno’s provocative book, Evolution by Means of Gene Duplication, was brought to bear on the problem of architecture discovery in genetic programming.
Function Finding and the Creation of Numerical Constants in Gene Expression Programming
In this work, three function finding problems are analyzed in an attempt to discuss the question of constant creation in evolutionary computation by comparing two different approaches to the problem of constant created.
Genetic Programming - Introduction, Applications, Theory and Open Issues
In this chapter, the main definitions and features of GP are introduced and its typical operations are described and some of its applications are surveyed.
On the Time and Space Complexity of Genetic Programming for Evolving Boolean Conjunctions
A performance analysis that sheds light on the behaviour of simple GP systems for evolving conjunctions of n variables (ANDn) and reveals the existence of small training sets that allow the evolution of the exact conjunctions even in the presence of negations or of undesired variables.
A Survey of Genetic Programming and Its Applications
This paper reviews existing literature regarding the GPs and their applications in different scientific fields and aims to provide an easy understanding of various types of GPs for beginners.
Toward simulated evolution of machine-language iteration
It is shown that genetic programming can produce exact and general multiplication routines by synthesizing the necessary iterative control structures from primitive machine-language instructions.


Hierarchical Genetic Algorithms Operating on Populations of Computer Programs
A new approach in which the size and shape of the solution to such problems is dynamically created using Darwinian principles of reproduction and survival of the fittest is reported on.
Genetic evolution and co-evolution of computer programs
This chapter describes the recently developed "genetic programming paradigm" which genetically breeds populations of computer programs in order to find a computer program that solves the given problem.
Binary and floating-point function optimization using messy genetic algorithms
This dissertation examines the working of a messy GA, analyzes its operators, extends its use to solve problems of nonuniform building block size and scale, and applies messy GAs to solve a real-world engineering problem that is difficult to solve using a simple GA.
Automatic Programming of Robots Using Genetic Programming
The task of automatically generating a computer program to enable an autonomous mobile robot to perform the task of moving a box from the middle of an irregular shaped room to the wall is considered.
Messy Genetic Algorithms: Motivation, Analysis, and First Results
The mGA presented herein repeatedly achieves globally optimal results without prior knowledge of good string arrangements, and it does so at the very first generation in which strings are long enough to cover the problem.
Evolving networks: using the genetic algorithm with connectionist learning
A survey of recent work that combines Holland's Genetic Algorithm with con-nectionist techniques and delineates some of the basic design problems these hybrids share concludes that the GA's global sampling characteristics compliment connectionist local search techniques well, leading to eecient and reliable hybrids.
Handbook Of Genetic Algorithms
This book sets out to explain what genetic algorithms are and how they can be used to solve real-world problems, and introduces the fundamental genetic algorithm (GA), and shows how the basic technique may be applied to a very simple numerical optimisation problem.