News for hackers. Stuff that matters.

A comment on A Solution of the P versus NP Problem?.

Re:A Solution of the P versus NP Problem? by TekMol on Monday August 14, 2017 @03:31PM (#15011947)
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?
[ Parent | on HN ]
Re:A Solution of the P versus NP Problem? by brianberns on Monday August 14, 2017 @05:37PM (#15013190)
I wonder if the algorithm to search such a space of axioms and transforms for a solution would itself be P or NP. :)
[ Parent | on HN ]
Re:A Solution of the P versus NP Problem? by yorwba on Tuesday August 15, 2017 @04:10AM (#15016364)
Almost certainly so super-exponential that NP appears easy in comparison.
[ Parent | on HN ]
Re:A Solution of the P versus NP Problem? by javra on Tuesday August 15, 2017 @03:32AM (#15016222)
As far was most mathematicians and computer scientists would go, ZF and predicate logic together with a fixed definition of turing machines.
[ Parent | on HN ]