Flubbity may not have much to do with complexity. In fact it can be opposed to complexity, except in the limit for extremely complex/flubby hypotheses. For example, you may say that flubbity=1000000-complexity for complexity<1000000, and flubbity=complexity elsewhere. Your proof will go through just fine, but in our world (which probably doesn't need such huge hypotheses) it will lead to the opposite of Occam's Razor. You don't always have the luxury of letting your parameter go to infinity.