Discussion about this post

User's avatar
Tyler Seacrest's avatar

I believe in objective probability. It does not seem to be a matter of opinion on what the probability is that an atom of uranium will decay in the next hour. True, rational agents observing many such decay events will converge on a common probability. But I feel like two perfectly rational agents who have identical observation histories should reach the same exact answer -- the one true probability for an agent in that position.

Solomonoff induction / Kolmogorov complexity seems like the most promising way forward. If it is uncomputable, I'm okay with that. I don't need to be able to actual compute the one true probability -- I just want to know it exists! The dependence on choosing a programing language / universal Turing machine is a big problem though. However, it's possible there are approaches that will solve this issue. Markus Mueller has done some very interesting work on this topic, with both an approach that didn't work (https://arxiv.org/abs/cs/0608095) and an approach he thinks is more promising (https://arxiv.org/abs/1712.01816).

Expand full comment
Victor Alexa's avatar

Unless I’m missing something, the language dependence problem being as inescapable as it is seems to imply that there was nothing especially wrong with Goodman’s own approach to the New Riddle of Induction, and that claims that a higher prior for simpler theories is needed to solve it are mistaken, since depending on whether or not language-dependence is a problem, that approach is either inadequate or unnecessary.

Expand full comment
8 more comments...

No posts

Ready for more?