Reflective oracles make Solomonoff prediction computable in its own model
A new paper shows how reflective oracles address a core problem in Solomonoff induction: the ideal predictor is powerful enough to dominate computable sources, but its next-bit probabilities are not computable. The oracle can ask probabilistic questions about machines that use the same oracle, randomizing at contradictory boundary cases; completing those machines produces proper probability measures whose conditionals are uniformly computable relative to the oracle. That gives researchers a self-referential probabilistic setting for studying universal prediction.