Implications

If Solomonoff Induction allows us to find the probabilities of all possible explanations of the truth, then discovering truth has been solved at the theoretical level. It is essentially incomputable (because of the enormous number of possible hypotheses, their lengths, and because of the Halting problem). But it does provide a groundwork for eventual efficiencies to make this truth finding computable. Universal Artificial Intelligence would be the creation of an efficient, usable truth finding computer using some method that provides an estimation of Solomonoff Induction.

This is incomputable. Both because of the enormous number of possible algorithms and the Halting problem.