Publication:2844489
From MaRDI portal
zbMath1273.01008MaRDI QIDQ2844489
No author found.
Publication date: 29 August 2013
01A60: History of mathematics in the 20th century
01A70: Biographies, obituaries, personalia, bibliographies
00B15: Collections of articles of miscellaneous specific interest
03D15: Complexity of computation (including implicit computational complexity)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
03-03: History of mathematical logic and foundations
01-06: Proceedings, conferences, collections, etc. pertaining to history and biography
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
68-03: History of computer science
Related Items
Conceptual Confluence in 1936: Post and Turing, Why Turing’s Thesis Is Not a Thesis, The stochastic thermodynamics of computation, The dependence of computability on numerical notations, The decision problem for effective procedures, Constructive and computable Hahn-Banach theorems for the (second) fundamental theorem of welfare economics, Turing oracle machines, online computing, and three displacements in computability theory, Martin Davis’s Bibliography 1950–2015
