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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Ceruzzi, P.E.: Reckoners, the Prehistory of the Digital Computer, from Relays to the Stored Program Concept, 1933–1945. Greenwood Press, Westport, Conn. (1983)
Copeland, J. (ed.): The Essential Turing. Oxford University Press, Oxford (2004)
Davis, M.: The Universal Computer. The Road from Leibniz to Turing. W.W. Norton and Company, New York (2004)
Dowling, W.F.: There Are No Safe Virus Tests. American Mathematical Monthly 96, 835–836 (1989)
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–195
Gödel, K.: Über die Länge von Beweisen. Ergebnisse eines mathematischen Kolloquiums 7, 23–24 (1936); Reprinted with English translation in [10] 396–399
Gödel, K.: Some Basic Theorems on the Foundations of Mathematics and Their Philosophical Implications. In: [12], 304–323
Gödel, K.: Some Remarks on the Undecidability Results. In: [11], 305–306
Feferman, S., et al. (eds.): Kurt Gödel Collected Works, vol. I. Oxford University Press, Oxford (1986)
Feferman, S., et al. (eds.): Kurt Gödel Collected Works, vol. II. Oxford University Press, Oxford (1990)
Feferman, S., et al. (eds.): Kurt Gödel Collected Works, vol. III. Oxford University Press, Oxford (1995)
Feferman, S., et al. (eds.): Kurt Gödel Collected Works, vol. V. Oxford University Press, Oxford (2003)
Hartmanis, J.: Gödel, von Neumann, and the P = NP Problem. Bulletin of the European Association for Computer Science 38, 101–107 (1989)
Sieg, W.: Only Two Letters: The Correspondence Between Herbrand and Gödel. The Bulletin of Symbolic Logic 11, 172–184 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dawson, J.W. (2006). Gödel and the Origins of Computer Science. In: Beckmann, A., Berger, U., Löwe, B., Tucker, J.V. (eds) Logical Approaches to Computational Barriers. CiE 2006. Lecture Notes in Computer Science, vol 3988. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11780342_14
Download citation
DOI: https://doi.org/10.1007/11780342_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35466-6
Online ISBN: 978-3-540-35468-0
eBook Packages: Computer ScienceComputer Science (R0)