Advertisement

The Church-Turing Thesis: Consensus and Opposition

  • Martin Davis
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3988)

Abstract

Many years ago, I wrote [7]:

It is truly remarkable (Gödel ...speaks of a kind of miracle) that it has proved possible to give a precise mathematical characterization of the class of processes that can be carried out by purely machanical means. It is in fact the possibility of such a characterization that underlies the ubiquitous applicability of digital computers. In addition it has made it possible to prove the algorithmic unsolvability of important problems, has provided a key tool in mathematical logic, has made available an array of fundamental models in theoretical computer science, and has been the basis of a rich new branch of mathemtics.

A few years later I wrote [8]:

The subject ...is Alan Turing’s discovery of the universal (or all-purpose) digital computer as a mathematical abstraction. ...We will try to show how this very abstract work helped to lead Turing and John von Neumann to the modern concept of the electronic computer.

Keywords

Turing Machine Theoretical Computer Science Quantum Adiabatic Universal Machine Positive Integer Solution 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bringsjord, S., Zenzen, M.: Superminds: People Harness Hypercomputation, and More. In: Studies in Cognitive Systems, vol. 29, Kluwer, Dordrecht (2003)Google Scholar
  2. 2.
    Burgin, M.: Super-Recursive Algorithms. Springer, Heidelberg (2005)MATHGoogle Scholar
  3. 3.
    Burkes, A.W., Goldstine, H.H., von Neumann, J.: Preliminary Discussion of the Logical Design of an Electronic Computing Instrument. Institute for Advanced Study (1946); Reprinted: von Neumann, J.: Collected Works. Taub, A.H. (ed.), vol. 5. Pergamon Press, Oxford (1963)Google Scholar
  4. 4.
    Church, A.: Review of [23]. J. Symbolic Logic. 2, 42–43 (1937)Google Scholar
  5. 5.
    Davis, M.: Computability and Unsolvability. McGraw Hill, New York (1958) (Reprinted: Dover 1983)MATHGoogle Scholar
  6. 6.
    Davis, M. (ed.): The Undecidable. Raven Press (1965)(Reprinted: Dover 2004) Google Scholar
  7. 7.
    Davis, M.: Why Gödel Didn’t Have Church’s Thesis. Information and Control 54, 3–24 (1982)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Davis, M.: Mathematical Logic and the Origin of Modern Computers. In: Studies in the History of Mathematics. Mathematical Association of America, pp. 137–165 (1987); Reprinted In: Herken, R. (ed.) The Universal Turing Machine - A Half-Century Survey, Verlag Kemmerer & Unverzagt, Hamburg, Berlin, pp. 149–174. Oxford University Press, Oxford (1988)Google Scholar
  9. 9.
    Davis, M.: The Myth of Hypercomputation. In: Teuscher, C. (ed.) Alan Turing: Life and Legacy of a Great Thinker, pp. 195–212. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  10. 10.
    Davis, M.: Why There Is No Such Subject As Hypercomputation. In: Costa, J.F., Doria, F. (eds.) Applied Matheamtics and Computation. Special issue on hypercomputation (to appear, 2006)Google Scholar
  11. 11.
    Davis, M.: The Universal Computer: The Road from Leibniz to Turing. W.W. Norton (2000)Google Scholar
  12. 12.
    Davis, M.: Engines of Logic: Mathematicians and the Origin of the Computer. W.W. Norton (2001) (paperback edition of [11]) Google Scholar
  13. 13.
    Etesi, G., Nemeti, I.: Non-Turing Computations via Malament-Hogarth Spacetimes. International Journal of Theoretical Physics 41(2), 341–370 (2002)MathSciNetCrossRefMATHGoogle Scholar
  14. 14.
    Fisher, J., Faraboschi, P., Young, C.: Embedded Computing: A VLIW Approach to Architecture, Compilers and Tools. Elsevier, Amsterdam (2005)MATHGoogle Scholar
  15. 15.
    Gold, E.M.: Limiting Recursion. Journal of Symbolic Logic 30, 28–46 (1965)MathSciNetCrossRefMATHGoogle Scholar
  16. 16.
    Kieu, T.: Computing the noncomputable. Contemporary Physics 44, 51–77 (2003)CrossRefGoogle Scholar
  17. 17.
    Penrose, R.: The Emperor’s New Mind. Oxford (1989)Google Scholar
  18. 18.
    Penrose, R.: Shadows of the Mind: A Search for the Missing Science of Consciousness. Oxford (1994)Google Scholar
  19. 19.
    Putnam, H.: Trial and Error Predicates and the Solution to a Problem of Mostowski. Journal of Symbolic Logic 30, 49–57 (1965)MathSciNetCrossRefMATHGoogle Scholar
  20. 20.
    Schwartz, J.T.: Do the integers exists? The unknowability of arithmetic consistency. Commun. Pure Appl. Math. 58, 1280–1286 (2005)MathSciNetCrossRefMATHGoogle Scholar
  21. 21.
    Sieg, W.: Step by Recursive Step: Church’s Analysis of Effective Calculability. Bulletin of Symbolic Logic 3, 154–180 (1997)MathSciNetCrossRefMATHGoogle Scholar
  22. 22.
    Smith, W.D.: Three Counterexamples Refuting Kieu’s Plan for Quantum Adiabatic Hypercomputation and Some Uncomputable Quantum Mechanical Tasks. In: Costa, J.F., Doria, F., (eds.) Applied Mathematics and Computation. Special issue on hypercomputation (to appear, 2006)Google Scholar
  23. 23.
    Turing, A.: On Computable Numbers, with an Application to the Entscheidungsproblem. Proc. London Math, pp. 18–56 (1937); Correction: Ibid. 43, 544–546. Reprinted in [6] 155–222, [26] 18–56 Google Scholar
  24. 24.
    Turing, A.: Lecture to the London Mathematical Society on. Carpenter, B.E., Doran, R.W. (eds.) Alan Turing’s ACE Report of 1946 and Other Papers, 20 February 1947, pp. 106–124. MIT Press, Cambridge (1986)Google Scholar
  25. 25.
    Turing, A.: Collected Works: Mechanical Intelligence. In: Ince, D.C. (ed.) North-Holland, North-Holland, Amsterdam (1992)Google Scholar
  26. 26.
    Alan, T.: Collected Works: Mathematical Logic. In: Gandy, R.O., Yates, C.E.M. (eds.). North-Holland, Amsterdam (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Martin Davis
    • 1
  1. 1.Mathematics Dept.University of CaliforniaBerkeleyUSA

Personalised recommendations