David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Minds and Machines 7 (3):321-44 (1997)
This paper challenges two orthodox theses: (a) that computational processes must be algorithmic; and (b) that all computed functions must be Turing-computable. Section 2 advances the claim that the works in computability theory, including Turing's analysis of the effective computable functions, do not substantiate the two theses. It is then shown (Section 3) that we can describe a system that computes a number-theoretic function which is not Turing-computable. The argument against the first thesis proceeds in two stages. It is first shown (Section 4) that whether a process is algorithmic depends on the way we describe the process. It is then argued (Section 5) that systems compute even if their processes are not described as algorithmic. The paper concludes with a suggestion for a semantic approach to computation
|Keywords||Algorithm Computationalism Science 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
No references found.
Citations of this work BETA
Gualtiero Piccinini (2008). Computation Without Representation. Philosophical Studies 137 (2):205-241.
Emiliano Boccardi (2009). Who's Driving the Syntactic Engine? Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 40 (1):23 - 50.
Achim Hoffmann (2010). Can Machines Think? An Old Question Reformulated. Minds and Machines 20 (2):203-212.
Similar books and articles
B. Jack Copeland & Oron Shagrir (2011). Do Accelerating Turing Machines Compute the Uncomputable? Minds and Machines 21 (2):221-239.
Marcin Miłkowski (2007). Is Computationalism Trivial? In Gordana Dodig Crnkovic & Susan Stuart (eds.), Computation, Information, Cognition: The Nexus and the Liminal. Cambridge Scholars Press
William J. Rapaport (1998). How Minds Can Be Computational Systems. Journal of Experimental and Theoretical Artificial Intelligence 10 (4):403-419.
Michael Rescorla (2007). Church's Thesis and the Conceptual Analysis of Computability. Notre Dame Journal of Formal Logic 48 (2):253-280.
Oron Shagrir & Itamar Pitowsky (2003). Physical Hypercomputation and the Church–Turing Thesis. Minds and Machines 13 (1):87-101.
Eli Dresner (2008). Turing-, Human- and Physical Computability: An Unasked Question. [REVIEW] Minds and Machines 18 (3):349-355.
Jack Copeland (1997). The Broad Conception of Computation. American Behavioral Scientist 40 (6):690-716.
Carol E. Cleland (1993). Is the Church-Turing Thesis True? Minds and Machines 3 (3):283-312.
Leon Horsten (1995). The Church-Turing Thesis and Effective Mundane Procedures. Minds and Machines 5 (1):1-8.
Added to index2009-01-28
Total downloads46 ( #67,939 of 1,707,766 )
Recent downloads (6 months)5 ( #127,926 of 1,707,766 )
How can I increase my downloads?