New attempt at proving P≠NP Martin Dowd published a 5-page p | Data Science by ODS.ai 🦜

New attempt at proving P≠NP

Martin Dowd published a 5-page paper claiming to contain a proof that P ≠ NP. This is a fundamental question, comparing quickly checkable against quickly solvalble problems.

Basically, proving P != NP would mean that there will be unlimited demand alphago-like solutions in different spheres, because that will mean (as a scientific fact) that there are problems not having fast [enough] analytical solutions.

ResearchGate: https://www.researchgate.net/publication/354423778_P_Does_Not_Equal_NP
Wiki on the problem: https://en.wikipedia.org/wiki/P_versus_NP_problem

#fundamental #pnenp #computerscience