scientific article

zbMath1273.01008MaRDI QIDQ2844489

No author found.

Publication date: 29 August 2013

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

History of mathematics in the 20th century (01A60) Biographies, obituaries, personalia, bibliographies (01A70) Collections of articles of miscellaneous specific interest (00B15) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) History of mathematical logic and foundations (03-03) Proceedings, conferences, collections, etc. pertaining to history and biography (01-06) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) History of computer science (68-03)

Related Items (8)

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 ⋮ Conceptual Confluence in 1936: Post and Turing ⋮ Why Turing’s Thesis Is Not a Thesis ⋮ Martin Davis’s Bibliography 1950–2015 ⋮ Turing oracle machines, online computing, and three displacements in computability theory

This page was built for publication: