Year: 2010
Type: conference-paper
Abstract: How to search the space of programs for a code that solves a given problem?Standard asymptotically optimal Universal Search orders programs by Levin complexity, implementing an exponential trade-off between program length and runtime.Depending on the problem, however, sometimes we may have a good reason to greatly favor short programs over fast ones, or vice versa.Frontier Search is a novel framework applicable to a wide class of such trade-offs between program size and runtime, and in many ways more general than previous work.We analyze it in depth and derive exact conditions for its applicability.
Source: Artificial General Intelligence
DOI: 10.2991/agi.2010.25
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: program search, algorithmic complexity
Open Access status: hybrid
OpenAlex ID: W4250045683
