Machine isn't capable of informal proof

A machine isn't capable of informal proof in the human sense. No matter how informal a machine's reasoning may appear to be, it will still be grounded in a formal system; so its informal proof's also formalisable, and subject to the Gödel procedure.

John Lucas (1988).
RELATED ARTICLESExplain
Artificial Intelligence
Are thinking computers mathematically possible? [7]
No: computers are limited by Gödel's theorems
Improved machines
Self-referential machines
Gödelizing operator can defeat Lucas's argument
A self-Gödelizing machine can still be out-Gödeled
Informal proof
Machine isn't capable of informal proof
John Lucas
Graph of this discussion
Enter the title of your article


Enter a short (max 500 characters) summation of your article
Enter the main body of your article
Lock
+Comments (0)
+Citations (0)
+About
Enter comment

Select article text to quote
welcome text

First name   Last name 

Email

Skip