David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Ezio Di Nucci
Jack Alan Reynolds
Learn more about PhilPapers
Synthese 108 (3):379-89 (1996)
In this paper I discuss the topics of mechanism and algorithmicity. I emphasise that a characterisation of algorithmicity such as the Turing machine is iterative; and I argue that if the human mind can solve problems that no Turing machine can, the mind must depend on some non-iterative principle — in fact, Cantor's second principle of generation, a principle of the actual infinite rather than the potential infinite of Turing machines. But as there has been theorisation that all physical systems can be represented by Turing machines, I investigate claims that seem to contradict this: specifically, claims that there are noncomputable phenomena. One conclusion I reach is that if it is believed that the human mind is more than a Turing machine, a belief in a kind of Cartesian dualist gulf between the mental and the physical is concomitant
|Keywords||Infinite Metaphysics Mind Turing Machines|
|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
Roger Penrose (1989). The Emperor's New Mind. Oxford University Press.
Immanuel Kant (2007). Critique of Pure Reason. In Elizabeth Schmidt Radcliffe, Richard McCarty, Fritz Allhoff & Anand Vaidya (eds.), Philosophy and Phenomenological Research. Blackwell Pub. Ltd. 449-451.
Robert Geroch & James B. Hartle (1986). Computability and Physical Theories. Foundations of Physics 16 (6):533-550.
John Lucas (2003). Minds, Machines and Gödel. Etica E Politica 5 (1):1.
Citations of this work BETA
No citations found.
Similar books and articles
P. D. Welch (2000). Eventually Infinite Time Turing Machine Degrees: Infinite Time Decidable Reals. Journal of Symbolic Logic 65 (3):1193-1203.
Jack Copeland (1996). On Alan Turing's Anticipation of Connectionism. Synthese 108 (3):361-377.
B. Jack Copeland & Oron Shagrir (2011). Do Accelerating Turing Machines Compute the Uncomputable? Minds and Machines 21 (2):221-239.
Robert H. Kane (1966). Turing Machines and Mental Reports. Australasian Journal of Philosophy 44 (December):344-52.
Jack Copeland (1998). Turing's o-Machines, Searle, Penrose, and the Brain. Analysis 58 (2):128-138.
Jack Copeland (1997). The Broad Conception of Computation. American Behavioral Scientist 40 (6):690-716.
Justin Leiber (2006). Turing's Golden: How Well Turing's Work Stands Today. Philosophical Psychology 19 (1):13-46.
Y. Sato & T. Ikegami (2004). Undecidability in the Imitation Game. Minds and Machines 14 (2):133-43.
B. Jack Copeland (2002). Accelerating Turing Machines. Minds and Machines 12 (2):281-300.
Robert M. French (1990). Subcognition and the Limits of the Turing Test. Mind 99 (393):53-66.
Added to index2009-01-28
Total downloads82 ( #53,366 of 1,911,604 )
Recent downloads (6 months)6 ( #115,074 of 1,911,604 )
How can I increase my downloads?