Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

I'm puzzled as to why the author seems to think that the incompleteness theorem says anything important about AI (rather than just pointing out that self-contradictions can be a potentially irritating problem in logical systems - something that was known since antiquity.)


He writes: "Thus he identified fundamental limits of algorithmic theorem proving, computing, and any type of computation-based AI."

An automatic theorem prover is a kind of AI. Gödel showed its limitations.

There have been entire conferences dedicated to Gödel and AI.


> An automatic theorem prover is a kind of AI. Gödel showed its limitations.

Which of those limitations apply only to AI and not to human intelligence and mathematical reasoning?

Is it somehow surprising that AI can't prove mathematical contradictions to be true?




Consider applying for YC's Summer 2026 batch! Applications are open till May 4

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: