fpf.tools
Library / Computational Thinking DPF
Jump to passage
In this reading
Source · lines 1393–1400

Link to current text

Published source confirmed at last check

Source changed 2026-10-03 02:22:15 UTC · snapshot created 2026-10-03 03:38:22 UTC · last check 2026-10-03 03:45:20 UTC

CMP.6:12 - Relations

  • C.29.2: states the obtaining task, operations and resource conditions.
  • MATH.10: constructs admissible variations; MATH.20 supplies bounds; MATH.21 supplies convergence and finite-approximation reasoning.
  • CMP.4 and CMP.5: can provide alternative exploration, a relaxed update problem or a useful comparison bound.
  • CMP.7: uses updates in a learning algorithm while retaining a separate account of further-case performance.
  • C.11.DUA and the general improvement methods: select the value of additional computation, information or a more costly update.