P=NP? (or P versus NP)

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.


Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s