Un-Gödelizable machine wouldn't be a machine OpposingArgument #1103

Machines behave in a determinate manner according to definite rules. But any such determinate machine is susceptible to the Gödelization procedure because its behaviour can be formalised. Any machine that can't be Gödelized isn't really a machine.
John Lucas (1961).
PAGE NAVIGATOR(Help)
Map HomeArtificial Intelligence
IssueAre thinking computers mathematically possible? [7]
PositionNo: computers are limited by Gödel's theorems
OpposingArgumentImproved machines
SupportiveArgumentHighly complex machine may not be Gödelizable
OpposingArgumentUn-Gödelizable machine wouldn't be a machine
AdvocacyJohn Lucas
CommentsAdd a comment
Metadata

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