Frank Vega

I hope your proof were correct. Unfortunately, my proof has a flaw. Thank you for your comments!!!

I suggest you should take a look to the page "NP (complexity)" in Wikipedia. Here is the link: https://en.wikipedia.org/wiki/NP_%28complexity%29 You will see there the following statements in the section "Formal definition": "Alternatively, NP can be defined using deterministic Turing machines as verifiers. A language L is in NP if and only if there exist polynomials p and q, and a deterministic Turing machine M, such that For all x and y, the machine M runs in time p(|x|) on input (x,y) For all x in L, there exists a string y of length q(|x|) such that M(x,y) = 1 For all x not in L and all strings y of length q(|x|), M(x,y) = 0" Alternatively, I suggest to read some serious books that appears in the reference of my paper.

The Italian colleage told me he had a misunderstood. He didn't want to tell me his explanation of his error because he wanted that I take it as an exercise. However, this is not a guarantee that my proof is correct. If you find a truly error in my proof, don't hesitate to share it!!!!

You are right: a polynomial time algorithm for SAT will be the most elegant and practical solution. Unfortunately, my proof is basically theoretical, so you cannot solve feasibly an NP-complete problem using my proof. However, this could show it is possible to find such polynomial algorithms for the NP-complete problems: maybe in the near future if this proof is correct.

Thank you very much. I have shared the paper as an attachment of this post and I removed the link.

Hi!! I need help!! I'm trying to solve the P versus NP problem and I've found a solution that seems pretty easy to follow and understand. I will share you the paper in the attachment of this post!!! However, I shared this paper to an Italian colleague and he told me there is one error in Theorem 3.5, but he didn't want to tell where the error is. But, I'm pretty sure that result is correct. I'm Bachelor of Computer Science and I work as computer programmer in Belgrade, so there are not so much people in which I can find an aid. On the one hand, it is a waste of time trying to email for some of the theoretical experts asking for help because they are saturated of such claiming of wrong proof about P versus NP. On the other hand, if I submit this paper to a journal, then I should wait perhaps 6 or 24 months to have a revision of my paper, and in many cases, those journals have P versus NP handling policies. Could you help me, please? Regards, Frank. pvsnp-hal.pdf