News for hackers. Stuff that matters.

A comment on On Norbert Blum’s claimed proof that P does not equal NP. Parent comment

Re:On Norbert Blum’s claimed proof that P does not equal NP by Houshalter on Thursday August 17, 2017 @01:12AM (#15033965)
You can't just add arbitrary axioms. It's entirely possible to have a statement that's unprovable with any axioms mathematicians would consider reasonable.
[ Parent | on HN ]
Re:On Norbert Blum’s claimed proof that P does not equal NP by emmab on Saturday August 19, 2017 @02:55AM (#15052073)
An axiom can be wrong wrt the standard model for some first-order theory: http://lesswrong.com/lw/g0i/standard_and_nonstandard_numbers...

But, demonstrating an axiom is inconsistent with the standard model of peano arithmetic or ZFC is in the general case uncomputable.

For example, an axiom that claims some program halts when it does not actually halt cannot in general be proved to be inconsistent wrt the standard model, because otherwise one could decide the halting problem.

[ Parent | on HN ]