| http://www.w3.org/ns/prov#value | - Unless it is an axiom that P!=NP, any proof of P!=NP has to beessentially be of the form:f solves SAT -> f in Cf in C -> f cannot be computed in polynomial time.Therefore, f solves SAT -> f cannot be computed in polynomial time.The Razborov-Rudich paper on Natural Proofs" essentially shows thatif (1) C is a property that is common (Largeness) and (2) it is easyto check whether a function
|
