|
|
|
|
|
by jwmerrill
3839 days ago
|
|
> The Bayesian approach is to assign a prior distribution to various theories of this nature. Because there are infinitely many possible priors, most exceedingly complicated (because the set of priors of complexity < C is finite or at least compact), we'll need to (eventually) assign low probabilities to high complexity ones. This gives a natural derivation of occams razor as well, at least as an asymptotic law. I don't think this would be a very compelling argument for Occam's razor if you didn't already believe it. This argument says you can't assign high probability to all "complex" theories, but it doesn't seem to say that the high probability theories must be simple. You could use any criterion at all to single out a high probability subset. |
|
Lim_{complexity -> infinity} P(theory having fixed complexity) = 0
Stated more precisely, fix a prior distribution, then for any epsilon > 0, I can find a complexity cutoff C (which depends on the prior) so that P(any theory with complexity > C being true) < epsilon.
This doesn't mean that P(theory|complexity) is monotonically decreasing, that would be a much stronger claim.
I don't know how this isn't a compelling argument, it's a provable mathematical statement.