4 ms·
There's quite a lot of interest in the proof by some key experts despite their general impression that the proof is wrong and unfixable. Maybe experts are usin
by amichail 16y ago
There's quite a lot of interest in the proof by some key experts despite their general impression that the proof is wrong and unfixable.
Maybe experts are using this proof as an opportunity to promote theoretical computer science? It's a way to get more grad students and funding?
- vecter 16y agoOr, more likely, there are lots of good ideas that can be applied to other difficult problems.
- CitizenKane 16y agoMy impression is that while the proof may have issues that are unfixable that the approach taken in the proof is one that's novel and could still have interesting implications in the theory of computational complexity.
- _delirium 16y agoI think there's some meta-worry that if all attempts to prove P=NP are treated as kookery, nobody serious will dare circulate any work on it, and so nobody will actually end up proving it. So there seems to be some going out of their way to treat a serious good-faith effort with respect.
- bobbyi 16y agoPeople are interested because there is still hope that the proof is not unfixable.
- coliveira 16y agoNo, these people are not "smart enough" to think of marketing strategies of this kind for TOC :-) I think the proof either has some elements that might be helpful in settling the whole issue, or is so complicated that has become an interesting target for researchers.