Minds and Machines 12 (2):159-179 (2002)

Authors
Carol Cleland
University of Colorado, Boulder
Abstract
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)
Reprint years 2004
DOI 10.1023/A:1015606528623
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 65,581
Through your library

References found in this work BETA

On Computable Numbers, with an Application to the N Tscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
The Basic Works of Aristotle. Aristotle - 1941 - New York, NY, USA: Random House.
Systems of Logic Based on Ordinals.Alan Mathison Turing - 1939 - London: Printed by C.F. Hodgson & Son.
The Basic Works of Aristotle. [REVIEW]E. A. M. - 1941 - Journal of Philosophy 38 (20):553-555.

View all 12 references / Add more references

Citations of this work BETA

Triviality Arguments Against Functionalism.Peter Godfrey-Smith - 2009 - Philosophical Studies 145 (2):273 - 295.
Against Structuralist Theories of Computational Implementation.Michael Rescorla - 2013 - British Journal for the Philosophy of Science 64 (4):681-707.
Computation, Implementation, Cognition.Oron Shagrir - 2012 - Minds and Machines 22 (2):137-148.

View all 12 citations / Add more citations

Similar books and articles

Hyperloops Do Not Threaten the Notion of an Effective Procedure.Tim Button - 2009 - Lecture Notes in Computer Science 5635:68-78.
Is the Church-Turing Thesis True?Carol E. Cleland - 1993 - Minds and Machines 3 (3):283-312.
Recipes, Algorithms, and Programs.Carol E. Cleland - 2001 - Minds and Machines 11 (2):219-237.
Accelerating Turing Machines.B. Jack Copeland - 2002 - Minds and Machines 12 (2):281-300.

Analytics

Added to PP index
2009-01-28

Total views
92 ( #120,290 of 2,461,424 )

Recent downloads (6 months)
2 ( #298,784 of 2,461,424 )

How can I increase my downloads?

Downloads

My notes