Advertisement

Gödel and the Origins of Computer Science

  • John W. DawsonJr.
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3988)

Abstract

The centenary of Kurt Gödel (1906–78) is an appropriate occasion on which to assess his profound, yet indirect, influence on the development of computer science. His contributions to and attitudes toward that field are discussed, and are compared with those of other pioneer figures such as Alonzo Church, Emil Post, Alan Turing, and John von Neumann, in order better to understand why Gödel’s role was no greater than it was.

Keywords

Human Mind Collect Work Incompleteness Theorem Untimely Death Recursion Theory 
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.
    Buss, S.S.: On Gödel’s Theorems on Lengths of Proofs II: Lower Bounds for Recognizing k Symbol Provability. In: Clote, P., Remmel, J.B. (eds.) Feasible Mathematics II. Progress in Computer Science and Applied Logic, vol. 13, pp. 57–90. Birkhäuser, Boston (1995)CrossRefGoogle Scholar
  2. 2.
    Ceruzzi, P.E.: Reckoners, the Prehistory of the Digital Computer, from Relays to the Stored Program Concept, 1933–1945. Greenwood Press, Westport, Conn. (1983)Google Scholar
  3. 3.
    Copeland, J. (ed.): The Essential Turing. Oxford University Press, Oxford (2004)MATHGoogle Scholar
  4. 4.
    Davis, M.: The Universal Computer. The Road from Leibniz to Turing. W.W. Norton and Company, New York (2004)Google Scholar
  5. 5.
    Dowling, W.F.: There Are No Safe Virus Tests. American Mathematical Monthly 96, 835–836 (1989)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Gödel, K.: Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I. Monatshefte für Mathematik und Physik 38, 144–195 (1931); Reprinted with English translation in [10] 144–195MATHGoogle Scholar
  7. 7.
    Gödel, K.: Über die Länge von Beweisen. Ergebnisse eines mathematischen Kolloquiums 7, 23–24 (1936); Reprinted with English translation in [10] 396–399MATHGoogle Scholar
  8. 8.
    Gödel, K.: Some Basic Theorems on the Foundations of Mathematics and Their Philosophical Implications. In: [12], 304–323Google Scholar
  9. 9.
    Gödel, K.: Some Remarks on the Undecidability Results. In: [11], 305–306Google Scholar
  10. 10.
    Feferman, S., et al. (eds.): Kurt Gödel Collected Works, vol. I. Oxford University Press, Oxford (1986)Google Scholar
  11. 11.
    Feferman, S., et al. (eds.): Kurt Gödel Collected Works, vol. II. Oxford University Press, Oxford (1990)Google Scholar
  12. 12.
    Feferman, S., et al. (eds.): Kurt Gödel Collected Works, vol. III. Oxford University Press, Oxford (1995)Google Scholar
  13. 13.
    Feferman, S., et al. (eds.): Kurt Gödel Collected Works, vol. V. Oxford University Press, Oxford (2003)Google Scholar
  14. 14.
    Hartmanis, J.: Gödel, von Neumann, and the P = NP Problem. Bulletin of the European Association for Computer Science 38, 101–107 (1989)MATHGoogle Scholar
  15. 15.
    Sieg, W.: Only Two Letters: The Correspondence Between Herbrand and Gödel. The Bulletin of Symbolic Logic 11, 172–184 (2005)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • John W. DawsonJr.
    • 1
  1. 1.Penn State YorkYorkU.S.A.

Personalised recommendations