There are popular science books for
Poincaré Conjecture
Riemann Hypothesis
Fermat's last theorem
maybe others too..
Why not P=NP?
[It's important, no doubt]
[Or is there one? let me know if you know of any]
Poincaré Conjecture
Riemann Hypothesis
Fermat's last theorem
maybe others too..
Why not P=NP?
[It's important, no doubt]
[Or is there one? let me know if you know of any]
6 comments:
If you are asking why P=NP, then its clear that you do not understand complexity theory. Get your hands on any book on complexity theory and it will give you an idea,the one by Sanjeev Arora is good.
If you are asking why P=NP, then its clear that you do not understand complexity theory. Get your hands on any book on complexity theory and it will give you an idea,the one by Sanjeev Arora is good.
dude, P=NP or not has not been proved yet.. It is generally believed they are not equal, but there is no proof yet..
And my point was not whether it is so, I was saying there is no popular science book about it as is there for Riemann Hypothesis..
and yes, Arora book is on my list, but couldn't find.. thinking of buying it through flipkart..
1) I know that P=NP is an open problem and its widely believed that they are not equal. Its not hard too see why it is believed so.
2) I dont understand what you mean by science book on P=NP problem. Why do you want a separate book just P=NP?
If someone has to discuss the problem then in general complexity theory, complexity classes and probably turing machines have to be discussed as a prereq. At a stretch, the author could explain common proof techniques like diagnolization and stuff, what more can he do, unless he has some proof the problem itself.
By the way, I still think you should buy a kindle. And get away with the comment moderation dude, its kinda annoying. You can chop off this comment though :P
han wo list me hai.. :)
btw, I did not say 'science book', I said 'popular science book'.. What I mean is a book accessible to non specialists (in this case non CS people) without being imprecise. P=NP problem is tough, but so is Riemann Hypothesis, Poincare conjceture, or Fermat's last theorem.. They are luckier to have great expositions for the general reader (see my next post for an example). I wish somebody do the same for P=NP. I believe the background can be made accessible enough, there's more than enough precedent.
Post a Comment