Christopher King comments on Solomonoff induction still works if the universe is uncomputable, and its usefulness doesn’t require knowing Occam’s razor

[Christopher King]

Note that Solomonoff induction is not itself computable.

Yeah that problem still remains. Solomonoff induction is still only relevant to law-thinking.

I think the even worse problem is that reasonable approximates to Solomonoff induction are still infeasible because they suffer from exponential slow downs. (Related: When does rationality-as-search have nontrivial implications?)