>>11916675IN English language it's
"prove that hard math problems can be solved via a limited, predictable number of steps, without having to do guesswork with a random number of steps to find boundaries that may or may not be valid for very large values."
P=NP is the proof that all math problems have algorithmic solutions, or the proof that they do not. If they don't some problems can only be brute forced with increasingly powerful computers. We simply don't know today.
Example of "simple" problem: Find the lowest value card in a deck
Example of "hard" problem: find the best route to for this salesman to cover all 15 cities in minimum time considering traffic, distance and number of customer per town.
In 1 i can easily use an algorithm to sort from top to bottom and select minimal value.
In 2 i don't have a formula to calculate it so I just try different ways looking for good ones, I brute force it but the trouble is, with each new town i'm adding exponentially more ways to connect them. At some point even a super computer can't try them all in good time.
That's very very simplified. There's a whole other thing with easy to verify and NP complete vs hard...
