This paper presents, from a historical and logical-philosophical perspective, the Gödelian arguments of two Oxford scholars, John Lucas and Roger Penrose. Both have been based on Gödel's Theorem to refute mechanism, computationalism and the possibility of creating an AI capable of simulating or duplicating the human mind. In the conclusions, the growing application of empirical methods in mathematics is mentioned and a possible path that would support Lucas and Penrose's arguments is speculated.

The alleged proof of the non-mechanical, or non-computational, character of the human mind based on Gödel’s incompleteness theorem is revisited. Its history is reviewed. The proof, also known as the Lucas argument and the Penrose argument, is refuted. It is claimed, following Gödel himself and other leading logicians, that antimechanism is not implied by Gödel’s theorems alone. The present paper sets out this refutation in its strongest form, demonstrating general theorems implying the inconsistency of Lucas’s arithmetic and the semantic inadequacy (...) of Penrose’s arithmetic. On the other hand, the limitations to our capacity for mechanizing or programming the mind are also indicated, together with two other corollaries of Gödel’s theorems: that we cannot prove that we are consistent, and that we cannot fully describe our notion of a natural number. (shrink)

J. R. Lucas serves warning that he stands ready to refute any sufficiently specific accusation that he is a machine. let any mechanist say, to his face, that he is some particular machine M; Lucas will respond by producing forthwith a suitable Gödel sentence ϕM. Having produced ϕM, he will then argue that — given certain credible premises about himself — he could not have done so if the accusation that he was M had been true. let the mechanist try (...) again; Lucas will counter him again in the same way. It is not possible to accuse Lucas truly of being a machine. (shrink)

J. R. Lucas argues in “Minds, Machines, and Gödel”, that his potential output of truths of arithmetic cannot be duplicated by any Turing machine, and a fortiori cannot be duplicated by any machine. Given any Turing machine that generates a sequence of truths of arithmetic, Lucas can produce as true some sentence of arithmetic that the machine will never generate. Therefore Lucas is no machine.

Mechanism is the thesis that men can be considered as machines, that there is no essential difference between minds and machines.John Lucas has argued that it is a consequence of Gödel's theorem that mechanism is false. Men cannot be considered as machines, because the intellectual capacities of men are superior to that of any machine. Lucas claims that we can do something that no machine can do-namely to produce as true the Gödel-formula of any given machine. But no machine can (...) prove its own Gödel-formula. (shrink)