Submitted:
23 July 2020
Posted:
24 July 2020
You are already at the latest version
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.
Keywords:
Computational Complexity
; Probability
; Mathematics
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
