David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
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)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Lon Becker (2004). That Von Neumann Did Not Believe in a Physical Collapse. British Journal for the Philosophy of Science 55 (1):121-135.
Salim Rashid (1994). John von Neumann, Scientific Method and Empirical Economics. Journal of Economic Methodology 1 (2):279-294.
Leah Henderson (2003). The Von Neumann Entropy: A Reply to Shenker. British Journal for the Philosophy of Science 54 (2):291-296.
Giambattista Formica (2010). Von Neumann's Methodology of Science: From Incompleteness Theorems to Later Foundational Reflections. Perspectives on Science 18 (4):480-499.
Meir Hemmo & Orly Shenker (2006). Von Neumann's Entropy Does Not Correspond to Thermodynamic Entropy. Philosophy of Science 73 (2):153-174.
Ehud Lamm (2013). Theoreticians as Professional Outsiders: The Modeling Strategies of John von Neumann and Norbert Wiener. In Oren Harman & Michael Dietrich (eds.), Outsider Scientists: Routes to Innovation in Biology. Chicago University Press.
Yorick Wilks (1982). Reviews. [REVIEW] British Journal for the Philosophy of Science 33 (3):191-195.
Román Sasyk & Asger Törnquist (2009). Borel Reducibility and Classification of von Neumann Algebras. Bulletin of Symbolic Logic 15 (2):169-183.
John von Neumann (1925). An Axiomatisation of Set Theory. In J. Van Heijenoort (ed.), From Frege to Gödel: A Source Book in Mathematical Logic, 1879--1931. Harvard University Press. 393--413.
Michael Stöltzner (2002). Bell, Bohm, and von Neumann: Some Philosophical Inequalities Concerning No-Go Theorems and the Axiomatic Method. In T. Placek & J. Butterfield (eds.), Non-Locality and Modality. Kluwer. 37--58.
Eric Steinhart (2002). Why Numbers Are Sets. Synthese 133 (3):343 - 361.
P. V. Andreev & E. I. Gordon (2001). An Axiomatics for Nonstandard Set Theory, Based on Von Neumann-Bernays-Gödel Theory. Journal of Symbolic Logic 66 (3):1321-1341.
Miklós Rédei (2007). The Birth of Quantum Logic. History and Philosophy of Logic 28 (2):107-122.
Added to index2011-01-05
Total downloads14 ( #120,617 of 1,102,135 )
Recent downloads (6 months)1 ( #306,622 of 1,102,135 )
How can I increase my downloads?