'Below n log n' Claim Exposed: It's Actually n(log n)^0.54999...
BLUECOW009 · x · 2026-10-07
A quote-tweet exposes a research claim's sleight of hand: advertising complexity as 'below n log n' when the actual result is n(log n)^0.54 followed by trailing 9s — technically true, practically hugging the bound. BLUECOW009 notes that while it's clearly rage bait, the real point is how far such borderline phrasing can stretch.
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