Computational complexity theory and the philosophy of mathematics
From MaRDI portal
Publication:5124666
DOI10.1093/PHILMAT/NKZ021zbMATH Open1451.68128OpenAlexW2983314274MaRDI QIDQ5124666FDOQ5124666
Authors: Walter Dean 
Publication date: 30 September 2020
Published in: Philosophia Mathematica (Search for Journal in Brave)
Full work available at URL: http://wrap.warwick.ac.uk/126886/1/WRAP-computational-complexity-theory-philosophy-mathematics-Dean-2019.pdf
Recommendations
- The Gödel phenomenon in mathematics: a modern view
- On the computing paradigm and computational complexity
- Universality, invariance, and the foundations of computational complexity in the light of the quantum computer
- \({\mathcal P}\), \({\mathcal{NP}}\) and mathematics -- a computational complexity perspective
- scientific article; zbMATH DE number 1344905
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Philosophy of mathematics (00A30)
Cited In (10)
- Computational tractability -- beyond Turing?
- Experimental logics as a model of development of deductive science and computational properties of undecidable sentences
- The Gödel phenomenon in mathematics: a modern view
- Universality, invariance, and the foundations of computational complexity in the light of the quantum computer
- Will the digital computer transform classical mathematics?
- On the computing paradigm and computational complexity
- The significance of relativistic computation for the philosophy of mathematics
- New barriers in complexity theory: on the solvability complexity index and the towers of algorithms
- Connections between artificial intelligence and computational complexity and the complexity of graphs
- Philosophy of Computation
This page was built for publication: Computational complexity theory and the philosophy of mathematics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5124666)
