Penrose–Lucas argument
id:
penrose-lucas-argument-173-17295234
title:
Penrose–Lucas argument
text:
The Penrose–Lucas argument is a logical argument partially based on a theory developed by mathematician and logician Kurt Gödel. In 1931, he proved that every effectively generated theory capable of proving basic arithmetic either fails to be consistent or fails to be complete. Due to human ability to see the truth of formal system's Gödel sentences, it is argued that the human mind cannot be computed on a Turing machine that works on Peano arithmetic because the latter cannot see the truth valu
brand slug:
wiki
category slug:
encyclopedia
description:
Claim that human mathematicians are not describable as formal proof systems
original url:
https://en.wikipedia.org/wiki/Penrose%E2%80%93Lucas_argument
date created:
2016-03-30T21:19:43Z
date modified:
2024-09-02T16:35:04Z
main entity:
{"identifier":"Q60740314","url":"https://www.wikidata.org/entity/Q60740314"}
image:
fields total:
13
integrity:
15