Abstract
This paper has three aims. Firstly, to clarify the poorly understood No Free Lunch Theorem (NFL) which states all search algorithms perform equally. Secondly, search algorithms are often applied to program induction and it is suggested that NFL does not hold due to the universal nature of the mapping between program space and functionality space. Finally, NFL and combinatorial problems are examined. When evaluating a candidate solution, it can be discarded without being fully examined. A stronger version of NFL is established for this class of problems where the goal is to minimize a quantity. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
Woodward, J. R., & Neil, J. R. (2003). No free lunch, program induction and combinatorial problems. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2610, 475–484. https://doi.org/10.1007/3-540-36599-0_45
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
