Bulletin of Symbolic Logic 16 (4):516-530 (2010)
Around 1989, a striking letter written in March 1956 from Kurt Gödel to John von Neumann came to light. It poses some problems about the complexity of algorithms; in particular, it asks a question that can be seen as the first formulation of the P=?NP question. This paper discusses some of the background to this letter, including von Neumann's own ideas on complexity theory. Von Neumann had already raised explicit questions about the complexity of Tarski's decision procedure for elementary algebra and geometry in a letter of 1949 to J. C. C. McKinsey. The paper concludes with a discussion of why theoretical computer science did not emerge as a separate discipline until the 1960s
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
References found in this work BETA
On Me Number of Steps in Proofs.Jan Krajíèek - 1989 - Annals of Pure and Applied Logic 41 (2):153-178.
On Gödel's Theorems on Lengths of Proofs I: Number of Lines and Speedup for Arithmetics.Samuel R. Buss - 1994 - Journal of Symbolic Logic 59 (3):737-756.
On the Number of Steps in Proofs.Jan Kraj\mIček - 1989 - Annals of Pure and Applied Logic 41 (2):153-178.
Citations of this work BETA
No citations found.
Similar books and articles
That Von Neumann Did Not Believe in a Physical Collapse.Lon Becker - 2004 - British Journal for the Philosophy of Science 55 (1):121-135.
John von Neumann, Scientific Method and Empirical Economics.Salim Rashid - 1994 - Journal of Economic Methodology 1 (2):279-294.
The Von Neumann Entropy: A Reply to Shenker.Leah Henderson - 2003 - British Journal for the Philosophy of Science 54 (2):291-296.
Von Neumann's Methodology of Science: From Incompleteness Theorems to Later Foundational Reflections.Giambattista Formica - 2010 - Perspectives on Science 18 (4):480-499.
Theoreticians as Professional Outsiders: The Modeling Strategies of John von Neumann and Norbert Wiener.Ehud Lamm - 2013 - In Oren Harman & Michael Dietrich (eds.), Outsider Scientists: Routes to Innovation in Biology. Chicago University Press.
Reviews. [REVIEW]Yorick Wilks - 1982 - British Journal for the Philosophy of Science 33 (3):191-195.
Borel Reducibility and Classification of von Neumann Algebras.Román Sasyk & Asger Törnquist - 2009 - Bulletin of Symbolic Logic 15 (2):169-183.
An Axiomatisation of Set Theory.John von Neumann - 1925 - In J. Van Heijenoort (ed.), From Frege to Gödel: A Source Book in Mathematical Logic, 1879--1931. Harvard University Press. pp. 393--413.
Bell, Bohm, and von Neumann: Some Philosophical Inequalities Concerning No-Go Theorems and the Axiomatic Method.Michael Stöltzner - 2002 - In T. Placek & J. Butterfield (eds.), Non-Locality and Modality. Kluwer Academic Publishers. pp. 37--58.
An Axiomatics for Nonstandard Set Theory, Based on Von Neumann-Bernays-Gödel Theory.P. V. Andreev & E. I. Gordon - 2001 - Journal of Symbolic Logic 66 (3):1321-1341.
Added to index2011-01-05
Total downloads26 ( #194,054 of 2,158,407 )
Recent downloads (6 months)2 ( #193,774 of 2,158,407 )
How can I increase my downloads?