News for hackers. Stuff that matters.
Re:Turing machines that should run forever by bertiewhykovich on Wednesday May 11, 2016 @01:16PM (#11677173)

  Z is designed to loop through its 7918 instructions forever, but if it did eventually stop, it would prove ZFC inconsistent. Mathematicians wouldn’t be too panicked, though – they could simply shift to a slightly stronger set of axioms.
Am I correct in thinking that this is completely wrong? Strengthening a set of inconsistent axioms -- taking a "stronger" set of axioms to be a set of axioms that can prove more statements -- will just produce another inconsistent set of axioms. (The inconsistent set <A, B->~A, B> cannot be salvaged by extending it to <A, B->~A, B, C> -- no matter what C is, you can always derive <A, ~A> from the original three axioms.)

Incompleteness is a whole other thing, of course.

Re:Turing machines that should run forever by toth on Wednesday May 11, 2016 @01:35PM (#11677374)
You are correct. They would have to drop an axiom to hope to go from inconsistent to consistent. E.g., go from ZFC to ZF (drop the axiom of choice).

If ZF is inconsistent... I think that would make a lot of mathematicians panic.

Re:Turing machines that should run forever by saghm on Wednesday May 11, 2016 @01:35PM (#11677377)
I noticed the same thing while reading it. I assume that this is just a mistake or misunderstanding by the author, and they actually meant "weaker".

Of course, switching to a weaker set of axioms would mean that some of the things proved by the old set might not be provable anymore, which still seems like an issue...

Re:Turing machines that should run forever by dnautics on Wednesday May 11, 2016 @01:45PM (#11677504)
As a mathematician, I a appreciate the notion that a stronger set of axioms means more power and a smaller and more defined working universe, but I think the author meant "stronger" against contradiction, which is consistent with colloquial use, if not jargon.
Re:Turing machines that should run forever by spott on Wednesday May 11, 2016 @01:36PM (#11677378)
I think this turing machine will only halt if ZFC is inconsistent, not if some other set theory with different axioms is inconsistent.
Re:Turing machines that should run forever by euyyn on Wednesday May 11, 2016 @09:12PM (#11680657)
I interpreted "stronger" as "more constraining", which would mean the opposite: able to prove less statements.