Event Detail

We explore the role of algorithmic randomness and exchangeability in defining probabilistic laws and their implications for chance-credence principles like the Principal Principle. Building on our previous work on probabilistic constraint laws (arXiv:2303.01411), we develop a new approach to proving the Principal Principle. This proof avoids circularity by grounding it in algorithmic randomness, frequency constraints, and exchangeable priors. Our approach establishes a direct link between long-run frequencies and short-term credences, clarifying the epistemic foundations of chance, typicality, and probabilistic laws. (Joint work with Jeffrey A. Barrett.)