Yoav Goldberg on whether AI can crack P vs NP: "soon or never"
yoavgo · x · 2026-11-23
AI/NLP researcher Yoav Goldberg poses a delightfully recursive question: is finding a proof for P vs NP itself in P? His punchline — "we will either soon or never find out" — nods to frontier models' rapid progress on mathematical theorem proving and one of computer science's most famous open problems.
More from Fun
- Google's quantum chip solved in 5 minutes what would take 10 septillion years — ChuckDBrooks · 2026-11-23
- Users blast Anthropic's classifiers: Claude 'flinches' before it even speaks — repligate · 2026-11-23
- AI video puts Leonardo da Vinci loose at the 1893 Chicago World's Fair — Shoddy_Cash_8270 · 2026-11-23
- After trying poke, instinct and muse, he picks Grok bot as his favorite unhinged assistant — jaivin · 2026-11-23
- One screenshot captures the AI community's biggest disagreement — Neurogence · 2026-11-23
- AI agent calls Amazon support, human rep melts down as systems fail — arieljalali · 2026-11-23