'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.
More from Fun
- Flexible LED roller screen wows, veteran recalls oil-disk projectors of the 1990s — Scobleizer · 2026-10-07
- Engineer shows what his screen looks like while AI agents do the work — KevinNaughtonJr · 2026-10-07
- Nested sandboxing: let agents 'escape' into another sandbox so they stop trying — generativist · 2026-10-07
- Luka founder shares 2015 launch video: building personal agents 11 years before the wave — soleio · 2026-10-07
- AI Twitter jokes OpenAI will post all nine billion names of God to GitHub — tszzl · 2026-10-07
- "AI is displacing top mathematicians, but it'll never do what you do" — zck · 2026-10-07