Re:An ABC proof too tough even for mathematicians
by krichman on Sunday November 25, 2012 @11:47PM
(#4830567)
Simply because there are some propositions that are unprovable in a consistent system with finite axioms. Having an algorithm that solves any proposition would be equivalent to having an algorithm that solves the halting problem.
Re:An ABC proof too tough even for mathematicians
by hackinthebochs on Monday November 26, 2012 @12:23AM
(#4830699)
>There is no algorithm that can determine the truth of any proposition in arithmetic (for example). It is impossible, in principle, to construct such an algorithm. But given any proposition in arithmetic, the mind can decide its truth value.
These two statements seem to contradict, unless you grant that the mind either fudges the proof or constructs new axioms such that the proof can be valid. Why do you assume a program can never do this?
Re:An ABC proof too tough even for mathematicians
by leephillips on Monday November 26, 2012 @09:35AM
(#4832062)
Because the program that does it would itself be an algorithm with its own finite set of axioms. There would be undecidable propositions unreachable by the program.
Re:An ABC proof too tough even for mathematicians
by DanWaterworth on Monday November 26, 2012 @01:31AM
(#4830914)
Solving the halting problem wouldn't be sufficient to tell you whether a proposition was true, but it could tell you whether a proposition is independent and if it wasn't whether it was true or false.
Currently, yes. But I don't see that this is necessarily true. Why do you think it is?