Mixing Computations and Proofs

Michael J. Beeson · 2014

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.

Read the paper · More papers on PaperTik