And why solve one of them can solve all,how does it be proved
In: Mathematics
There are some types of problems which are fundamentally very complex, and (as far as we know) there may well not be a simple solution at all. Even if there IS an efficient solution, it is clear at this point that it requires some profound breakthroughs in mathematics. We don’t just need to improve our computations, we need new approaches to these problems fullstop.
For a long time it was hoped that someone would crack P vs NP, and discover the P=NP, but that never happened. It was hoped that perhaps quantum computers might help somehow, but that never happened.
Really this is rubbing up on the boundaries of what mathematics can answer – Why are some problems hard? A question which I am unqualified to answer.
Latest Answers