| ▲ | protoman3000 2 hours ago | |
If they wanted to solve a Millenium prize problem so much, why did they not try to solve P-NP instead? It boggles the mind. | ||
| ▲ | eru an hour ago | parent | next [-] | |
What makes you think they didn't try? | ||
| ▲ | throw-qqqqq 36 minutes ago | parent | prev | next [-] | |
Are you kidding/trolling? The P=NP problem is FAR more fundamental, and if proven true, would basically be a proof that e.g. public key crypto can be broken (NOT a description of how to though). Basically, it would be a proof that all the REALLY hard (combinatorial) problems out there, have a much simpler solution, if we were able to find it. | ||
| ▲ | cammikebrown 2 hours ago | parent | prev [-] | |
That one is way more difficult. | ||