Re:An ABC proof too tough even for mathematicians
by xyzzy123 on Sunday November 25, 2012 @06:21PM
(#4829641)
So would it be fair to say then, that these proof checkers are missing the 'libraries' that would be needed to efficiently write verifiable proofs for modern mathematics?
Re:An ABC proof too tough even for mathematicians
by cperciva on Sunday November 25, 2012 @06:35PM
(#4829663)
Exactly. And this is where most of the work on proof checkers is happening -- finding ways that people can input proofs in a less formal way and have automated code fill in the formal details as a first pass before running the verification.
In some sense we won't really know whether a proof is rock-solid until we have run it through a verifier, using a proven-correct verifier on proven-correct hardware.
If theorem provers grow to be more easy to use, we may require proofs to be verified, but we aren't there yet by a wide stretch.
For an idea about how hard this can be, check out http://www.cs.ru.nl/~freek/comparison/comparison.pdf:
"In 1998, Tom Hales proved the Kepler Conjecture […] with a proof that is in the same category as the Four Color Theorem proof in that it relies on a large amount of computer computation. For this reason the referees of the Annals of Mathematics, where he submitted this proof, did not feel that they could check his work. And then he decided to formalize his proof to force them to admit that it was correct. He calculated that this formalization effort would take around twenty man-years"
(that effort is ongoing at http://code.google.com/p/flyspeck/wiki/FlyspeckFactSheet)