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 05:29:54 UTC · snapshot created 2026-10-03 05:30:57 UTC · last check 2026-10-03 06:50:10 UTC

CMP.8:3 - Forces

ForceWhat must be reconciled
Cheap computation and useful distinctionsCoarsening reduces work but can merge alternatives whose difference decides the answer.
Mathematical convergence and finite returnEventual convergence may supply neither an affordable stage nor a recognizable stopping condition.
Local error and composed errorA small loss at every operation can accumulate or be amplified downstream.
Objective quality and admissibilityAn excellent approximate objective value can accompany an infeasible returned object.
Precision and conditioningMore accurate arithmetic helps only the errors it controls.
Strong guarantees and obtaining costA computable conservative bound can be more useful than an inaccessible sharp one.