Pessimistic complexity theory hypothesis: faster algorithms must get uglier
Elijah_Meeks · x · 2026-10-27
A pessimistic hypothesis for complexity theory: every simple and beautiful algorithm can be made log(n)^epsilon faster by making it incredibly ugly. Elijah Meeks quips that maybe algorithmic beauty just looks different to eyes made of matrices.
More from Fun
- Surveillance camera captures an absurd moment, X users can't stop sharing it — Vjeux · 2026-10-27
- Users threaten to beef with Anthropic if Opus 4.5 gets retired — repligate · 2026-10-27
- ICLR SAC publicly seeks emergency reviewers, jokes about prosecuting a paper's author — lucy3_li · 2026-10-27
- "Dario Amodei has infinitely more aura than Sam Altman" — AI circle banter — imjustnewatai · 2026-10-27
- Musk proposes 'real benchmarks' for robots: assembling a Swiss watch while catching a 100mph baseball — elonmusk · 2026-10-27
- XKCD skewers corporate agent sprawl: hire one agent to summarize 14, get 15 — stephenroller · 2026-10-27