Library / Computational Thinking DPF
Jump to passage
In this reading

Link to current text

Published source confirmed at last check

Source changed 2026-10-03 08:25:59 UTC · snapshot created 2026-10-03 08:26:43 UTC · last check 2026-10-03 09:10:20 UTC

CMP.9:3 - Forces

ForceWhat must be reconciled
Accessible randomness and target lawThe easiest draws may have different probabilities from those the task needs.
Broad coverage and informative samplesOversampling useful regions helps only with an appropriate correction and retained support.
Cheap transitions and useful informationCorrelated steps may be inexpensive but add little information.
Unknown stream length and fixed storageA representative sample must remain valid as unseen records arrive.
Adaptive effort and stated errorStopping according to observed values changes some uncertainty guarantees.
Reproducibility and independent repetitionsReusing a seed repeats a calculation; it does not create another independent draw.