@vzn Hi, I've read your article vzn1.wordpress.com/2015/06/01/…

I don't think that people in computer scinece or mathematics work hard on P vs. NP problem since the policy of universities posses them to publish a paper regurely, so these papers mostly deal with problems that is far less difficult than P vs. NP or other hard problems.

And another reason is that when you want to show that P vs. NP is equal then you need to show an algorithm, what kind of algorithm? how it works? this remains mistery since we don't know yet this question and this is also a problem since P vs. NP question has been on the public for a long time and I never heard of somewhat lowerbouding the possibilities of 'thinking' about what kind of algorithm could resolve NP vs. P as scientific reasoning.

What I'm saying is that the term of algorithm needs to be refresh with a good definition in order to make a good future for its problems. The second attack to NP vs. P is find a physical lower bound by concrete complexity (circuit complexity, communiction complexity, Proof Complexity) this research is valuable, the more you work on it, the more you're close to a new classes and new about NP vs. P.

Thus, most of academic people in the univerities work on this side becasue they have two goal: one is attacking NP vs. P and the other is become close to NP vs. P. Clearly the second approch is better and it is really need a mathematics with diffierent background. Now, what is about research on algorithm. For me, the best research would be to focus on the term of 'algorithm' (don't forget the algorithm is still thesis, and not theory, therefore it could be changed.)

The best approach now is to connect the physical side with the computation which results a new understanding of 'algorithm' that is, the quantum algorithm. I agree with David Deutch when he says that algorithm needs to be changed.

What we have seen so far on Quantum algorithm is just the beginning, the big issue is to attack the quantum theory to understand it in order to develop a new theory for 'computation' and 'information'. This is of course a long way research but the I believe in the idea because Church-Turing thesis isn't no more valube for future post-transistors era!

@YOUSEFY hi thx for response/ review re the blog, glad you found something engaging. P vs NP problem is nearly ½ century old in just a few yrs! yes have long noticed the incremental vs breakthru aspects/ dichotomy of (T)CS/ math research and clearly the problem is just "too hard" right now. re Deutsch, read his book Fabric of Reality years ago, think hes one of the leading physics thinkers around, just read the article, thx for sharing :)