The P versus NP problem is addressed in a context of provability and limitations on the possibility of finding sound axioms for formal theories. It is shown that if the term "constructible theory" is defined in a way which satisfies certain natural conditions, and we assume that every true sentence in the language of Peano Arithmetic is provable in some sound and constructible theory, then no sound and constructible theory proves P = NP.

翻译：暂无翻译