scientific article; zbMATH DE number 2152635

From MaRDI portal
Publication:4664201





The author presents a useful summary of many of the key issues involved in the role of mathematical proofs in computer science: the use of proofs about computers and their programming or the use of computers in automatic theorem proving and checking. Issues of uncertainty in these latter areas, for example, can be fruitfully compared with the distinction between formal proof (a strict application of inference rules) and rigorous argument (a proof accepted by mathematicians). Hints are given of how important these abstract matters are for computer safety, security and general reliability. As the references indicate, the author has written more fully on all these topics elsewhere. In addition, the author appends a basic chronology of events from the 1955/56 Newell, Shaw, Simon Logic Theory Machine to the 1998 announcement of the computer-assisted proof of Kepler's conjecture by Thomas Hales. For the entire collection see [Zbl 1054.01001].











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4664201)