comments

Gödelizing operator can defeat Lucas's argument

Machine with a Gödelizing operator can carry out the Gödel procedure and add all its Gödel sentences to itself as theorums. It could recognise the truth of its Gödel sentence and any subsequent Gödel sentences that could be formed about the machine.

Argument anticipated by John Lucas (1961).



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
□
METACAT
□
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