# Postulate-based proof of the P != NP hypothesis

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.

## Authors

• 1 publication
• ### A Simple Elementary Proof of P=NP based on the Relational Model of E. F. Codd

The P versus NP problem is studied under the relational model of E. F. C...
09/12/2018 ∙ by Aizhong Li, et al. ∙ 0

• ### Proof compression and NP versus PSPACE. Part 2

We upgrade [1] to a complete proof of the conjecture NP = PSPACE. [1]:...
07/08/2019 ∙ by Lev Gordeev, et al. ∙ 0

• ### Two theorems about the P versus NP problem

04/30/2018 ∙ by Tianheng Tsui, et al. ∙ 0

• ### Three computational models and its equivalence

The study of computability has its origin in Hilbert's conference of 190...
10/26/2020 ∙ by Ciro Ivan Garcia Lopez, et al. ∙ 0

• ### Computer-Simulation Model Theory (P= NP is not provable)

The simulation hypothesis says that all the materials and events in the ...
06/20/2019 ∙ by Rasoul Ramezanian, et al. ∙ 0

• ### Philosophical Solution to P=?NP: P is Equal to NP

The P=?NP problem is philosophically solved by showing P is equal to NP ...
03/19/2016 ∙ by Steven Meyer, et al. ∙ 0