Isn't Solomonoff induction optimal if the target is learnable? The connection to Kolmogorov complexity is interesting. It implies a perfect learner must have

Isn't Solomonoff induction optimal if the target is learnable? The connection to Kolmogorov complexity is interesting. It implies a perfect learner must have infinite KC or increase KC, neither of which an algorithm can do.