comments

Lucas tricks machines into contradicting themselves

Lucas can't assert "This formula can't be consistently asserted by Lucas" without contradicting himself yet the statement is true. The argument tricks Lucas into contradiction—in the same way that Gödel’s theorem tricks machines into contradiction.

C..H.Whiteley (1962).

RELATED ARTICLESExplain
⌅
Artificial Intelligence
⌃
Are thinking computers mathematically possible? [7]
⌃
No: computers are limited by Gödel's theorems
■
Lucas tricks machines into contradicting themselves
↳
Lucas uses a faulty way of identifying differences
↳
Lucas can believe his Whiteley sentence
□
Theorems show limitations of machine thought
□
Gödel shows machines can't be fully conscious
□
Argument from Gödel's theorem is dialectical
□
Mathematical insight is non-algorithmic
□
Improved machines
□
Gödel limits formal systems not machine implementations
□
The problem of consistency
□
Lucas may be a Turing machine
□
Some people cannot understand Gödel's theorem
□
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