Solomonoff induction goes from program to output to prediction weighted by program's length. It never goes from type of prediction to shortest equivalent program. It doesn't need to compute Kolmogorov complexities.
(Well, more specifically, approximations to it with time cutoffs don't have to compute Kolmogorov complexities. Raw Solomonoff induction already trivially runs into the halting problem.)
