Quick and Dirty Refereeing?
暂无分享,去创建一个
Mathematical proofs can run into hundreds of pages, making it extremely difficult to check whether they are correct. In his Perspective, [Sudan][1] asks whether methods developed by theoretical computer scientists may help to verify mathematical proofs. The approach enables the probabilistic checking of proofs by reading just a few bits. However, the proofs need to be written in a specific new format. Mathematicians may not find the method useful, because they expect more insights from proofs than just their correctness, but the new methods may find use in the verification of the correct execution of computer programs.
[1]: http://www.sciencemag.org/cgi/content/full/301/5637/1191
[1] George G. Szpiro,et al. Mathematics: Does the proof stack up? , 2003, Nature.
[2] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[3] Venkatesan Guruswami,et al. Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.
[4] Daniel A. Spielman. Linear-time encodable and decodable error-correcting codes , 1996, IEEE Trans. Inf. Theory.