Quantum randomness is falsifiable but never verifiable: a Kolmogorov-complexity argument
jessi_cata · x · 2026-10-30
jessicata argues in a thread with hausdorffspace that we can't positively verify quantum processes are random—only that our best theories say so. If a better physics theory existed showing the megabytes of quantum-experiment bits are compressible (low K-complexity) in a computationally tractable way, someone could falsify randomness, but no one has. Hence 'quantum theory is falsifiable,' not 'verifiable.' He then explains the simplest quantum RNG: a single photon through a 50:50 beam splitter, with each detector click yielding one unpredictable random bit.
More from Research
- Prove2Me formalizes 2,000+ operations research papers in Lean 4 with Claude agents, 64% done — ChrSzegedy · 2026-10-30
- 1-16 Coding Agents Tested: Teams Burn 36% More Tokens to Save 5 Hours — kyang8093 · 2026-10-30
- Noninvasive BCI lets unresponsive ICU patients communicate via brainwaves — ZeroStateReflex · 2026-10-30
- Adobe's EditAgent routes image edits across editors with evidence-based listwise judging — adobe · 2026-10-30
- AskStream benchmark shows models struggle to ask questions proactively in streaming video — CASIA · 2026-10-30
- Co-Design Bench: top coding agents fully satisfy only 26.4% of real-user tasks — Qwen · 2026-10-30