Randomness from initial conditions: The challenge of incompleteness
Abstract
Certain prima facie deterministic theories, notably Bohmian mechanics and kinetic theory, require ``random'' initial conditions in order to achieve their goals. I analyze recent proposals that this idea should be implemented using algorithmic randomness, seen as a mathematical sharpening of the typicality arguments originally used to understand these theories. On the one hand my analysis includes a critique of these arguments and hence a defense of this sharpening. On the other hand, I argue that Chaitin's incompleteness theorems for random sequences make it impossible for a dynamical theory to either process given random initial conditions beyond some finite (but not arbitrary) number of their digits, or else to state such conditions with arbitrary precision without compromising their randomness (these are two sides of the same coin). This challenges the ability of such theories to make any other predictions than those that hold typically in the usual sense of the word (like macroscopic statements), and moves their alleged determinism high up the metaphysical ladder.
Related
- Maximal Monotone Differential Inclusions with Volterra and One-Sided Lipschitz Perturbations under Nonlocal Initial Conditions and Applications
- Exact oracle complexity for function-value suboptimality under weighted initial conditions
- Simultaneous Reconstructions of (x,t) -Dependent Coefficients and Initial Conditions of Parabolic Equations
- Twofold Control: Simultaneous Optimization of Initial Conditions and Control Inputs
- Complex singularities for Burgers' equation with piecewise-continuous initial conditions
BibTeX
@misc{landsman2026randomness,
title = {{Randomness from initial conditions: The challenge of incompleteness}},
author = {Klaas Landsman},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.23355},
eprint = {2610.23355},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.23355},
note = {CC BY-NC-ND 4.0},
}
RIS
TY - UNPB
TI - Randomness from initial conditions: The challenge of incompleteness
AU - Klaas Landsman
PY - 2026
DA - 2026/10/16
PB - arXiv
DO - 10.48550/arxiv.2610.23355
UR - https://arxiv.org/abs/2610.23355
AB - Certain prima facie deterministic theories, notably Bohmian mechanics and kinetic theory, require ``random'' initial conditions in order to achieve their goals. I analyze recent proposals that this idea should be implemented using algorithmic randomness, seen as a mathematical sharpening of the typicality arguments originally used to understand these theories. On the one hand my analysis includes a critique of these arguments and hence a defense of this sharpening. On the other hand, I argue that Chaitin's incompleteness theorems for random sequences make it impossible for a dynamical theory to either process given random initial conditions beyond some finite (but not arbitrary) number of their digits, or else to state such conditions with arbitrary precision without compromising their randomness (these are two sides of the same coin). This challenges the ability of such theories to make any other predictions than those that hold typically in the usual sense of the word (like macroscopic statements), and moves their alleged determinism high up the metaphysical ladder.
ER -