Journal of Formalized Reasoning (Jan 2016)

Mixing Computations and Proofs

  • Michael Beeson

DOI
https://doi.org/10.6092/issn.1972-5787/4552
Journal volume & issue
Vol. 9, no. 1
pp. 71 – 99

Abstract

Read online

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.

Keywords