OpenAI's 'Below n log n' Claim Called Out as Wordplay
Posts citing OpenAI's internal models' TCS results, like 3SUM at O(n^1.9992), were mocked online: a claimed 'below n log n' bound is actually n(log n)^0.5499...9, a technicality amounting to wordplay.
2026-10-07 ~ 2026-10-07 · 2 related posts
- Episode 1: Truly Subquadratic 3SUM and Subcubic APSP Break Decades-Old Barriers, Reportedly with Claude's Help(2026-10-06, 13 posts)
- Episode 2: Integer Multiplication Breaks the n log n Barrier, with AI Leading the Way(2026-10-07, 11 posts)
- Episode 3: OpenAI's 'Below n log n' Claim Called Out as Wordplay(2026-10-07, 2 posts)
- Episode 4: AI Agents Chase Integer Multiplication Complexity Records in Viral Livestream(2026-10-08, 4 posts)
- 'Below n log n' Claim Exposed: It's Actually n(log n)^0.54999... — BLUECOW009 · 2026-10-07
- Joke thread pokes at claimed sub-n log n results: it's actually n(log n)^0.5477… — burny_tech · 2026-10-07