but if you are trying to determine how powerful an agent will be in this universe, you probably want to replace the Solomonoff prior with the posterior resulting from updating the Solomonoff prior with data from our universe.
Hence the Schmidhuber (IIRC) paper on speeding up optimal problem solvers with an initial package of encoded knowledge about the domain?
The optimal ordered problem solver OOPS will save earlier solutions as a reference for later problems, see here, for the efficacy (or lack thereof) and caveats of that approach, see here.
In general we would like our learner to continually profit from useful information conveyed by solutions to earlier tasks. (...) Storage for the first found program computing a solution to the current task becomes nonwriteable.
For a related paper on how to decide what information to save from previous tasks (“inductive transfer of knowledge from one task solution to the next”), see here.
(Side note: awsome quote I stumbled upon in the first paper:
And since constants beyond 2^500 do not even make sense within this universe, (Levin Search) may be viewed as academic exercises demonstrating that the O() notation can sometimes be practically irrelevant despite its wide use in theoretical computer science.)
Hence the Schmidhuber (IIRC) paper on speeding up optimal problem solvers with an initial package of encoded knowledge about the domain?
Awesome, do you know the title?
The optimal ordered problem solver OOPS will save earlier solutions as a reference for later problems, see here, for the efficacy (or lack thereof) and caveats of that approach, see here.
For a related paper on how to decide what information to save from previous tasks (“inductive transfer of knowledge from one task solution to the next”), see here.
(Side note: awsome quote I stumbled upon in the first paper:
Not offhand, sorry.