Computability. Turing, Gödel, Church, and beyond
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to history and biography (01-06) History of mathematics in the 20th century (01A60) Biographies, obituaries, personalia, bibliographies (01A70) History of computer science (68-03) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) History of mathematical logic and foundations (03-03) Complexity of computation (including implicit computational complexity) (03D15)
- Computation and intractability: echoes of Kurt Gödel
- Turing computability. Theory and applications
- scientific article; zbMATH DE number 5064404
- Church's thesis and the conceptual analysis of computability
- Turing‐computability and artificial intelligence: Gödel’s incompleteness results
- scientific article; zbMATH DE number 1909819
- Godel on computability
- Publication:4938556
- scientific article; zbMATH DE number 225477
- scientific article; zbMATH DE number 1521550 (Why is no real title available?)
- Martin Davis’s Bibliography 1950–2015
- Church Without Dogma: Axioms for Computability
- Turing oracle machines, online computing, and three displacements in computability theory
- scientific article; zbMATH DE number 3827200 (Why is no real title available?)
- scientific article; zbMATH DE number 5064404 (Why is no real title available?)
- Conceptual Confluence in 1936: Post and Turing
- Why Turing’s Thesis Is Not a Thesis
- The dependence of computability on numerical notations
- scientific article; zbMATH DE number 5187689 (Why is no real title available?)
- Ad Infinitum... The Ghost in Turing's Machine
- The foundations of computation, physics and mentality: the Turing legacy
- Logical Approaches to Computational Barriers
- Church's thesis and the conceptual analysis of computability
- The decision problem for effective procedures
- Three books on computability, with a special focus on Turing's legacy. Essay review of: A. M. Turing, On computable numbers, with an application to the Entscheidungsproblem. Book review of: R. Adams, An early history of recursive functions and computability from Gödel to Turing; B. J. Copeland (ed.) et al., Computability. Turing, Gödel, church, and beyond; G. Sommaruga and T. Strahm (ed.), Turing's revolution. The impact of his ideas about computability
- Computation and intractability: echoes of Kurt Gödel
- Constructive and computable Hahn-Banach theorems for the (second) fundamental theorem of welfare economics
- The stochastic thermodynamics of computation
This page was built for publication: Computability. Turing, Gödel, Church, and beyond
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2844489)
