Re:Number theorist fears many proofs widely considered to be...
by MrBuddyCasino on Sunday September 29, 2019 @12:28PM
(#21107948)
Soo... Unit testing / CI for math proofs? If it can be done in software, great.
[ Parent
| on HN ]
Re:Number theorist fears many proofs widely considered to be...
by std_throwaway on Sunday September 29, 2019 @12:31PM
(#21107974)
To my knowledge the hard part is writing the input for the software. While in text you have a bit of leeway to glance over some details, with the computer program you must, indeed, write every last relevant detail down and you must get it right. This is very heavy work.
Re:Number theorist fears many proofs widely considered to be...
by ukj on Sunday September 29, 2019 @12:32PM
(#21107980)
But it's once-off work. Thereafter the computers can take over.
Re:Number theorist fears many proofs widely considered to be...
by jetzzz on Sunday September 29, 2019 @01:25PM
(#21108308)
It's actually type checking. Per the Curry–Howard correspondence, proof checking is equivalent to type checking, just for much more sophisticated type system than in an ordinary programming language.
Re:Number theorist fears many proofs widely considered to be...
by jeff_friesen on Sunday September 29, 2019 @12:44PM
(#21108048)
I was thinking it's a lot like property-based testing