You can have a hypothesis with really high kolmogorov complexity, but if the hypothesis is true 50% of the time it will require 1 bit of information to specify with respect to a coding scheme that merely points to cached hypotheses.
This is why when kolmogorov complexity is defined it’s with respect to a fixed universal description language, as otherwise you’re right, it’s vacuous to talk about the simplicity of a hypothesis.
You can have a hypothesis with really high kolmogorov complexity, but if the hypothesis is true 50% of the time it will require 1 bit of information to specify with respect to a coding scheme that merely points to cached hypotheses.
This is why when kolmogorov complexity is defined it’s with respect to a fixed universal description language, as otherwise you’re right, it’s vacuous to talk about the simplicity of a hypothesis.