| http://www.w3.org/ns/prov#value | - On Nov 9, 11:58 am, Craig Feinstein <cafei...@msn.com> wrote:> Unless it is an axiom that P!=NP, any proof of P!=NP has to be> essentially be of the form:>> f solves SAT -> f in C> f 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 that> if (1) C is a property that
|
