Meta-Mathematics of Computational Complexity Theory
By: Igor C. Oliveira
Potential Business Impact:
Proves if hard computer problems can be solved fast.
We survey results on the formalization and independence of mathematical statements related to major open problems in computational complexity theory. Our primary focus is on recent findings concerning the (un)provability of complexity bounds within theories of bounded arithmetic. This includes the techniques employed and related open problems, such as the (non)existence of a feasible proof that P = NP.
Similar Papers
Proof Complexity and Feasible Interpolation
Logic
Finds ways to make math proofs much harder.
The Knowledge Complexity of Quantum Problems
Quantum Physics
Lets computers prove secrets without revealing them.
The Solver's Paradox in Formal Problem Spaces
Computational Complexity
Proves math problems are harder than computers can solve.