Jump to content

P!=NP might have been proved...biggest unsolved problem in computer science..


Recommended Posts

Posted
Last, but not the least P=NP would mean my thesis would become worthless :(( as it is based on P!=NP..
Your thesis should be fine. That is what he has claimed to have proven.
Posted

wait, is it a solution to P! = NP or P = NP? if it's P! = NP then it's not a big deal as it's almost assumed to be true in all cases If it's P = NP then it would create a whole new dimension to the world of intelligence and IT

Posted

^ They're the same problem. For the non-techie guys here... The P vs NP problem is like so... Take a jigsaw puzzle. It is easy to verify if a jigsaw has been completed properly. However completing the jigsaw itself can be exceedingly difficult. It could take a few minutes, hrs, days, years, centuries all the way to an infinite amt of time. P represents solutions that can be quantified in terms of effort. For example if we use time as a measure, it will take 3 days to complete said jigsaw. NP represents solutions that cannot be quantified in terms of effort... as in it could take an infinite amount of time to solve this problem. P = NP means ... there's always an easy way to solve the jigsaw puzzle and this method can be quantified. P != NP means there are some problems (such as solving said jigsaw) that are impossible whose solutions cannot be measured. This is generally assumed to be true. This HP guy has said that he has proved that there are some solutions that cannot be measured.

Posted
wait, is it a solution to P! = NP or P = NP? if it's P! = NP then it's not a big deal as it's almost assumed to be true in all cases
it is a big big deal cause even though it is assumed, it has not yet been proven. there is a big difference between the two, which is why there is a million dollar prize on it.
×
×
  • Create New...