Computational Complexity, Genetic Programming, and Implications

  title={Computational Complexity, Genetic Programming, and Implications},
  author={Bart Rylander and Terence Soule and James A. Foster},
Recent theory work has shown that a Genetic Program (GP) used to produce programs may have output that is bounded above by the GP itself [1]. This paper presents proofs that show that 1) a program that is the output of a GP or any inductive process has complexity that can be bounded by the Kolmogorov complexity of the originating program; 2) this result does not hold if the random number generator used in the evolution is a true random source; and 3) an optimization problem being solved with a… 

Computational complexity and the genetic algorithm

A method for evaluating the complexity of a problem specifically for genetic algorithms is described, used to define two specific genetic algorithm complexity classes and the impact of quantum computers upon the complexity classes for evolutionary computation is examined.

Quantum evolutionary programming

A simple quantum approach to genetic algorithms is presented and it is shown that in some cases, such as program induction, there is a measurable difference in quantum advantage of true randomness.

Developing Automatic Synthesis Methodologies for Quantum Circuits using Genetic Algorithms Ph

The goal is to perform automatic quantum circuit synthesis for a given functional description using rippled steps, and the usage of a parser which will create an internal data structure for the provided description is proposed.

Compression Genetic Algorithms and Quantum Genetic Algorithms

The approach of QGA is outlined by giving a comparison with Conventional Genetic Algorithm (CGA) to show that QGA can be a very promising tool for exploring search spaces.

Implementing quantum genetic algorithms: a solution based on Grover's algorithm

It turns out that the genetic strategy is not particularly helpful in the quantum computation approach; therefore the solution consists of designing a special-purpose oracle that will work with a modified version of an already known algorithm (maximum finding [1]), in order to reduce the QGAs to a Grover search.

Why We Do Not Evolve Software? Analysis of Evolutionary Algorithms

It is observed that nontrivial software from scratch and with no human intervention is not evolution from scratch, and computational complexity of the problem prevents it from being solved as currently attempted.

Genetic Algorithms and Quantum Computation

A survey of the main works in GAs plus quantum computing including also the application of GAs for learning quantum operators and circuit design and quantum evolutionary programming is considered.

Synthesis of Quantum Circuits Using Genetic Algorithm

The methodology of building a quantum circuit corresponding to a given quantum operation, expressed in terms of a unitary transform matrix, utilizing a specified quantum gate library has been proposed in this paper.

Learning Causal Graph: A Genetic Programming Approach

An approach for learning causal graph based on Wiener-Granger causal-theory, with minor modifications, and use Genetic Programming to determine the parameters of Granger formula to show that SP500 has Granger-causal influence on NIKKE.

Sobre expresiones cerradas para ondas gravitacionales

A new approach to find high-fidelity closed forms, ab-initio, without simplify the underlying model, in case of existence in the field of prediction and data analysis of complex systems, avoiding the curse of dimensionality is presented.



Computational Complexity and Genetic Algorithms

This paper shows that the GAcomplexity of a problem is determined by the growth rate of the minimum representation as the size of the problem instance increases, which leads to the definition of a new complexity class called "NPG".

Genetic Algorithms , and Hardness

This paper describes a new way for evaluating GA-hardness that is based on the foundations of formal complexity theory, and introduces a GA-reduction, which shows that a reasonable definition of "GAhardness" is essentially the same as the definition of 'hardness' in complexity theory.

Code growth in genetic programming

It is found that without a constraint mechanism the programs will grow indefinitely regardless of whether or not the growth acts to improve the programs' solutions.

The evolution of size and shape

It is shown bloat in common operators is primarily due to the exponential shape of the underlying search space, and new operators with considerably reduced bloating characteristics are demonstrated, and the simple random walk entropy increasing model is able to predict the shape of evolved programs.

Quantum Genetic Algorithms

This paper presents a simple quantum approach to genetic algorithms and analyzes its benefits and drawbacks.

Advances in Genetic Programming

This third volume of Advances in Genetic Programming highlights many of the recent technical advances in this increasingly popular field.

Using genetic programming to approximate maximum clique

We have attempted to solve the Maximum Clique Problem using a simple genetic program. The program language consists of a Union operator and vertex numbers. Our results compare favorably with complex

Quantum-inspired genetic algorithms

  • A. NarayananMark Moore
  • Computer Science
    Proceedings of IEEE International Conference on Evolutionary Computation
  • 1996
It is informally shown that the quantum inspired genetic algorithm performs better than the classical counterpart for a small domain.

Handbook of Theoretical Computer Science

The Handbook of Theoretical Computer Science provides professionals and students with a comprehensive overview of the main results and developments in this rapidly evolving field.

Unconventional Models of Computation

This book covers all major areas of unconventional computation, especially quantum computing, computing using organic molecules (DNA), and various proposals for computations that go beyond the Turing model.