Set Theory and Logic

   

The Problem P=NP

Authors: Thierry DELORT

In this article, we are going to solve the problem P=NP for a particular kind of problems called basic problems of numerical determination. Nonetheless, this solution can be generalized to all problems belonging to class P or NP. We are going to propose 3 fundamental Axioms permitting to solve the problem P=NP, but those Axioms can also be considered as pure logical assertions, intuitively evident and never contradicted, permitting to understand the solution of the problem P=NP. Indeed, we will see that the conclusion of this article solves the considered problem.

Comments: 6 Pages.

Download: PDF

Submission history

[v1] 2019-08-15 07:59:10

Unique-IP document downloads: 58 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus