NP is initially put forward as concept relative to P. However, in the current theoretical framework, NP is defined as problems polynomial time decidable by Nondeterministic Turing Machine (NDTM), and equivalently polynomial time verifiableby Deterministic Turing Machine (TM). As such properties are shared by P, so such a NP contains P. Consequently, P vs NPproblem consists in asking whether NP is equals to P since NP contains P. Although a lot of efforts have been done to try to solve this problem, it remains an open century problem [2][3].

Recently the mathematics professor Norbert Blum from Bonn (Germany) claimed to solve it in his paper "A Solution of the P vs NP Problem", and now computer scientists around the world are examining his work [4]. In fact, this problem has also drawn attention to the lay people, for example, in May 2 2013, the New Yorker published an article entitled as "A Most Profound Math Problem" [5].

On the one hand, more and more people are interested in this problem, but on the other hand the understanding about it is increasingly confused. In this sense, the P versus NP problem is not only the curiosity of the public, but also the perplex of experts in computer science, as expressed by Hemaspaandra when he introduced Gasarch's second poll about the P vs NP problem [6].

Peter Drucker, "the founder of modern management", said that “The most serious mistakes are not being made as a result of wrong answers. The true dangerous thing is asking the wrong question.” Then, why is the problem so important? Because the problem is the root of cognition and behavior of human, and the whole branches of thought and action are then developed from this root, that is, the definition of a problem is to create the realm which we face and deal with.

Concerning the P vs NP problem, we think that the key to this problem is not to answer whether NP is equals to P or not, but to ask what NP is, because the current definitions of NP have cancelled the concept of that real « NP » relative to « P », which we call the loss of nondeterminism from NP.

We create this blog for the purpose of providing a space of exchanging the reflexions and works about the P vs NPproblem from different points of view for all peoples who are interested in this problem, and hope to contribute to the progress of this problem. Moreover, from a broader point of view, we hope to contribute to the integration of science and culture as well as Chinese thinking and Western philosophy.

Reference :

[1] P vs NP Problem (http://www.claymath.org/millennium-problems/p-vs-np-problem)

[2] Stephen Cook, The complexity of theorem proving procedures. Proceedings of the Third Annual ACM Symposium on Theory of Computing. pp. 151-158 (1971). (http://theory.stanford.edu/~trevisan/cs172-07/cook.pdf)
[3] S. Aaronson.  P=?NP [PDF], in Open Problems in Mathematics (Springer), 2016. ECCC TR17-004.

[4] P-NP-PROBLEM : New attack on the biggest mystery of computer science (https://steemit.com/science/@n3bul4/p-np-problem-new-attack-on-the-biggest-mystery-of-computer-science)

[5] A Most Profound Math Problem (http://www.newyorker.com/tech/elements/a-most-profound-math-problem)

[6] The Second P =? NP Poll1 William I. Gasarch (http://www.cs.umd.edu/~gasarch/papers/poll2012.pdf)