Profile image
Story Views

Last Hour:
Last 24 Hours:

P=NP? (or P versus NP)

Thursday, January 5, 2017 18:24
% of readers think this story is Fact. Add your two cents.

The P=NP or P versus NP problem is a major unsolved problem in computer science. Informally speaking, it asks whether every problem whose solution can be quickly verified by a computer can also be quickly solved by a computer.

The solution of this problem is simply that P and NP is an inconsistent distinction. The problem is like asking whether human=primate. Neither of them is neither countable nor countably infinite, and their relation is orthogonal.

The fundamental problem underlying this problem is that in this world time is orthogonal to change. A popular explanation of this problem is that “for every problem we try to solve, there is a problematical back side, principally meaning that every solution of a problem has a problem”. Never can we liberate us from problems.

The fundamental problem is thus that we can’t understand reality.

Another contribution to understanding of conceptualization


We encourage you to Share our Reports, Analyses, Breaking News and Videos. Simply Click your Favorite Social Media Button and Share.

Report abuse


Your Comments
Question   Razz  Sad   Evil  Exclaim  Smile  Redface  Biggrin  Surprised  Eek   Confused   Cool  LOL   Mad   Twisted  Rolleyes   Wink  Idea  Arrow  Neutral  Cry   Mr. Green

Top Stories
Recent Stories



Top Global

Top Alternative



Email this story
Email this story

If you really want to ban this commenter, please write down the reason:

If you really want to disable all recommended stories, click on OK button. After that, you will be redirect to your options page.