Skip to main content Accessibility help
×
Home
  • Print publication year: 2014
  • Online publication date: June 2014

Musings on Turing's Thesis

Summary

I take Turing's thesis (equivalently, Church's thesis) to assert that those functions on the integers which can be computed by a human being following any fixed algorithm on pencil and paper can also be computed by a Turing machine algorithm (or alternately by a lambda calculus algorithm). This thesis can be formulated using any of the many definitions of algorithm developed in the past eighty years which compute the same functions of integers. This has often been implicitly replaced by what I would call the physical version of Turing's thesis. This asserts that those functions on the integers which can be computed on any physical machine can be computed by a Turing algorithm. If the brain is regarded as a physical machine, this version subsumes the first version. But not everyone regards the brain as entirely physical (“Mathematics is a free creation of the human mind”—Brouwer). So we separate these formulations.

The meaning of Turing's thesis depends on determining what algorithms are possible, deciding whether algorithms should be defined to allow unbounded search using potentially infinite time and space, and what algorithms the brain can execute. The meaning of the physical Turing thesis depends in addition on determining what can be manufactured in the physical world. Neither the capabilities of the brain nor the capabilities of physical materials have been or are likely to be characterized by science. These questions have an intuitive, informal, and inexhaustibly open character.

[1] W., Ackermann, Zum Hilbertschen Aufbau der reellen Zahlen, Mathematische Annalen, vol. 99 (1923), pp. 118-133.
[2] P. J., Antsaklis and A., Nerode, Hybrid control systems, IEEE Transactions on Automatic Control, vol. 43 (1998), no. 4.
[3] M., Davis, The undecidable: Basic papers on undecidable propositions, unsolvable problems and computable functions, Raven Press, New York, 1965.
[4] J. M., Davoren and A., Nerode, Logics for hybrid systems, Proceedings of the IEEE, vol. 88 (2000), no. 7, pp. 985-1010.
[5] Solomon, Feferman et al.(editors), K. Gödel: Collected works, vol. 3, Oxford University Press, USA, 1986–.
[6] Jens Erik, Fenstad (editor), T. Skolem: Selected works in logic, Universitetsforlaget, Oslo, 1970.
[7] D., Hilbert, Gesammelte Abhandlungen, Chelsea Publishing Company, 1981.
[8] S. C., Kleene, Introduction to metamathematics, Van Nostrand, New York, 1952.
[9] W., Kohn, V., Brayman, and A., Nerode, Control synthesis in hybrid systems with Finsler dynamics, Houston Journal of Mathematics, vol. 28 (2002), no. 2, pp. 353-375, (issue dedicated to S. S. Chern).
[10] W., Kohn, A., Nerode, and J.B., Remmel, Hybrid systems as Finsler manifolds: Finite state control as approximation to connections, Hybrid systems II, Springer, 1995.
[11] A. H., Taub (editor), J. Von Neumann: Collected works, 19611963.
[12] A. M., Turing, Pure Mathematics: with a Section on Turing's Statistical Work by I. J. Good, (J.L., Britton, editor), North-Holland, Amsterdam, 1992.
[13] J., van Heijenoort, From Frege to Gödel, Harvard University Press, 1967.
[14] R., Zach, The practice of finitism: Epsilon calculus and consistency proofs in Hilbert's Program, Synthese, vol. 137 (2003), pp. 211-259.