Not a sole function of its complexity, but if A and B have the same complexity, and you have no further initial reason to place more belief in one or the other, then would you agree that you should assign P(A) = P(B)?
Complexity is a function of the hypothesis. Other functions can be made. In fact, complexity isn’t even a specific function. What language are we using?
How do you know that? Why must P(A) be a function of the complexity of A?
Also, this is only sufficient to yield a bound on Occam’s razor. How do you know that the universe doesn’t favor a given complexity?
Not a sole function of its complexity, but if A and B have the same complexity, and you have no further initial reason to place more belief in one or the other, then would you agree that you should assign P(A) = P(B)?
Complexity is a function of the hypothesis. Other functions can be made. In fact, complexity isn’t even a specific function. What language are we using?