If Martin-Löf random sequences are uncomputable, how does the universe do randomness?
hausdorff_space · x · 2026-10-30
The author poses a computability-theory puzzle: Martin-Löf's construction is a universal test for random sequences, but sequences passing it are uncomputable — no sequence-producing algorithm passes for every n-bit sequence. So how does the universe physically produce randomness? The question sparked discussion about whether quantum measurement sidesteps the computability barrier.
More from Research
- OpenAI researcher offers credits or GPU hours within 3 days for math formalization work — willdepue · 2026-10-31
- Prune-then-loop retrofit turns a pretrained VLM recurrent, beating baseline with 23.3% fewer language params — HildeKuehne · 2026-10-31
- Microsoft Research open-sources Agensh: 1,024 coding agents, no boss, 55% on Pandoc rebuild — JafarNajafov · 2026-10-31
- Tsinghua team's ActionCodec2 streams action tokens per step, hitting 46.2% grasp vs FAST's 9.2% — ZeYanjie · 2026-10-31
- OpenAI leak's hidden gem: a Log-Sobolev result completing KLS picture — IgorCarron · 2026-10-31
- "Probably present": A Visual Explainer of How Bloom Filters Work — YashasGunderia · 2026-10-31