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).
PAGE NAVIGATOR(Help)
-
Artificial Intelligence »Artificial Intelligence
▲
Are thinking computers mathematically possible? [7] »Are thinking computers mathematically possible? [7]
▲
No: computers are limited by Gödel's theorems »No: computers are limited by Gödel's theorems
▲
The problem of consistency »The problem of consistency
▲
The mechanist's dilemma »The mechanist's dilemma
■
Lucas can't know when his Gödelization procedure is applicable
+Commentaar (0)
+Citaten (0)
+About