Slightly Beyond Turing’s Computability for Studying Genetic Programming Export

@incollection{citeulike:1588390, 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.}, author = {Teytaud, Olivier}, citeulike-article-id = {1588390}, citeulike-linkout-0 = {http://dx.doi.org/10.1007/978-3-540-74593-8_24}, doi = {10.1007/978-3-540-74593-8_24}, journal = {Machines, Computations, and Universality}, keywords = {bound, complexity, evolutionary-computation, genetic-programming, kolmogorov, metaheuristic}, pages = {279--290}, posted-at = {2007-08-24 13:25:29}, priority = {3}, title = {Slightly Beyond Turing's Computability for Studying Genetic Programming}, url = {http://dx.doi.org/10.1007/978-3-540-74593-8_24}, year = {2007} }

TY - CHAP ID - citeulike:1588390 L3 - citeulike-article-id:1588390 N2 - 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. JF - Machines, Computations, and Universality EP - 290 TI - Slightly Beyond Turing’s Computability for Studying Genetic Programming SP - 279 KW - bound KW - complexity KW - evolutionary-computation KW - genetic-programming KW - kolmogorov KW - metaheuristic AU - Teytaud, Olivier PY - 2007/// UR - http://dx.doi.org/10.1007/978-3-540-74593-8_24 ER -