comments

Lucas can't know when his Gödelization procedure is applicable

For the Lucas argument to work, Lucas must still be able to tell which machines are consistent. But this is mathematically impossible.

G. Lee Bowie (1982).

Note: For further explanation, see Church’s theorem as discussed in Hunter (1973) or Enderton (1972).
RELATED ARTICLESExplain
⌅
Artificial Intelligence
⌃
Are thinking computers mathematically possible? [7]
⌃
No: computers are limited by Gödel's theorems
⌃
The problem of consistency
⌃
The mechanist's dilemma
■
Lucas can't know when his Gödelization procedure is applicable
□
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