David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Minds and Machines 12 (2):159-179 (2002)
Since the mid-twentieth century, the concept of the Turing machine has dominated thought about effective procedures. This paper presents an alternative to Turing's analysis; it unifies, refines, and extends my earlier work on this topic. I show that Turing machines cannot live up to their billing as paragons of effective procedure; at best, they may be said to provide us with mere procedure schemas. I argue that the concept of an effective procedure crucially depends upon distinguishing procedures as definite courses of action(- types) from the particular courses of action(-tokens) that actually instantiate them and the causal processes and/or interpretations that ultimately make them effective. On my analysis, effectiveness is not just a matter of logical form; `content' matters. The analysis I provide has the advantage of applying to ordinary, everyday procedures such as recipes and methods, as well as the more refined procedures of mathematics and computer science. It also has the virtue of making better sense of the physical possibilities for hypercomputation than the received view and its extensions, e.g. Turing's o-machines, accelerating machines.
|Keywords||Turing machine causal process effective procedure hypercomputation precisely described instruction procedure schema quotidian procedure|
|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
Peter Godfrey-Smith (2009). Triviality Arguments Against Functionalism. Philosophical Studies 145 (2):273 - 295.
Oron Shagrir (2012). Computation, Implementation, Cognition. Minds and Machines 22 (2):137-148.
Pavel Materna (2009). Concepts and Recipes. Acta Analytica 24 (1):69-90.
Similar books and articles
Tim Button (2009). Hyperloops Do Not Threaten the Notion of an Effective Procedure. Lecture Notes in Computer Science 5635:68-78.
Jeremy Seligman (2002). The Scope of Turing's Analysis of Effective Procedures. Minds and Machines 12 (2):203-220.
Carol E. Cleland (1995). Effective Procedures and Computable Functions. Minds and Machines 5 (1):9-23.
Carol E. Cleland (1993). Is the Church-Turing Thesis True? Minds and Machines 3 (3):283-312.
Carol E. Cleland (2001). Recipes, Algorithms, and Programs. Minds and Machines 11 (2):219-237.
B. Jack Copeland (2002). Accelerating Turing Machines. Minds and Machines 12 (2):281-300.
John T. Kearns (1997). Thinking Machines: Some Fundamental Confusions. [REVIEW] Minds and Machines 7 (2):269-87.
David Israel (2002). Reflections on Gödel's and Gandy's Reflections on Turing's Thesis. Minds and Machines 12 (2):181-201.
Oron Shagrir (2002). Effective Computation by Humans and Machines. Minds and Machines 12 (2):221-240.
Leon Horsten (1995). The Church-Turing Thesis and Effective Mundane Procedures. Minds and Machines 5 (1):1-8.
Added to index2009-01-28
Total downloads34 ( #59,445 of 1,410,123 )
Recent downloads (6 months)4 ( #57,890 of 1,410,123 )
How can I increase my downloads?