Church's thesis asserts that a number-theoretic function is intuitively computable if and only if it is recursive. A related thesis asserts that Turing's work yields a conceptual analysis of the intuitive notion of numerical computability. I endorse Church's thesis, but I argue against the related thesis. I argue that purported conceptual analyses based upon Turing's work involve a subtle but persistent circularity. Turing machines manipulate syntactic entities. To specify which number-theoretic function a Turing machine computes, we must correlate these syntactic entities with numbers. I argue that, in providing this correlation, we must demand that the correlation itself be computable. Otherwise, the Turing machine will compute uncomputable functions. But if we presuppose the intuitive notion of a computable relation between syntactic entities and numbers, then our analysis of computability is circular.
References
[1] Boolos, G., and R. C. Jeffrey, Computability and Logic, 2d edition, Cambridge University Press, Cambridge, 1980. MR603622 0708.03001[1] Boolos, G., and R. C. Jeffrey, Computability and Logic, 2d edition, Cambridge University Press, Cambridge, 1980. MR603622 0708.03001
[4] Frege, G., "Function and concept", pp. 130--48 in The Frege Reader, edited by M. Beaney, translated by P. Geach, Blackwell, Malden, 1997. 0967.01008[4] Frege, G., "Function and concept", pp. 130--48 in The Frege Reader, edited by M. Beaney, translated by P. Geach, Blackwell, Malden, 1997. 0967.01008
[5] Gandy, R., "Church's thesis and principles for mechanisms", pp. 123--48 in The Kleene Symposium (Proceedings of the Symposium, University of Wisconsin, Madison, 1978), edited by J. Barwise, H. J. Keisler, and K. Kunen, vol. 101 of Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1980. MR591879 0465.03022[5] Gandy, R., "Church's thesis and principles for mechanisms", pp. 123--48 in The Kleene Symposium (Proceedings of the Symposium, University of Wisconsin, Madison, 1978), edited by J. Barwise, H. J. Keisler, and K. Kunen, vol. 101 of Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1980. MR591879 0465.03022
[6] Gandy, R., "The confluence of ideas in 1936", pp. 55--111 in The Universal Turing Machine: A Half-Century Survey, edited by R. Herken, Oxford Science Publications, Oxford University Press, New York, 1988. MR1011468 0689.01010[6] Gandy, R., "The confluence of ideas in 1936", pp. 55--111 in The Universal Turing Machine: A Half-Century Survey, edited by R. Herken, Oxford Science Publications, Oxford University Press, New York, 1988. MR1011468 0689.01010
[7] Gödel, K., "On formally undecidable propositions of Principia Mathematica and related systems. I", pp. 145--95 in Collected Works. Vol. I. Publications 1929--1936, edited by S. Feferman et al., translated by J. van Heijenoort, The Clarendon Press, New York, 1986. MR831941 0592.01035[7] Gödel, K., "On formally undecidable propositions of Principia Mathematica and related systems. I", pp. 145--95 in Collected Works. Vol. I. Publications 1929--1936, edited by S. Feferman et al., translated by J. van Heijenoort, The Clarendon Press, New York, 1986. MR831941 0592.01035
[8] Gödel, K., "On undecidable propositions of formal mathematical systems", pp. 346--71 in Collected Works. Vol. I. Publications 1929--1936, edited by S. Feferman et al., translated by J. van Heijenoort, The Clarendon Press, New York, 1986. MR831941 0592.01035[8] Gödel, K., "On undecidable propositions of formal mathematical systems", pp. 346--71 in Collected Works. Vol. I. Publications 1929--1936, edited by S. Feferman et al., translated by J. van Heijenoort, The Clarendon Press, New York, 1986. MR831941 0592.01035
[9] Kleene, S. C., "Turing's analysis of computability, and major applications of it", pp. 17--54 in The Universal Turing Machine: A Half-Century Survey, edited by R. Herken, Oxford Science Publications, Oxford University Press, New York, 1988. MR1011467 0655.03027[9] Kleene, S. C., "Turing's analysis of computability, and major applications of it", pp. 17--54 in The Universal Turing Machine: A Half-Century Survey, edited by R. Herken, Oxford Science Publications, Oxford University Press, New York, 1988. MR1011467 0655.03027
[10] Machtey, M., and P. Young, An Introduction to the General Theory of Algorithms, North-Holland, New York, 1978. Computer Science Library-Theory of Computation Series. MR483344 0376.68027[10] Machtey, M., and P. Young, An Introduction to the General Theory of Algorithms, North-Holland, New York, 1978. Computer Science Library-Theory of Computation Series. MR483344 0376.68027
[11] Martin-Löf, P., Intuitionistic Type Theory, vol. 1 of Studies in Proof Theory. Lecture Notes, Bibliopolis, Naples, 1984. Notes by Giovanni Sambin. MR769301 0571.03030[11] Martin-Löf, P., Intuitionistic Type Theory, vol. 1 of Studies in Proof Theory. Lecture Notes, Bibliopolis, Naples, 1984. Notes by Giovanni Sambin. MR769301 0571.03030
[12] Parsons, C., "Mathematical intuition", Proceedings of the Aristotelian Society, vol. 80 (1980), pp. 145--68. 0840.00006[12] Parsons, C., "Mathematical intuition", Proceedings of the Aristotelian Society, vol. 80 (1980), pp. 145--68. 0840.00006
[13] Parsons, C., "Intuition and number", pp. 141--57 in Mathematics and Mind (Amherst, MA, 1991), edited by A. George, Logic and Computation in Philosophy, Oxford University Press, New York, 1994. MR1373896 0807.00011[13] Parsons, C., "Intuition and number", pp. 141--57 in Mathematics and Mind (Amherst, MA, 1991), edited by A. George, Logic and Computation in Philosophy, Oxford University Press, New York, 1994. MR1373896 0807.00011
[14] Parsons, C., ``What can we do `in principle'?'' pp. 335--54 in Logic and Scientific Methods (Florence, 1995), edited by M. L. Dalla Chiara, K. Doets, D. Mundici, and J. van Benthem, vol. 259 of Synthese Library, Kluwer Academic Publishers, Dordrecht, 1997. MR1797115 0913.03006[14] Parsons, C., ``What can we do `in principle'?'' pp. 335--54 in Logic and Scientific Methods (Florence, 1995), edited by M. L. Dalla Chiara, K. Doets, D. Mundici, and J. van Benthem, vol. 259 of Synthese Library, Kluwer Academic Publishers, Dordrecht, 1997. MR1797115 0913.03006
[15] Post, E., "Absolutely unsolvable problems and relatively undecidable propositions account of an anticipation", pp. 338--433 in The Undecidable. Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions, edited by M. Davis, Dover Publications Inc., Mineola, 2004. Corrected reprint of the 1965 original (Raven Press, Hewlett; MR0189996). MR2070909 1099.03002[15] Post, E., "Absolutely unsolvable problems and relatively undecidable propositions account of an anticipation", pp. 338--433 in The Undecidable. Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions, edited by M. Davis, Dover Publications Inc., Mineola, 2004. Corrected reprint of the 1965 original (Raven Press, Hewlett; MR0189996). MR2070909 1099.03002
[16] Quine, W. V. O., Word and Object, Studies in Communication. The Technology Press, Cambridge, 1960. MR0111674 0093.00915[16] Quine, W. V. O., Word and Object, Studies in Communication. The Technology Press, Cambridge, 1960. MR0111674 0093.00915
[18] Shapiro, S., "Acceptable notation", Notre Dame Journal of Formal Logic, vol. 23 (1982), pp. 14--20. MR634739 0452.68055 10.1305/ndjfl/1093883561 euclid.ndjfl/1093883561
[18] Shapiro, S., "Acceptable notation", Notre Dame Journal of Formal Logic, vol. 23 (1982), pp. 14--20. MR634739 0452.68055 10.1305/ndjfl/1093883561 euclid.ndjfl/1093883561
[19] Sieg, W., "Mechanical procedures and mathematical experience", pp. 71--117 in Mathematics and Mind (Amherst, MA, 1991), edited by A. George, Logic and Computation in Philosophy, Oxford University Press, New York, 1994. MR1373894 0816.03001[19] Sieg, W., "Mechanical procedures and mathematical experience", pp. 71--117 in Mathematics and Mind (Amherst, MA, 1991), edited by A. George, Logic and Computation in Philosophy, Oxford University Press, New York, 1994. MR1373894 0816.03001
[20] Sieg, W., "Calculations by man and machine: Conceptual analysis", pp. 390--409 in Reflections on the Foundations of Mathematics. Essays in Honor of Solomon Feferman (Stanford, CA, 1998), edited by W. Sieg, R. Sommer, and C. Talcott, vol. 15 of Lecture Notes in Logic, Association for Symbolic Logic, Natick, 2002. MR1943317 1014.03009[20] Sieg, W., "Calculations by man and machine: Conceptual analysis", pp. 390--409 in Reflections on the Foundations of Mathematics. Essays in Honor of Solomon Feferman (Stanford, CA, 1998), edited by W. Sieg, R. Sommer, and C. Talcott, vol. 15 of Lecture Notes in Logic, Association for Symbolic Logic, Natick, 2002. MR1943317 1014.03009
[21] Sieg, W., and J. Byrnes, "$K$"-graph machines: Generalizing Turing's machines and arguments", pp. 98--119 in Gödel '96 (Brno, 1996), edited by P. Hájek, vol. 6 of Lecture Notes in Logic, Springer, Berlin, 1996. MR1441105 0856.03032[21] Sieg, W., and J. Byrnes, "$K$"-graph machines: Generalizing Turing's machines and arguments", pp. 98--119 in Gödel '96 (Brno, 1996), edited by P. Hájek, vol. 6 of Lecture Notes in Logic, Springer, Berlin, 1996. MR1441105 0856.03032
[22] Sieg, W., and J. Byrnes, "Gödel, Turing, and $K$"-graph machines, pp. 57--66 in Logic and Foundations of Mathematics (Florence, 1995), edited by A. Cantini, E. Casari, and P. Minari, vol. 280 of Synthese Library, Kluwer Academic Publishers, Dordrecht, 1999. MR1739858 0949.03034[22] Sieg, W., and J. Byrnes, "Gödel, Turing, and $K$"-graph machines, pp. 57--66 in Logic and Foundations of Mathematics (Florence, 1995), edited by A. Cantini, E. Casari, and P. Minari, vol. 280 of Synthese Library, Kluwer Academic Publishers, Dordrecht, 1999. MR1739858 0949.03034
[23] Soare, R. I., Recursively Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets, Perspectives in Mathematical Logic. Springer-Verlag, Berlin, 1987. MR882921 0623.03042 0667.03030[23] Soare, R. I., Recursively Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets, Perspectives in Mathematical Logic. Springer-Verlag, Berlin, 1987. MR882921 0623.03042 0667.03030
[24] Soare, R. I., "Computability and recursion", The Bulletin of Symbolic Logic, vol. 2 (1996), pp. 284--321. MR1416870 0861.03031 10.2307/420992 euclid.bsl/1182353451
[24] Soare, R. I., "Computability and recursion", The Bulletin of Symbolic Logic, vol. 2 (1996), pp. 284--321. MR1416870 0861.03031 10.2307/420992 euclid.bsl/1182353451
[25] Turing, A., "On the computable numbers, with an application to the Entscheidungsproblem", pp. 116--54 in The Undecidable. Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions, edited by M. Davis, Dover Publications Inc., Mineola, 2004. Corrected reprint of the 1965 original (Raven Press, Hewlett; MR0189996). MR2070909 1099.03002[25] Turing, A., "On the computable numbers, with an application to the Entscheidungsproblem", pp. 116--54 in The Undecidable. Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions, edited by M. Davis, Dover Publications Inc., Mineola, 2004. Corrected reprint of the 1965 original (Raven Press, Hewlett; MR0189996). MR2070909 1099.03002
