Genetic Programming Estimates of Kolmogorov Complexity

Created by W.Langdon from gp-bibliography.bib Revision:1.4221

  author =       "M. Conte and G. Tautteur and I. {De Falco} and 
                 A. Della Cioppa and E. Tarantino",
  title =        "Genetic Programming Estimates of Kolmogorov
  booktitle =    "Genetic Algorithms: Proceedings of the Seventh
                 International Conference",
  year =         "1997",
  editor =       "Thomas Back",
  pages =        "743--750",
  address =      "Michigan State University, East Lansing, MI, USA",
  publisher_address = "San Francisco, CA, USA",
  month =        "19-23 " # jul,
  publisher =    "Morgan Kaufmann",
  keywords =     "genetic algorithms, genetic programming",
  ISBN =         "1-55860-487-1",
  broken =       "",
  URL =          "",
  URL =          "",
  size =         "7 pages",
  abstract =     "In this paper the problem of the Kolmogorov complexity
                 related to binary strings is faced. We propose a
                 Genetic Programming approach which consists in evolving
                 a population of Lisp programs looking for the optimal
                 program that generates a given string. This
                 evolutionary approach has permited to overcome the
                 intractable space and time difficulties occurring in
                 methods which perform an approximation of the
                 Kolmogorov complexity function. The experimental
                 results are quite significant and also show interesting
                 computational strategies so proving the effectiveness
                 of the implemented technique.",
  notes =        "ICGA-97",

Genetic Programming entries for M Conte G Tautteur Ivanoe De Falco Antonio Della Cioppa Ernesto Tarantino