Penrose-Lucas argument

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English[edit]

Alternative forms[edit]

Etymology[edit]

Named after philosopher John Lucas and mathematician Roger Penrose.

Proper noun[edit]

the Penrose-Lucas argument

  1. An argument based on Gödel's incompleteness theorem, suggesting that the human mind cannot be computed on a Turing machine that works on Peano arithmetic because the latter cannot see the truth value of its Gödel sentence, while a human mind can.