Gödel's Incompleteness Theorem

Appears in 1 paper

A 1931 result by mathematician Kurt Gödel: in any formal mathematical system powerful enough to describe arithmetic, there are true statements that cannot be proved within that system.

As used in Paper 01 — Computing Machinery and Intelligence →

A 1931 result by mathematician Kurt Gödel: in any formal mathematical system powerful enough to describe arithmetic, there are true statements that cannot be proved within that system. Relevant to AI because it is sometimes used to argue that human reasoning exceeds what any machine can do.