Probabilistically checkable proofs
Can a proof be checked without reading it? That certainly seems impossible, no matter how much reviewers of mathematical papers may wish for this. But theoretical computer science has shown that we can get very close to this objective! Namely random consistency checks could reveal errors in proofs,...
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Association for Computing Machinery,
2010-03-04T19:32:53Z.
|
| Subjects: | |
| Online Access: | Get fulltext |