As the complexity of your hypotheses tends to infinity, their probability tends to zero. Still, that doesn’t mean that each and every increase of complexity decreases the probability.
I upvoted the article, because I like this definition (i.e., it corresponds well to how I think of Occam’s Razor), and I think you’ve proven it. However, I agree with Oscar Cunningham that the statement at the top of your article is different, and you didn’t prove it. In particular, I don’t like the phrase ‘on average’.
State that this is what you’re trying to prove at the top of your main post. People are downvoting you because you haven’t proved what they see as Occam’s razor.
I don’t think you’ve stated the theorem you are trying to prove precisely. I think that would help.
As the complexity of your hypotheses tends to infinity, their probability tends to zero. Still, that doesn’t mean that each and every increase of complexity decreases the probability.
I upvoted the article, because I like this definition (i.e., it corresponds well to how I think of Occam’s Razor), and I think you’ve proven it. However, I agree with Oscar Cunningham that the statement at the top of your article is different, and you didn’t prove it. In particular, I don’t like the phrase ‘on average’.
I edited the article.
State that this is what you’re trying to prove at the top of your main post. People are downvoting you because you haven’t proved what they see as Occam’s razor.
I edited the article.