7h ago

Aran Nayebi, CMU assistant professor, argues Gödel's incompleteness theorem limits AI's mathematical discovery

Scott Alexander argued AI can resolve all provable statements

——0——
Original post
OPAran Nayebi#1409Aran Nayebi@ARAN_NAYEBI

@slatestarcodex @souljagoyteller Indeed, that's the core of it. This has arguably been known since 1931, though the logician Emil Post had the basic inklings even back in 1921:

6:18 AM · May 24, 2026 View on X
REPLYScott Alexander#297Scott Alexander@SLATESTARCODEX

@aran_nayebi @souljagoyteller Is this right? It seems like under Godel, we could (potentially) prove all math that can be proven, leaving only the inherently unprovable things left.

Aran NayebiAran Nayebi@aran_nayebi

@slatestarcodex @souljagoyteller Indeed, that's the core of it. This has arguably been known since 1931, though the logician Emil Post had the basic inklings even back in 1921:

1:18 PM · May 24, 2026 · 1.2K Views
2:16 PM · May 24, 2026 · 687 Views
Aran Nayebi, CMU assistant professor, argues Gödel's incompleteness theorem limits AI's mathematical discovery · Digg