Frontier Search

Yi Sun, Tobias Glasmachers, Tom Schaul, Jurgen Schmidhuber
2010 Proceedings of the 3d Conference on Artificial General Intelligence (AGI-10)   unpublished
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
more » ... ntime, and in many ways more general than previous work. We analyze it in depth and derive exact conditions for its applicability.
doi:10.2991/agi.2010.25 fatcat:mg4u7bcq5rcdtg337wualci5cu