Primer año de posgradoComputationPlanificado
Computational reproducibility
Making computational mathematics checkable by others: version control, pinned environments, tests, notebooks, random seeds and data provenance, and reporting results honestly as exact, numerical, statistical or experimental evidence.
math.comp.computational-reproducibility
La lección de este tema todavía no se ha escrito. El esquema siguiente forma parte del mapa del plan de estudios y no ha sido revisado.
Se basa en
Requisitos previos obligatorios, hasta el fondo: 40
Aprenderás a
- Package a computation with pinned dependencies, tests and a single command that reproduces its results.
- Classify a computational claim as exact, numerical, statistical or experimental, and state its limitations.
- Archive code and data with persistent identifiers, and cite software properly.
Definición
- A computation is reproducible if others can obtain the same results from the same code, data and environment.
- A pinned environment fixes the exact versions of all software dependencies.
- Exact computation (integer or symbolic arithmetic) differs from floating-point approximation, whose results need error bounds to be meaningful.
Teorema
- Floating-point results can differ between hardware and library versions, so tolerances must be stated.
- A computer-assisted proof depends on the correctness of its code; formal verification or independent reimplementation strengthens the claim.
Errores frecuentes
- Thinking a notebook that ran once is reproducible.
- Reporting agreement to many digits as if it were proof.
Descubrimientos opcionales
- Formalising published mathematics Formal verification is the strongest form of reproducibility for proofs, including computer-assisted ones.
- ← Statistical inference