论文标题
假设P！= NP假设的证明
Postulate-based proof of the P != NP hypothesis
论文作者
论文摘要
本文在两个“自然”假设的帮助下包含了P！= NP假设的证明。假设图灵机的限制能力，并指出，求解器（Turing Machine）应单独考虑问题的每个独立和必要条件，而不是分组。也就是说，求解器应至少花费一步来应对条件，因此，如果独立条件的数量呈指数增长，则使用多项式生长的问题大小，则需要指数时间以找到解决方案。使用假设，足以构建自然（不是纯粹的数学）证明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.
