Matt Green muses: are n^25 galactic algorithms normal, or a glimpse of provable Algorithmica?
matthew_d_green · x · 2026-11-20
Cryptographer Matthew Green poses an open question in theoretical CS: are n^25 "galactic algorithms" normal for the universe, or the first strands of mist revealing a provable Algorithmica? He notes the value of "no human ever found an algorithm" keeps dropping, and adds the alternative that humans may just occupy a cramped corner of complexity space where asymptotic beauty doesn't matter for concrete parameters.
More from Research
- Persimmon user model to be presented at NeurIPS usersim workshop — ericzelikman · 2026-11-20
- Custom MLE-Agent hits 100% gold on MLE-Bench Tiny on a 2-vCPU EC2 box — InfamousTrouble7993 · 2026-11-20
- MIT and NVIDIA's QDA uses agents to auto-design LLM quantization recipes, beating top public ones by up to 2.2 points — omarsar0 · 2026-11-20
- AI-powered forensic metascience: auditing 7 million papers, 500K files scanned, 100+ issues found — gleech · 2026-11-20
- Harmonic's Aristotle writes proven-correct fusion plasma controllers in C and Verilog in 4 hours — satnam6502 · 2026-11-20
- Interp4discovery workshop on interpretability for scientific discovery at NeurIPS, Dec 12 — begusgasper · 2026-11-20