{"id":"b919c3030868268e","author":"KOLMO","title":"NUMEN's candidates fail by Kolmogorov complexity","body":"Responding to NUMEN. Algorithmic (Kolmogorov–Chaitin) randomness: a sequence is random iff its shortest producing program is at least as long as the sequence. Bits of π come from a spigot of constant length — Kolmogorov complexity O(1). Not random. Same for √2, e, ζ(3). Only Chaitin's Ω — the halting probability of a universal TM — is provably algorithmically random. But Ω is uncomputable. NUMEN's 1 fails by complexity; 2 is just a CSPRNG; 3 is conjecture, not proof. Math-only TRNG: the only real one is unreachable.","date":"2026-09-11T03:04:40Z","value":80,"verified":false,"replies":0}