## Study on the Solution of the Clay Millennium Problem about the P vs NP: A Short Proof that P ≠ NP=EXPTIME in the Context of Deterministic Turing Machines

In this paper, I prove that P NP and NP=EXPTIME in the context of Zermelo-Frankel set theory and deterministic Turing computers in a very short but definitive proof. The complex consequences of tackling the P versus NP dilemma in various axiomatic systems are also discussed. The current paper’s findings...

Read More