Machines can't understand language like humans
Machines' inability to distinguish the negation of the Gödel sentence from the Gödel sentence itself shows that matchines aren't able to distinguish any sentence from its negation—which is a requirement of natural language understanding.
Gödel’s theorem shows that machines can't have natural language understanding:

  • It is required of speakers of natural language that they be able to distinguish any sentence from its negation.
  • Machines can't do this for some sentences, as is shown by their inability to distinguish the negation of the Gödel sentence frpm the Gödel sentence itself.
Dale Jacquette (1987).
CONTEXT(Help)
-
Artificial Intelligence »Artificial Intelligence
▲
Are thinking computers mathematically possible? [7] »Are thinking computers mathematically possible? [7]
▲
No: computers are limited by Gödel's theorems »No: computers are limited by Gödel's theorems
▲
Theorems show limitations of machine thought »Theorems show limitations of machine thought
■
Machines can't understand language like humans
+Comments (0)
+Citations (0)
+About