Effective Computation by Humans and Machines
 Oron Shagrir
 … show all 1 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
There is an intensive discussion nowadays about the meaning of effective computability, with implications to the status and provability of the Church–Turing Thesis (CTT). I begin by reviewing what has become the dominant account of the way Turing and Church viewed, in 1936, effective computability. According to this account, to which I refer as the Gandy–Sieg account, Turing and Church aimed to characterize the functions that can be computed by a human computer. In addition, Turing provided a highly convincing argument for CTT by analyzing the processes carried out by a human computer. I then contend that if the Gandy–Sieg account is correct, then the notion of effective computability has changed after 1936. Today computer scientists view effective computability in terms of finite machine computation. My contention is supported by the current formulations of CTT, which always refer to machine computation, and by the current argumentation for CTT, which is different from the main arguments advanced by Turing and Church. I finally turn to discuss Robin Gandy's characterization of machine computation. I suggest that there is an ambiguity regarding the types of machines Gandy was postulating. I offer three interpretations, which differ in their scope and limitations, and conclude that none provides the basis for claiming that Gandy characterized finite machine computation.
 Astrachan, O.L. (2000) A Computer Science Tapestry: Exploring Programming and Computer Science. McGrawHill, US
 Boolos, G.S., Jeffrey, R.C. (1989) Computability and Logic. Cambridge University Press, Cambridge
 Church, A. (1936) An Unsolvable Problem of Elementary Number Theory. American Journal of Mathernatics 58: pp. 345363
 Church, A. (1936) A Note on the Entscheidungsproblem. Journal of Symbolic Logic 1: pp. 4041
 Church, A. (1937) Review of Turing (1936). Journal of Symbolic Logic 2: pp. 4243
 Church, A. (1937) Review of Post (1936). Journal of Symbolic Logic 2: pp. 43
 Cleland, C. (1993) Is the Church–Turing Thesis True?. Minds and Machines 3: pp. 283312
 Cleland, C. (forthcoming), 'Effective Procedures and Causal Processes', Minds and Machines.
 Copeland, B.J. (1996), The Church–Turing Thesis', in J. Perry and E. Zalta, eds., The Stanford Encyclopedia of Philosophy. [http://plato.stanford.edu]
 Davis, M. eds. (1965) The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions. Raven, NewYork
 Deutsch, D. (1985) Quantum Theory: The Church–Turing Principle and the Universal Quantum Computer. Proceedings of the Royal Society of London A 400: pp. 97117
 Gandy, R.O. Church's Thesis and Principles of Mechanisms. In: Barwise, J., Keisler, J.J., Kunen, K. eds. (1980) The Kleene Symposium. NorthHolland, Amsterdam, pp. 123145
 Gandy, R.O. (1988), 'The Confluence of Ideas in 1936', in Herken, pp. 55–111.
 Gödel, K. (1931) On Formally Undecidable Propositions of Principia Mathematica and Related Systems I. Monatshefte für Mathematik und Physik 38: pp. 173198
 Gödel, K. (1946), 'Remarks Before the Princeton Bicentennial Conference on Problems in Mathematics'. Reprinted in Davis (1965), pp. 84–88.
 Harel, D. (1992) Algorithms: The Spirit of Computing. AddisonWesley, Reading, MA
 Herken, R.(ed.) (1988). The Universal Turing Machine A HalfCentury Survey, Oxford: Oxford University Press.
 Hilbert, D., Ackermann, W. (1928) Grundzuge der Theoretischen Logic. SpringerVerlag, Berlin
 Hilbert, D., Bernays, P. (1939) Grundlagen der Mathematik II. SpringerVerlag, Berlin
 Hogarth, M.L. (1994) NonTuring Computers and NonTuring Computability. Proceedings of the Philosophy of Science Association (PSA) 1: pp. 126138
 Hopcroft, J.C., Ullman, J.D. (1979) Introduction to Automata Theory, Languages and Computation. AddisonWesley, Reading, MA
 Kleene, S.C. (1936) General Recursive Functions of Natural Numbers. Mathematische Annalen 112: pp. 727742
 Kleene, S.C. (1988), 'Turing's Analysis of Computability, and Major Applications of It',' in Herken, pp. 17–54.
 Lewis, H.R., Papadimitriou, C.H. (1981) Elements of the Theory of Computation. PrenticeHall, Eaglewood Cliffs, NJ
 Mancosu, P. (1999) Between Russell and Hilbert: Behmann on the Foundations of Mathematics. Bulletin of Symbolic Logic 5: pp. 303330
 Nagin, P., Impagliazzo, J. (1995) Computer Science: A BreadthFirst Approach with Pascal. John Wiley & Sons, New York
 Pitowsky, I. (1990) The Physical Church Thesis and Physical Computational Complexity. Iyyun 39: pp. 8199
 Post, E.L. (1936) Finitary Combinatory Processes – Formulation I. Journal of Symbolic Logic 1: pp. 103105
 Shagrir, O. (1992) A Neural Net with SelfInhibiting Units for the NQueens Problem. International Journal of Neural Systems 3: pp. 249252
 Shagrir, O. (1997) Two Dogmas of Computationalism. Minds and Machines 7: pp. 321344
 Shagrir, O. and Pitowsky, I. (forthcoming), 'Physical Hypercomputation and the Church–Turing Thesis', Minds and Machines.
 Shepherdson, J.C. (1988), 'Mechanisms for Computing Over Arbitratry Structures', in Herken, pp. 537–555.
 Sieg, W. Mechanical Procedures and Mathematical Experience. In: George, A. eds. (1994) Mathematics and Mind. Oxford University Press, Oxford, pp. 71117
 Sieg, W. (1997) Step by Recursive Step: Church's Analysis of Effective Calculability. Bulletin of Symbolic Logic 2: pp. 154180
 Sieg, W. (2001), 'Calculation by Man and Machine: Conceptual Analysis', in W. Sieg, R. Sommer and C. Talcott, eds., Reflections on the Foundations of Mathematics (Essays in Honor of Solomon Feferman), Volume 15 of Lectures Notes in Logic, Association of Symbolic Logic, pp. 387–406.
 Sieg,W. (forthcoming), 'Calculation byMan andMachine: Mathematical Presentation', Proceedings of the International Congress of Logic, Methodology and Philosophy of Science (Cracow, 1999), Kluwer, pp. 246–260.
 Sieg, W., Byrnes, J. (1999) An Abstract Model for Parallel Computations: Gandy's Thesis. The Monist 82: pp. 150164
 Siegelmann, H.T. (1995) Computation Beyond Turing Limit. Science 268: pp. 545548
 Turing, A.M. (1936) On Computable Numbers, with an Application to the Entscheidungsproblem. Proceedings of the London Mathematical Society 2: pp. 230265
 Wolfarm, S. (1985) Undecidability and Intractability in Theoretical Physics. Physical Review Letters 54: pp. 735738
 Title
 Effective Computation by Humans and Machines
 Journal

Minds and Machines
Volume 12, Issue 2 , pp 221240
 Cover Date
 20020501
 DOI
 10.1023/A:1015694932257
 Print ISSN
 09246495
 Online ISSN
 15728641
 Publisher
 Kluwer Academic Publishers
 Additional Links
 Topics
 Keywords

 effective computability
 Gandy machines
 human computation
 machine computation
 physical computation
 The Church–Turing Thesis
 Authors

 Oron Shagrir ^{(1)}
 Author Affiliations

 1. Department of Philosophy, The Hebrew University of Jerusalem, Jerusalem, 91905, Israel