Computation and intractability: echoes of Kurt Gödel
From MaRDI portal
Publication:2856489
zbMATH Open1275.03006MaRDI QIDQ2856489FDOQ2856489
Authors: Christos Papadimitriou 
Publication date: 29 October 2013
Recommendations
- Computability. Turing, Gödel, Church, and beyond
- Gödel's incompleteness theorems and computer science
- Logical Approaches to Computational Barriers
- Godel on computability
- Gödel's incompleteness phenomenon -- computationally
- Logical Approaches to Computational Barriers
- scientific article; zbMATH DE number 5064404
- Von Neumann, Gödel and complexity theory
- Turing‐computability and artificial intelligence: Gödel’s incompleteness results
History of mathematics in the 20th century (01A60) History of computer science (68-03) History of mathematical logic and foundations (03-03)
Cited In (10)
- Title not available (Why is that?)
- Logical Approaches to Computational Barriers
- Title not available (Why is that?)
- Gödel, Searle, and the Computational Theory of the (Other) Mind
- Title not available (Why is that?)
- The origins of the halting problem
- Von Neumann, Gödel and complexity theory
- Computability. Turing, Gödel, Church, and beyond
- Title not available (Why is that?)
- Logical Approaches to Computational Barriers
This page was built for publication: Computation and intractability: echoes of Kurt Gödel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2856489)
