| http://www.w3.org/ns/prov#value | - The problem translates as: can P (something easy to solve) equal NP? (something easy to check) In this case, P is a question that can be solved by an algorithm, or a program on a computer - so therefore it is computable, whereas NP is something which can not - because there are so many possible answers to check through that it would take too long.
|
