Ensuring the Correctness of Computational Results by Making Them Independently Checkable
- Time: 14:00 - 15:30
- Address: Sokolovská 83, Praha
- Room: K3
- Speaker: Stefan Ratschan
A wide-spread method for ensuring correctness of mathematical software is based on transparency: lay open the code itself, the underlying algorithms, mathematical analysis, and proofs. This may be very useful, but in some contexts not possible, for example, due to proprietary code. It may also not be economical, for example, due to sheer size and complexity of the involved code and mathematical arguments. In the talk I will discuss examples of how such problems can be avoided by making computational results independently checkable, ensuring their correctness without any dependence on the way they were actually obtained.