3 ms·
Say you wanted to let a computer search for a proof of P!=NP - which axioms would you start with and which rules to transform the axioms into additional valid s
by TekMol 9y ago
Say you wanted to let a computer search for a proof of P!=NP - which axioms would you start with and which rules to transform the axioms into additional valid statements?
- brianberns 9y agoI wonder if the algorithm to search such a space of axioms and transforms for a solution would itself be P or NP. :)
- yorwba 9y agoAlmost certainly so super-exponential that NP appears easy in comparison.
- javra 9y agoAs far was most mathematicians and computer scientists would go, ZF and predicate logic together with a fixed definition of turing machines.