Quantum measurement as a source of uncomputable, high-K-complexity randomness
jessi_cata · x · 2026-10-30
- Answering "how is physical randomness possible given that Martin-Löf-random sequences are uncomputable": prepare a quantum system in the (|0⟩+|1⟩)/√2 superposition state, measure it in the {|0⟩,|1⟩} basis, and repeat.
- The key argument: this is not an algorithm — it doesn't follow deterministic steps, so the uncomputability barrier doesn't apply; with high probability the process yields strings of high Kolmogorov complexity.
- Follow-up: as for what actually happens during prepare/measure, in the simple case it's photon-detector experiments.
More from Research
- 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
- UniReps 2026 workshop set for December 12 in Paris — ClementineDomi6 · 2026-10-30
- Quantum randomness is falsifiable but never verifiable: a Kolmogorov-complexity argument — jessi_cata · 2026-10-30