Recipes, algorithms, and programs

Minds and Machines 11 (2):219-237 (2001)
  Copy   BIBTEX

Abstract

  In the technical literature of computer science, the concept of an effective procedure is closely associated with the notion of an instruction that precisely specifies an action. Turing machine instructions are held up as providing paragons of instructions that "precisely describe" or "well define" the actions they prescribe. Numerical algorithms and computer programs are judged effective just insofar as they are thought to be translatable into Turing machine programs. Nontechnical procedures (e.g., recipes, methods) are summarily dismissed as ineffective on the grounds that their instructions lack the requisite precision. But despite the pivotal role played by the notion of a precisely specified instruction in classifying procedures as effective and ineffective, little attention has been paid to the manner in which instructions "precisely specify" the actions they prescribe. It is the purpose of this paper to remedy this defect. The results are startling. The reputed exemplary precision of Turing machine instructions turns out to be a myth. Indeed, the most precise specifications of action are provided not by the procedures of theoretical computer science and mathematics (algorithms) but rather by the nontechnical procedures of everyday life. I close with a discussion of some of the rumifications of these conclusions for understanding and designing concrete computers and their programming languages

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,296

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

On effective procedures.Carol E. Cleland - 2002 - Minds and Machines 12 (2):159-179.
Is the church-Turing thesis true?Carol E. Cleland - 1993 - Minds and Machines 3 (3):283-312.
Accelerating Turing machines.B. Jack Copeland - 2002 - Minds and Machines 12 (2):281-300.
Effective Computation by Humans and Machines.Shagrir Oron - 2002 - Minds and Machines 12 (2):221-240.
Alan Turing and the mathematical objection.Gualtiero Piccinini - 2003 - Minds and Machines 13 (1):23-48.
Logically possible machines.Eric Steinhart - 2002 - Minds and Machines 12 (2):259-280.

Analytics

Added to PP
2009-01-28

Downloads
36 (#458,158)

6 months
603 (#2,252)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Carol Cleland
University of Colorado, Boulder

Citations of this work

What an Algorithm Is.Robin K. Hill - 2016 - Philosophy and Technology 29 (1):35-59.
Hypercomputation and the Physical Church‐Turing Thesis.Paolo Cotogno - 2003 - British Journal for the Philosophy of Science 54 (2):181-223.
On effective procedures.Carol E. Cleland - 2002 - Minds and Machines 12 (2):159-179.
Why Do We Need a Theory of Implementation?André Curtis-Trudel - 2022 - British Journal for the Philosophy of Science 73 (4):1067-1091.
Problems for a Philosophy of Software Engineering.Stefan Gruner - 2011 - Minds and Machines 21 (2):275-299.

View all 11 citations / Add more citations

References found in this work

Fact, Fiction, and Forecast.Nelson Goodman - 1973 - Cambridge: Harvard University Press.
Wittgenstein on rules and private language.Saul A. Kripke - 1982 - Revue Philosophique de la France Et de l'Etranger 173 (4):496-499.
Fact, Fiction, and Forecast.Nelson Goodman - 1955 - Philosophy 31 (118):268-269.
Systems of logic based on ordinals..Alan Turing - 1939 - London,: Printed by C.F. Hodgson & son.
Is the church-Turing thesis true?Carol E. Cleland - 1993 - Minds and Machines 3 (3):283-312.

View all 10 references / Add more references