= 27d567bc2d48d9f40e9ccc20ea370b15)
Dan_Moore comments on A Proof of Occam's Razor - Less Wrong
You are viewing a comment permalink. View the original post to see all comments and the full post content.
= 783df68a0f980790206b9ea87794c5b6)
Loading…= b715d02e85f7b3b4ae65ca3d3e450868)
Subscribe to RSS Feed
Powered by Reddit
= f037147d6e6c911a85753b9abdedda8d)
You are viewing a comment permalink. View the original post to see all comments and the full post content.
Comments (121)
<quote>I don't think the Razor means that every simpler hypothesis is more probable than every more complex hypothesis.</quote>
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.