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.
@article{4552,
title = {Mixing Computations and Proofs},
journal = {Journal of Formalized Reasoning},
volume = {9},
year = {2016},
doi = {10.6092/issn.1972-5787/4552},
language = {EN},
url = {http://dml.mathdoc.fr/item/4552}
}
Beeson, Michael. Mixing Computations and Proofs. Journal of Formalized Reasoning, Tome 9 (2016) . doi : 10.6092/issn.1972-5787/4552. http://gdmltest.u-ga.fr/item/4552/