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 11:52:20 UTC · snapshot created 2026-10-03 11:53:41 UTC · last check 2026-10-03 13:50:10 UTC

CMP.3:3 - Forces

ForceWhat must be reconciled
Sharing and distinctionsA coarse reuse key saves work but can conflate different continuations.
Demand and predictable orderComputing only requested states avoids unused work; a regular order can simplify access and scheduling.
Time and storageRetaining values avoids computation but can exhaust memory or increase data movement.
Value and witnessA small working table can retain the optimum value while losing the path attaining it.
Reuse and changeAn answer remains usable only while the data and conditions on which it depends still apply.
Mathematical equality and execution effectsRepeating a pure calculation and repeating an observation or state change can produce different behavior.