Preprint Article Version 1 This version is not peer-reviewed

Proof that P NP

Version 1 : Received: 23 July 2020 / Approved: 24 July 2020 / Online: 24 July 2020 (13:53:24 CEST)

How to cite: Samuels, J.I. Proof that P NP. Preprints 2020, 2020070588 (doi: 10.20944/preprints202007.0588.v1). Samuels, J.I. Proof that P ≠ NP. Preprints 2020, 2020070588 (doi: 10.20944/preprints202007.0588.v1).

Abstract

The question does P = NP has confounded mathematicians and computer scientists alike for over 50 years and although there is an almost unanimous agreement that it in fact does not, there still is no absolute proof. In this paper, I attempt to prove to that P does not equal NP.

Subject Areas

Computational Complexity; Probability; Mathematics

Comments (2)

Comment 1
Received: 24 July 2020
Commenter: Jamell Ivan Samuels
The commenter has declared there is no conflict of interests.
Comment: Please ignore the argument of intent, it's not actually right, it's just more of an analogy.
+ Respond to this comment
Response 1 to Comment 1
Received: 1 August 2020
Commenter: Jamell Ivan Samuels
The commenter has declared there is no conflict of interests.
Comment: Ok my first comment was a mistake, it is actually correct it's just that following the logic it's not an argument you would make as you would already know.

We encourage comments and feedback from a broad range of readers. See criteria for comments and our diversity statement.

Leave a public comment
Send a private comment to the author(s)
Views 0
Downloads 0
Comments 2
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.