|
Since my computing science early studies, a question have been chasing me... Is P different than NP ?
As brief explanation, from Wikipedia: "(P vs NP)...is considered by many theoretical computer scientists to be the most important problem in the field".
If we have a set of "easy" problems P, and set of "difficult" problems NP... how are these sets related? Are they different? Or, we just can't find the answer.
For example, an easy problem is to order a list of letters; a difficult problem is to find the shortest road to my home.
Now, at last, researcher Vinay Deolalikar is claiming to have solved the question that chases my nights. Thank you, Vinay !
PD: As a nostalgic bonus, there's an On-line Encyclopedia of Integer Sequences, storing all well-known integer sequences like: "2, 3, 5, 6, 7, 8, 10, 11, 12, 13, 14, 15, 17, 18, 19, 20, 21, 22, 23, 24, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 37, 38, 39..."
UPDATE: Bad news... there are some issues. I can never sleep.
|
P != NP |
