Randomization, persuasiveness and rigor in proofs (Q1408656)

The authors conclude that randomized algorithms (i.e. probabilistic procedures) are not only shorter than classical proofs, but they actually formalize the idea of inherent error in mathematical processes used to solve problems. Moreover, probabilistic procedures have the advantages of decreased length and feasibility, and also make clear how to deal with one set of epistemological worries while dealing with the other set by erecting a formalism allowing arbitrarily high certainty.