A note on applicability of the incompleteness theorem to human mind

From MaRDI portal
(Redirected from Publication:1295425)





The author reviews Lucas' argument on an application of incompleteness theorems to show that machines can never think (of course, there are numerous counterarguments, too) and Penrose's neoclassical extension of Lucas' thesis (with its numerous countercounter arguments). Recall that many logicians hold that Gödel's theorems are not relevant to the question of the realization of intelligent machines, anymore than mathematics is relevant to the physical world! He states that in mathematics, people make ``a lot of mistakes, but these are correctable, in principle. The author's basic approach is to present relations between reflection principles (in the sense of G. Kreisel and A. Levy) and consistency.











This page was built for publication: A note on applicability of the incompleteness theorem to human mind

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1295425)