Lucas-Penrose argument

A form of Penrose-Lucas argument — 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.

Ask AI about this wordChatGPTClaudePerplexityGoogle AIGrok

Meanings

proper nounthe Lucas-Penrose argument
  1. alternativeAlternative form of Penrose-Lucas argument.
Cite this entry
APA

Lucas-Penrose argument. (n.d.). In WatkinsX Dictionary. Retrieved November 4, 2026, from https://dictionary.watkinsx.com/word/Lucas-Penrose%20argument

MLA

“Lucas-Penrose argument.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/Lucas-Penrose%20argument. Accessed November 4, 2026.

Chicago

WatkinsX Dictionary, s.v. “Lucas-Penrose argument,” accessed November 4, 2026, https://dictionary.watkinsx.com/word/Lucas-Penrose%20argument.

Source: Lucas-Penrose argument on Wiktionary, CC BY-SA 4.0.