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.

Original post →

More from Fun

Fun channel →