Mixing Computations and Proofs

Michael Beeson
2014 Journal of Formalized Reasoning  
We examine the relationship between proof and computation in mathematics, especially in formalized mathematics. We compare the various approaches to proofs with a significant computational component, including (i) verifying the algorithms, (ii) verifying the results of the unverified algorithms, and (iii) trusting an external computation.
doi:10.6092/issn.1972-5787/4552 dblp:journals/jfrea/Beeson16 fatcat:ieften5wunhnnesihejategbku