Machine isn't capable of informal proof OpposingArgument #1109

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).
PAGE NAVIGATOR(Help)
Map HomeArtificial Intelligence
IssueAre thinking computers mathematically possible? [7]
PositionNo: computers are limited by Gödel's theorems
OpposingArgumentImproved machines
SupportiveArgumentSelf-referential machines
SupportiveArgumentGödelizing operator can defeat Lucas's argument
OpposingArgumentA self-Gödelizing machine can still be out-Gödeled
OpposingArgumentInformal proof
OpposingArgumentMachine isn't capable of informal proof
AdvocacyJohn Lucas
CommentsAdd a comment
Metadata

Entered by:- David Price
Entry date (GMT): 8/29/2006 10:27:00 PM
Last edit date (GMT): 10/23/2007 1:18:00 PM
Incoming cross-relations: 1
Outgoing cross-relations: 0
Average rating: 0 by 0 users