David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Etica E Politica 5 (1):1 (2003)
In this paper Lucas suggests that many of his critics have not read carefully neither his exposition nor Penrose’s one, so they seek to refute arguments they never proposed. Therefore he offers a brief history of the Gödelian argument put forward by Gödel, Penrose and Lucas itself: Gödel argued indeed that either mathematics is incompletable – that is axioms can never be comprised in a finite rule and so human mind surpasses the power of any finite machine – or there exist absolutely unsolvable diophantine problems, and he suggest that the second disjunct is untenable; on the other side, Penrose proposed an argument similar to Lucas’ one but making use of Turing’s theorem. Finally Lucas exposes again his argument and considers some of the most important objections to it
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
No references found.
Citations of this work BETA
Jason L. Megill, Tim Melvin & Alex Beal (2014). On Some Properties of Humanly Known and Humanly Knowable Mathematics. Axiomathes 24 (1):81-88.
Jon Cogburn & Jason Megill (2010). Are Turing Machines Platonists? Inferentialism and the Computational Theory of Mind. Minds and Machines 20 (3):423-439.
Similar books and articles
Alexander R. Pruss (2009). A Gödelian Ontological Argument Improved. Religious Studies 45 (3):347-353.
William Seager (2003). Yesterday's Algorithm. Croatian Journal of Philosophy 3 (3):265-273.
William E. Seager (2003). Yesterday's Algorithm: Penrose and the Godel Argument. Croatian Journal of Philosophy 3 (9):265-273.
Per Lindström (2001). Penrose's New Argument. Journal of Philosophical Logic 30 (3):241-250.
J. J. C. Smart (1961). Godel's Theorem, Church's Theorem, and Mechanism. Synthese 13 (June):105-10.
Taner Edis (1998). How Godel's Theorem Supports the Possibility of Machine Intelligence. Minds and Machines 8 (2):251-262.
Q. Yu (1992). Consistency, Mechanicalness, and the Logic of the Mind. Synthese 90 (1):145-79.
Panu Raatikainen (2002). McCall's Gödelian Argument is Invalid. Facta Philosophica 4 (1):167-69.
Added to index2009-01-28
Total downloads82 ( #35,699 of 1,724,747 )
Recent downloads (6 months)8 ( #81,198 of 1,724,747 )
How can I increase my downloads?