Pure function
Definition: A computation whose output depends only on explicit inputs and that produces no hidden side effects.
Why it matters here: In Reproducible Coding and Environments, Pure function is needed to reason about pure functions, pinned environments, tests, notebooks, and manifests rather than merely label the phenomenon.
Relationship: It is interpreted alongside Pinned environment and the lecture relation below; identify which quantities are observed, calibrated, or model-derived.
Limitation or common confusion: Reproducibility is testable when expected inputs and outputs are explicit.
\(f(data;code,dependencies,seed)->result+metadata\)
Pinned environment
Definition: A dependency specification fixing versions sufficiently to recreate the software context.
Why it matters here: In Reproducible Coding and Environments, Pinned environment is needed to reason about pure functions, pinned environments, tests, notebooks, and manifests rather than merely label the phenomenon.
Relationship: It is interpreted alongside Invariant test and the lecture relation below; identify which quantities are observed, calibrated, or model-derived.
Limitation or common confusion: Reproducibility is testable when expected inputs and outputs are explicit.
Invariant test
Definition: A check of a property that should remain true across valid inputs or refactoring.
Why it matters here: In Reproducible Coding and Environments, Invariant test is needed to reason about pure functions, pinned environments, tests, notebooks, and manifests rather than merely label the phenomenon.
Relationship: It is interpreted alongside Random seed and the lecture relation below; identify which quantities are observed, calibrated, or model-derived.
Limitation or common confusion: Reproducibility is testable when expected inputs and outputs are explicit.
Random seed
Definition: A recorded initializer that makes a pseudorandom computational path repeatable.
Why it matters here: In Reproducible Coding and Environments, Random seed is needed to reason about pure functions, pinned environments, tests, notebooks, and manifests rather than merely label the phenomenon.
Relationship: It is interpreted alongside Notebook execution order and the lecture relation below; identify which quantities are observed, calibrated, or model-derived.
Limitation or common confusion: Reproducibility is testable when expected inputs and outputs are explicit.
Notebook execution order
Definition: The dependency sequence among interactive cells, which must be reproducible from a clean state.
Why it matters here: In Reproducible Coding and Environments, Notebook execution order is needed to reason about pure functions, pinned environments, tests, notebooks, and manifests rather than merely label the phenomenon.
Relationship: It is interpreted alongside Pure function and the lecture relation below; identify which quantities are observed, calibrated, or model-derived.
Limitation or common confusion: Reproducibility is testable when expected inputs and outputs are explicit.