Skip to main content
Log in

Thinking Machines: Some Fundamental Confusions

  • Published:
Minds and Machines Aims and scope Submit manuscript

Abstract

This paper explores Church's Thesis and related claims madeby Turing. Church's Thesis concerns computable numerical functions, whileTuring's claims concern both procedures for manipulating uninterpreted marksand machines that generate the results that these procedures would yield. Itis argued that Turing's claims are true, and that they support (the truth of)Church's Thesis. It is further argued that the truth of Turing's and Church'sTheses has no interesting consequences for human cognition or cognitiveabilities. The Theses don't even mean that computers can do as much as peoplecan when it comes to carrying out effective procedures. For carrying out aprocedure is a purposive, intentional activity. No actual machine does, orcan do, as much.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Church, Alonzo (1936), ‘An Unsolvable Problem of Elementary Number Theory,’ American Journal of Mathematics 58, pp. 345–363. Reprinted in Davis 1965.

    Google Scholar 

  • Curry, Haskell B. and Robert Feys (1958), Combinatory Logic, vol 1. Amsterdam: North-Holland Publishing Company.

    Google Scholar 

  • Davis, Martin (1965), The Undecidable. Hewlett, New York: Raven Press.

    Google Scholar 

  • Gandy, Robin (1980), ‘Church's Thesis and Principles for Mechanisms,’ The Kleene Symposium, edited by Jon Barwise, H. Jerome Keisler, Kenneth Kunen. Amsterdam: North-Holland Publishing Company, 123–148.

    Google Scholar 

  • Kearns, John T. (1969), ‘Combinatory Logic with Discriminators,’ The Journal of Symbolic Logic 34, pp. 561–575.

    Google Scholar 

  • Kearns, John T. (1996), Reconceiving Experience, A Solution to a Problem Inherited from Descartes. Albany, N.Y.: State University of New York Press.

    Google Scholar 

  • Kleene, Stephen C. (1987), ‘Reflection on Church's Thesis,’ Notre Dame Journal of Formal Logic 28, pp. 490–498.

    Google Scholar 

  • Kreisel, Georg (1987), ‘Church's Thesis and the Ideal of Informal Rigor,’ Notre Dame Journal of Formal Logic 28 pp. 499–519.

    Google Scholar 

  • Nelson, R. J. (1987), ‘Church's Thesis and Cognitive Science,’ Notre Dame Journal of Formal Logic 28, pp. 581–614.

    Google Scholar 

  • Shanker, S. G. (1987), ‘Wittgenstein versus Turing on the Nature of Church's Thesis,’ Notre Dame Journal of Formal Logic 28, pp. 615–649.

    Google Scholar 

  • Shapiro, Stewart (1980), ‘On the Notion of Effectiveness,’ History and Philosophy of Logic I, pp. 209–230.

    Google Scholar 

  • Shapiro, Stewart (1981), ‘Understanding Church's Thesis,’ Journal of Philosophical Logic 10, pp. 353–365.

    Google Scholar 

  • Turing, Alan (1937), ‘On Computable Numbers,’ with an Application to the Entscheidungsproblem,’ Proceedings of the London Mathematical Society s. 2, vol 42, 230–265. Reprinted in Davis (1965), 115–154.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kearns, J.T. Thinking Machines: Some Fundamental Confusions. Minds and Machines 7, 269–287 (1997). https://doi.org/10.1023/A:1008202117814

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008202117814

Navigation