The mechanist's dilemma SupportiveArgument #1146

The Lucas argument can be restated as a dilemma about consistency (see detailed text).
Consider some arbitrary machine M:

Either: M is consistent,

In which case, by Gödel’s theorem there will be a sentence that humans recognise as true but that M can't prove. So, we can do something that machine M can't.

Or, M is not consistent

In which case, M can't be a mind because minds must be consistent systems.

In either case, the machine can't be a mind.

John Lucas (1961).
PAGE NAVIGATOR(Help)
Map HomeArtificial Intelligence
IssueAre thinking computers mathematically possible? [7]
PositionNo: computers are limited by Gödel's theorems
OpposingArgumentThe problem of consistency
SupportiveArgumentThe mechanist's dilemma
OpposingArgumentLucas can't know when his Gödelization procedure is applicable
AdvocacyJohn Lucas
CommentsAdd a comment
Metadata

Entered by:- David Price
Entry date (GMT): 8/30/2006 6:09:00 PM
Last edit date (GMT): 12/8/2007 6:57:00 PM
Incoming cross-relations: 1
Outgoing cross-relations: 0
Average rating: 0 by 0 users