> Perhaps a mathematical model of computation might help, of computable functions and Kolomogorov/Solomonoff program length to compute them. Using this model, t

> Perhaps a mathematical model of computation might help, of computable functions and Kolomogorov/Solomonoff program length to compute them. Using this model, the search space of functions increases exponentially with program length - but at what rate would the number of "interesting" computable functions increase? And with what density (with respect to the search space, i.e. how hard they are to find)? Like AIXI? http://www.hutter1.net/ai/aixigentle.htm http://www.hutter1.net/ai/aixigentle.htm