Kolmogorov complexity is computable for some hypotheses, just not all (for each formal axiomatic system, there is an upper bound to the complexity of hypotheses that can have their complexity determined by the system). Anyways, while we can never use Kolmogorov complexity to analyze all hypotheses, I believe that Manfred merely meant that we use it as an object of study, rather than to implement full Solomonoff induction.
Kolmogorov complexity is computable for some hypotheses, just not all (for each formal axiomatic system, there is an upper bound to the complexity of hypotheses that can have their complexity determined by the system). Anyways, while we can never use Kolmogorov complexity to analyze all hypotheses, I believe that Manfred merely meant that we use it as an object of study, rather than to implement full Solomonoff induction.