基于假设的证明P！= NP假说
Postulate-based proof of the P != NP hypothesis
摘要：
这篇论文包含了P！=的证明。NP假说与两个“自然”公设的帮助。这些假设限制了图灵机的能力，并指出问题的每个独立和必要条件应该由求解器（图灵机）单独考虑，而不是分组考虑。也就是说，求解器应该花费至少一个步骤来处理条件，因此，如果独立条件的数量随着多项式增长的问题大小呈指数增长，则需要指数时间来找到解决方案。有了这些假设，就足以建立一个自然的（而不是纯数学的）证明，即P！NP.
英文摘要：
The paper contains a proof for the P != NP hypothesis with the help of the two "natural" postulates. The postulates restrict capacity of the Turing machines and state that each independent and necessary condition of the problem should be considered by a solver (Turing machine) individually, not in groups. That is, a solver should spend at least one step to deal with the condition and, therefore, if the amount of independent conditions is exponentially growing with polynomially growing problem sizes then exponential time is needed to find a solution. With the postulates, it is enough to build a natural (not pure mathematical) proof that P != NP.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
