Is this somehow incorrect?

All else being equal, something that takes n bits to specify has probability proportional to 2^-n. So if hypothesis A takes 110 bits and hypothesis B takes 100, then A is about 1000x less probable.

Exactly what "all else being equal" means is somewhat negotiable.

• If you are using a Solomonoff prior, it means: in advance of looking at any empirical evidence at all, the probability you assign to a hypothesis should be proportional to 2^-n where n is the number of bits in a minimal computer program that specifies the hypothesis, in a language satisfying some technical conditions. Exactly how this cashes out depends on the details of the language you use, and there's no way of actually computing the numbers n in general, and there's no law that says you have to use a Solomonoff prior anyway.
• More generally, whatever prior you use, there are 2^n hypotheses of length n (and if you describe them in a language satisfying those technical conditions, then they are all genuinely different and as n varies you get every computable hypothesis) so (handwave handwave) on average for large n an n-bit hypothesis has to have probability something like 2^-n.

Anyway, the point is that the natural way to measure complexity is in bits, and probability varies exponentially, not linearly, with number of bits.