Article Title：The scope of Turing's analysis of effective procedures
Abstract：
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: decision problem; effective procedure; epistemic procedure; philosophy of computation; Turing machine
DOI: 10.1023/A:1015638814511
Source：MINDS AND MACHINES
Welcome to correct the error, please contact email: humanisticspider@gmail.com
