Randomization, persuasiveness and rigor in proofs (Q1408656)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1985794
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Randomization, persuasiveness and rigor in proofs |
scientific article; zbMATH DE number 1985794 |
Statements
Randomization, persuasiveness and rigor in proofs (English)
0 references
25 September 2003
0 references
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.
0 references
randomization
0 references
persuasiveness
0 references
0.7622885704040527
0 references
0.7497517466545105
0 references
0.7395482063293457
0 references
0.7372018098831177
0 references
