Does Chomsky complexity affect genetic programming computational requirements?

@inproceedings{Burger2011DoesCC,
  title={Does Chomsky complexity affect genetic programming computational requirements?},
  author={Clayton Burger and Mathys C. du Plessis},
  booktitle={SAICSIT},
  year={2011}
}
This paper presents an exploration into the relationship between Chomsky problem complexity, as defined by Theory of Computation, and the computational requirements to evolve solutions to these problems. Genetic programming is used to explore these computational requirements by evolving Turing machines that accept the languages posed. Quantifiable results are obtained by applying various metrics to the evolutionary success of these evolved Turing machines. The languages posed are samples out of… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-4 of 4 references

Evolving Automata using Genetic Programming

  • A. Naidoo, N. Pillay
  • (Masters Dissertation), University of KwaZulu…
  • 2008
Highly Influential
19 Excerpts

and E

  • F. B. Pereira, P. Machado
  • Costa. Graph based crossover - a case study with…
  • 1999
Highly Influential
4 Excerpts