A 3 RD SHORTER SOLUTION OF THE CLAY MILLENNIUM PROBLEM ABOUT P ≠ NP =EXPTIME
Résumé
In this paper I present a 3 rd very short proof that P ≠ NP, and NP=EXPTIME derived by simplification from my 2 previous published proofs, in the context of the Zermelo-Frankel set theory and deterministic Turing machines. The proof also gives that the well-known fact that the complexity class NP is contained in the complexity class EXPTIME, must be stated in the usual formal definition of the NP class (even at the standard formulation of this millennium problem by S Cook) because it is provable that it cannot be derived from the other two usual conditions of the formulation and if no added, the problem would become ILL POSED. The results of these proofs definitely solve the 3rd Clay Millennium Problem about P versus NP, in a simple and transparent away that the general scientific community, but also the experts of the area, can follow, understand and therefore become able to accept.
Fichier principal
The very_short _but_true_solution_of_the P_vs_NP_problem_31_01_22.pdf (619.24 Ko)
Télécharger le fichier
Origine | Fichiers produits par l'(les) auteur(s) |
---|