Refuting Lucas: (2)

• Turing’s second point is decisive

  • “We too often give wrong answers ourselves to be justified in being very pleased at such evidence of fallibility on the part of machines.”
  • Gödel’s theorem applies only to consistent formal systems
  • Humans often utter untrue statements
  • We might be unlimited formal systems which make errors

• The two arguments show that Lucas’s attack fails

  • Strong AI’ers don’t need to worry about Gödel’s theorem

• The ‘Chinese Room’ attack is much stronger

Previous slide

Next slide

Back to first slide

View graphic version