HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Slightly beyond Turing-Computability for studying Genetic Programming

Olivier Teytaud 1
1 TANC - Algorithmic number theory for cryptology
Inria Saclay - Ile de France, LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
Abstract : Inspired by genetic programming (GP), we study iterative algorithms for non-computable tasks and compare them to naive models. This framework justifies many practical standard tricks from GP and also provides complexity lower-bounds which justify the computational cost of GP thanks to the use of Kolmogorov's complexity in bounded time.
Document type :
Conference papers
Complete list of metadata

Cited literature [30 references]  Display  Hide  Download

https://hal.inria.fr/inria-00173241
Contributor : Olivier Teytaud Connect in order to contact the contributor
Submitted on : Wednesday, September 19, 2007 - 2:16:47 PM
Last modification on : Friday, February 4, 2022 - 3:21:41 AM
Long-term archiving on: : Friday, April 9, 2010 - 2:29:34 AM

File

essai.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00173241, version 1

Collections

Citation

Olivier Teytaud. Slightly beyond Turing-Computability for studying Genetic Programming. MCU'07, 2007, Orléans, France. ⟨inria-00173241⟩

Share

Metrics

Record views

124

Files downloads

90