Complexity classes as mathematical axioms
Annals of mathematics, Tome 170 (2009) no. 2, pp. 995-1002
Complexity theory, being the metrical version of decision theory, has long been suspected of harboring undecidable statements among its most prominent conjectures. Taking this possibility seriously, we add one such conjecture, ${\rm P}^{\# {\rm P}} \neq {\rm NP}$, as a new “axiom” and find that it has an implication in 3-dimensional topology. This is reminiscent of Harvey Friedman’s work on finitistic interpretations of large cardinal axioms.
@article{10_4007_annals_2009_170_995,
author = {Michael H. Freedman},
title = {Complexity classes as mathematical axioms},
journal = {Annals of mathematics},
pages = {995--1002},
year = {2009},
volume = {170},
number = {2},
doi = {10.4007/annals.2009.170.995},
mrnumber = {2552117
},
zbl = {1178.03069},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.4007/annals.2009.170.995/}
}
TY - JOUR AU - Michael H. Freedman TI - Complexity classes as mathematical axioms JO - Annals of mathematics PY - 2009 SP - 995 EP - 1002 VL - 170 IS - 2 UR - http://geodesic.mathdoc.fr/articles/10.4007/annals.2009.170.995/ DO - 10.4007/annals.2009.170.995 LA - en ID - 10_4007_annals_2009_170_995 ER -
Michael H. Freedman. Complexity classes as mathematical axioms. Annals of mathematics, Tome 170 (2009) no. 2, pp. 995-1002. doi: 10.4007/annals.2009.170.995
Cité par Sources :