Towards Practical Universal Search
Tom Schaul, Jürgen Schmidhuber · 2010
Universal Search is the asymptotically fastest way of finding a program that calculates a solution to a given problem, provided nothing is known about the problem except that there is a fast way of verifying solutions.