| json_metadata | "{"app":"Musing","appTags":["mathematics",""],"appCategory":"mathematics","appTitle":"Can someone explain to me what p vs np paradox is in easy words?","appBody":"<p>In simpler terms the P vs NP<strong> </strong>can be simply rephrased to \"<em><strong>Can every solved problem whose answer can be checked quickly by a computer also be quickly solved by a computer?</strong></em>\"</p>\n<p>Where P on that statement refers to problems that are <strong>easily solved</strong> by computers and NP are problems that are <strong>easy to check</strong> but not necessarily easy to solve.</p>\n<p>A pretty good example to explain P vs NP would be comparing a <strong>mathematical equation vs a riddle</strong>. </p>\n<p>Mathematical questions like 1 + 1 = ? are easily solved and checked by computers as correct, this is P.</p>\n<p>Riddles on the other hand are easily checked and verified as correct (if you already know the correct answer) but is hard to come up with the correct one, this is NP.</p>\n<p>The P vs NP Problem is just simply stating that if a computer can easily check correct solutions then it should also be able to provide a correct solution. </p>","appDepth":2,"appParentPermlink":"pk3rthh5x","appParentAuthor":"zayedsakib","musingAppId":"aU2p3C3a8N","musingAppVersion":"1.1","musingPostType":"answer"}" |
|---|
hiveblocks