In The Emperor's New Mind, and in the later Shadows of the Mind, Sir Roger Penrose argues that human intelligence is not purely computational by appeal to Godel's Theorem. Basically the argument is this: given that every minimally complex and consistent system of proof (such as that constituted by the average PC) contains sentences that are true but unprovable in that system, there are truths comprehensible to the human mind that cannot be programmed into a computer, from which it follows that the human intelligence is not purely computational. Penrose' argument -sometimes known as the "Penrose-Lucus argument" - has been heavily criticized by mainstream academia, and its conclusion rejected. In this note the argument is defended by identify...
We revisit the question (most famously) initiated by Turing: can human intelligence be completely mo...
According to Sergio Galvan, some of the arguments offered by Lucas and Penrose are somewhat obscure...
We show that there is a mathematical obstruction to complete Turing computability of intelligence. ...
Gödel's theorem is consistent with the computationalist hypothesis. Roger Penrose, however, cla...
AbstractGödel's theorem is consistent with the computationalist hypothesis. Roger Penrose, however, ...
The Emperor's New Mind, physicist Roger Penrose's 1989 treatise attacking the foundations of strong ...
For many decades, the proponents of `artificial intelligence' have maintained that computers will so...
Strong artificial intelligence claims that conscious thought can arise in computers containing the r...
The modeling of the human mind based on quantum effects has been gaining considerable interest due t...
I explain why consciousness is non-algorithmic, and strong AI cannot come true, and reinforce Penros...
Due to his significant role in the development of computer technology and the discipline of artifici...
We shall present some relations between consistency and reflection principles which explain why is G...
Can a Turing Machine simulate the human mind? If the Church-Turing thesis is assumed to be true, the...
Chomsky thinks there are truths the human mind may be unable to understand or explain. Penrose think...
The idea that a computer could be conscious--or equivalently, that human consciousness is the effect...
We revisit the question (most famously) initiated by Turing: can human intelligence be completely mo...
According to Sergio Galvan, some of the arguments offered by Lucas and Penrose are somewhat obscure...
We show that there is a mathematical obstruction to complete Turing computability of intelligence. ...
Gödel's theorem is consistent with the computationalist hypothesis. Roger Penrose, however, cla...
AbstractGödel's theorem is consistent with the computationalist hypothesis. Roger Penrose, however, ...
The Emperor's New Mind, physicist Roger Penrose's 1989 treatise attacking the foundations of strong ...
For many decades, the proponents of `artificial intelligence' have maintained that computers will so...
Strong artificial intelligence claims that conscious thought can arise in computers containing the r...
The modeling of the human mind based on quantum effects has been gaining considerable interest due t...
I explain why consciousness is non-algorithmic, and strong AI cannot come true, and reinforce Penros...
Due to his significant role in the development of computer technology and the discipline of artifici...
We shall present some relations between consistency and reflection principles which explain why is G...
Can a Turing Machine simulate the human mind? If the Church-Turing thesis is assumed to be true, the...
Chomsky thinks there are truths the human mind may be unable to understand or explain. Penrose think...
The idea that a computer could be conscious--or equivalently, that human consciousness is the effect...
We revisit the question (most famously) initiated by Turing: can human intelligence be completely mo...
According to Sergio Galvan, some of the arguments offered by Lucas and Penrose are somewhat obscure...
We show that there is a mathematical obstruction to complete Turing computability of intelligence. ...