After ETH's fall, researcher jokes an n^logn 3SAT algorithm wouldn't surprise him
DimitrisPapail · x · 2026-10-27
Researcher Dimitris Papail jokes that after ETH's collapse, an n^logn algorithm for 3SAT — or even P=NP in some absurd, practically irrelevant way — wouldn't surprise him. He stresses he's not knocking LLMs, calling them extraordinary; he's just mad at himself for letting worst-case complexity analysis deter him from trying things.
More from Fun
- AI researcher repligate shows off handmade gothic mask rig with embedded camera module — repligate · 2026-10-27
- EGO: a full AI-generated action short film released on Reddit — primehouse_studio · 2026-10-27
- Gary Marcus teased for being 'not harsh enough' as Anthropic criticism escalates — GaryMarcus · 2026-10-27
- Matt Levine on Anthropic's S-1: 'concerns have been raised' by the very people warning for years — sjgadler · 2026-10-27
- Hermes Girl Bot returns with dance moves, built on Grok bot + Hermes-Agent — alexcovo_eth · 2026-10-27
- "Don't Update iOS 27.2 for Security — Do It for the New Apple Music Icon" — cnakazawa · 2026-10-27