2 ms·
Unprovable statements weaken provable ones no further than the extent to which the undecidability of the halting problem makes my toaster burn my Eggos.
by whatshisface 9y ago
Unprovable statements weaken provable ones no further than the extent to which the undecidability of the halting problem makes my toaster burn my Eggos.
- visarga 9y agoYour toaster has a halting problem?
- eternalban 9y agohttp://lambda-the-ultimate.org/node/4302 http://lambda-the-ultimate.org/node/4302 There seems to me an enormous mistake there. ... Suppose I convince [someone] of the paradox of the Liar, and he says, 'I lie, therefore I do not lie, therefore I lie and I do not lie, therefore we have a contradiction, therefore 2x2 = 369.' Funniest thing is I agree with both of them ..
- whatshisface 9y agoYes, it has the halting problem for a machine much less powerful than a Turing machine, where the answer is always yes unless the thermostat fails. The idea is that just like there are programs less powerful than the halting oracle there are statements less powerful than the completeness of arithmetic.
- rocqua 9y agoI refer to Godel's second incompleteness theorem. That is, no system of axioms can prove itself to be consistent. Thus, all provable statements rest on an unproveable statement.
- deleted 9y ago[deleted]