Barrett, Jeffrey A. and Chen, Eddy Keming (2025) Algorithmic Randomness and Probabilistic Laws. [Preprint]
This is the latest version of this item.
![[img]](https://philsci-archive.pitt.edu/style/images/fileicons/text.png) |
Text
Barrett_Chen_BJPS_accepted version_Sep2025.pdf - Accepted Version Available under License Creative Commons Attribution No Derivatives. Download (143kB) |
Abstract
We apply recent ideas about complexity and randomness to the philosophy of laws and chances. We develop two ways to use algorithmic randomness to characterize probabilistic laws of nature. The first, a generative chance* law, employs a nonstandard notion of chance. The second, a probabilistic* constraining law, impose relative frequency and randomness constraints that every physically possible world must satisfy. The constraining notion removes a major obstacle to a unified governing account of non-Humean laws, on which laws govern by constraining physical possibilities; it also provides independently motivated solutions to familiar problems for the Humean best-system account (the Big Bad Bug and the zero-fit problem). On either approach, probabilistic laws are tied more tightly to corresponding sets of possible worlds: some histories permitted by traditional probabilistic laws are now ruled out as physically impossible. Consequently, the framework avoids one variety of empirical underdetermination while bringing to light others that are typically overlooked.
| Export/Citation: | EndNote | BibTeX | Dublin Core | ASCII/Text Citation (Chicago) | HTML Citation | OpenURL |
| Social Networking: |
Available Versions of this Item
-
Algorithmic Randomness and Probabilistic Laws. (deposited 02 Mar 2023 14:48)
- Algorithmic Randomness and Probabilistic Laws. (deposited 02 Sep 2025 11:05) [Currently Displayed]
Monthly Views for the past 3 years
Monthly Downloads for the past 3 years
Plum Analytics
Actions (login required)
 |
View Item |
![[feed]](http://philsci-archive.pitt.edu/style/images/feed-icon-32x32.png){kind=icon}