Minds and Machines 12 (2):203-220 (2002)
Turing's (1936) analysis of effective symbolic procedures is a model of conceptual clarity that plays an essential role in the philosophy of mathematics. Yet appeal is often made to the effectiveness of human procedures in other areas of philosophy. This paper addresses the question of whether Turing's analysis can be applied to a broader class of effective human procedures. We use Sieg's (1994) presentation of Turing's Thesis to argue against Cleland's (1995) objections to Turing machines and we evaluate her proposal to understand the effectiveness of procedures in terms of their reliability and precision. A number of conditions for effectiveness are identified and these are used to provide a general argument against the possibility of a Leibnizian decision procedure.
|Keywords||Turing machine decision problem effective procedure epistemic procedure philosophy of computation|
|Categories||categorize this paper)|
References found in this work BETA
No references found.
Citations of this work BETA
Concrete Digital Computation: What Does It Take for a Physical System to Compute? [REVIEW]Nir Fresco - 2011 - Journal of Logic, Language and Information 20 (4):513-537.
Similar books and articles
The Church-Turing Thesis.B. Jack Copeland - 2008 - In Edward N. Zalta (ed.), The Stanford Encyclopedia of Philosophy. The Metaphysics Research Lab, Stanford University.
Thinking Machines: Some Fundamental Confusions. [REVIEW]John T. Kearns - 1997 - Minds and Machines 7 (2):269-87.
Reflections on Gödel's and Gandy's Reflections on Turing's Thesis.David Israel - 2002 - Minds and Machines 12 (2):181-201.
Effective Procedures and Computable Functions.Carol E. Cleland - 1995 - Minds and Machines 5 (1):9-23.
The Church-Turing Thesis and Effective Mundane Procedures.Leon Horsten - 1995 - Minds and Machines 5 (1):1-8.
Added to index2009-01-28
Total downloads36 ( #143,668 of 2,172,604 )
Recent downloads (6 months)1 ( #325,028 of 2,172,604 )
How can I increase my downloads?