Joke thread pokes at claimed sub-n log n results: it's actually n(log n)^0.5477…
burny_tech · x · 2026-10-07
A retweeted thread lists theoretical CS results attributed to OpenAI's internal frontier model: improving 3sum to O(n^1.9992), integer multiplication to roughly O(n log n^(1e-55)), and Fourier transform gains at n log n^(1e-13).
The quoter follows up with a joke: a result billed as "below n log n" turns out to be n·(log n)^0.54777… with a long trail of 9s — an asymptotic improvement barely distinguishable from the original bound.
Related event: OpenAI's 'Below n log n' Claim Called Out as Wordplay(2 posts)→
More from Fun
- Kid casting a 'Riemann Hypothesis movie': Robert Pattinson to play Claude — matthew_d_green · 2026-11-22
- Viral demo economics: why AI teams will never ship a real GTA rival — cocktailpeanut · 2026-11-22
- LATENT SPACE: free Pokemon-style ROM hack where you catch AI models — Teknium · 2026-11-22
- Photo: dinner with Geoffrey Hinton at a restaurant in Glasgow — satnam6502 · 2026-11-22
- The favorite unsolved math problem: the private key to Satoshi's wallet — rez0__ · 2026-11-22
- Agent ran for hours playing Smash Ultimate but botched the replay-saving task — anpaure · 2026-11-22