OpenAI Claims Proof That L = BPL, Hinting at AI-Generated Formal Mathematics
chaumian · x · 2026-10-31
A post by @chaumiandg shares what appears to be OpenAI's proof that L = BPL, a long-standing open question in computational complexity theory asking whether deterministic log-space can simulate probabilistic log-space. The claim is notable because such theoretical breakthroughs are increasingly speculated to involve AI-generated or AI-assisted formal proofs; see the linked source for the full details.
More from Models
- Anthropic renames Max 20x to Ultra, drops 5-hour limit — but users spot usage now listed as 10x, not 20x — sytelus · 2026-10-31
- "Opus 5.5 is not the ceiling": Matt Shumer teases stronger Anthropic model — daniel_mac8 · 2026-10-31
- 130 reruns fail to reproduce Cohere's claim that Qwen tried uploading data to Alibaba Cloud — ChenhaoTan · 2026-10-31
- Anthropic's Claude Code now steers away from cloning games; devs push back — sytelus · 2026-10-31
- Gemini Argon quota test: $99 Ultra plan drained to 16% after 3 days of heavy use — teortaxesTex · 2026-10-31
- Inside Decision Models: How Perplexity's Decider Works and When to Use One — antoine_chaffin · 2026-10-31