S1xty
|
  |
| Joined: 25 Oct 2009 |
| Total Posts: 2712 |
|
|
| 04 Apr 2015 10:59 PM |
I don't really see the application to proving P=NP, I mean the only example I can think of where a computer can solve for the solution of which it can verify is in hashing
ie (not real hash values):
lets say the MD5 hash of roblox is 2d4h382j87t238rr9f
so given a computer can verify 2d4h382j87t238rr9f is the MD5 hash of roblox, is P=NP stating that the computer can also solve for the original input of roblox? If so then there is a flaw in this, because MD5 and all other hashes have collisions, so any solution would be irrelevant as there could be infinite other solutions |
|
|
| Report Abuse |
|
S1xty
|
  |
| Joined: 25 Oct 2009 |
| Total Posts: 2712 |
|
|
| 04 Apr 2015 11:00 PM |
"The existence of such one-way functions is still an open conjecture. In fact, their existence would prove that the complexity classes P and NP are not equal, thus resolving the foremost unsolved question of theoretical computer science."
Is MD5 not one way? Is it not considered such because it is not 100% deterministic due to collisions? |
|
|
| Report Abuse |
|