One of the most important steps needed for computer science to get itself to the next level seems to be fading away.
P vs NP
Actually, its proof from is playing hard to catch again. This question (whether P=NP or P!=NP) does not want to be answered. It could be, that the problem of proving it is also NP-complete.
The (scientific) community wants needs closure. If P != NP would be proven, a lot of orthodox legislature in PKI, cryptography and signature/timestamp validity would probably become looser. If P=NP is true, well, s*!t hits the fan.
The opinions expressed herein are my own personal opinions and do
not represent my company's view in any way.
My views often change.
This blog is just a collection of bytes.
Copyright © 2003-2017Matevž Gačnik