|
|
|
|
|
by yummyfajitas
3839 days ago
|
|
Yes. It's a fairly natural outgrowth of falsification based theories, and is in fact completely necessary. Consider a simple theory - bear attacks will be very low in the UK forever. Consider an alternate theory - bear attacks will be low until 2016 and then the bearpocalypse happens. Both theories have passed all attempts at falsification - they both accurately predict that bears haven't so far eaten very few people. 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. A very readable approach to this is a post by Scott Alexander: http://slatestarcodex.com/2014/09/03/the-guardian-vs-inducti... Wikipedia is also pretty good: https://en.wikipedia.org/wiki/New_riddle_of_induction |
|
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.