The argument from Church's theorem
According to Church's theorem there's no decision procedure for predicate calculus. This means that there is no computable procedure by which a machine can decide whether a given sentence in predicate calculus is true or false.
Human mathematicians, on the other hand, often decide the truth or falsity of sentences of predicate calculus.

Moreover, human mathematicians decide such questions by constructing proofs in a reasonable amount of time and not just a random.

Argument anticipated by J. J. C. Smart (1961).
Immediately related elementsHow this works
-
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
■
The argument from Church's theorem
●
The ingenious machine Â»The ingenious machine
+Kommentare (0)
+Verweise (0)
+About