Name
Abstract | ||
|---|---|---|
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. |
Year | Venue | Field |
|---|---|---|
2016 | JOURNAL OF FORMALIZED REASONING | Discrete mathematics,Algorithm,Mathematical proof,Mathematics,Computation,Formal proof |
DocType | Volume | Issue |
Journal | 9 | 1 |
ISSN | Citations | PageRank |
1972-5787 | 1 | 0.35 |
References | Authors | |
15 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael Beeson | 1 | 22 | 4.09 |