Indeterminism and Undecidability
Klaas Landsman

TL;DR
This paper argues that quantum indeterminism can be demonstrated through Chaitin's incompleteness theorem, showing that quantum measurement outcomes are almost surely 1-random, thus stronger than uncomputability, challenging deterministic hidden variable theories.
Contribution
It introduces a novel proof of quantum indeterminism based on algorithmic randomness and incompleteness, extending the empirical content beyond Bell's theorem.
Findings
Quantum outcomes are 1-random sequences, almost surely.
Bell's theorem leaves loopholes by only considering relative frequencies.
Quantum randomness exceeds mere uncomputability, implying indeterminism.
Abstract
The aim of this paper is to argue that the (alleged) indeterminism of quantum mechanics, claimed by adherents of the Copenhagen interpretation since Born (1926), can be proved from Chaitin's follow-up to Goedel's (first) incompleteness theorem. In comparison, Bell's (1964) theorem as well as the so-called free will theorem-originally due to Heywood and Redhead (1983)-left two loopholes for deterministic hidden variable theories, namely giving up either locality (more precisely: local contextuality, as in Bohmian mechanics) or free choice (i.e. uncorrelated measurement settings, as in 't Hooft's cellular automaton interpretation of quantum mechanics). The main point is that Bell and others did not exploit the full empirical content of quantum mechanics, which consists of long series of outcomes of repeated measurements (idealized as infinite binary sequences): their arguments only used…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Quantum Mechanics and Applications · Opinion Dynamics and Social Influence
