Profile image
Story Views

Last Hour:
Last 24 Hours:

The solution of the P=NP? problem

Tuesday, January 10, 2017 18:13
% of readers think this story is Fact. Add your two cents.

The answer to the P=NP? problem (ie, whether every problem whose solution can be quickly verified by a computer can also be quickly solved by a computer) is simply no. Not all can.

The reason is that “verification” and “solution” are orthogonal, and thus that there has to be at least one “quick” verification that can’t be solved “quickly” (or one “quick” solution that can’t be verified “quickly”). “Verification” and “solution” simply share no common point.

Does this mean that I win $ one million from the Clay Mathematics Institute (CMI)?

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.