Complexity Classes as Mathematical Axioms
Computational Complexity
2009-06-17 v4 Geometric Topology
Abstract
Treating a conjecture, P^#P != NP, on the separation of complexity classes as an axiom, an implication is found in three manifold topology with little obvious connection to complexity theory. This is reminiscent of Harvey Friedman's work on finitistic interpretations of large cardinal axioms.
Keywords
Cite
@article{arxiv.0810.0033,
title = {Complexity Classes as Mathematical Axioms},
author = {M. Freedman},
journal= {arXiv preprint arXiv:0810.0033},
year = {2009}
}
Comments
Some minor changes and one more reference. To appear in Ann. Math