Jump to text
On this page
Copy and source
Original source · lines 47–58
Published source confirmed at last check

Source changed 2026-11-16 21:18:08 UTC · snapshot created 2026-11-16 21:19:40 UTC · last check 2026-11-17 19:45:20 UTC

Part A - Construct an algorithm

§ID & TitleStatusKeywords & Search QueriesDependencies
1CMP.1 - Solve One Problem through Another or Transfer a Limit (Computational Reduction)Stablereduction; solver reuse; input conversion; answer recovery; computability; complexity. Can this problem be solved through another one, and in which direction does a limit transfer?C.29.2 for the required answer and computational model; MATH.17/.18 for composition and interpretation.
2CMP.2 - Derive a Recursive Procedure from a Problem DecompositionStablerecursion; decomposition; induction; sufficient return; termination. What must smaller problems return so that their answers construct the required whole?MATH.4/.12 for inductive or extracted constructions; C.29.2 for the computational formulation.
3CMP.3 - Share and Schedule Repeated SubcomputationsStablememoization; dynamic programming; sharing; dependency order; effects; storage; recomputation. Which repeated subcomputations can share an answer, in what order, and what should be retained or recomputed within the memory limit?CMP.2 for the recurrence; CMP.10 for representation and operation costs.
4CMP.4 - Construct Computational Search with Justified ExclusionsStablesearch; branch and bound; pruning; witness; completeness; interruption. Which alternatives can be excluded while preserving the requested answer?MATH.20 for bounds; CMP.5 for relaxation; MMP.10 for a subject constraint formulation when needed.
5CMP.5 - Bound an Optimum or Recover a Feasible Candidate through a Relaxed ProblemStablerelaxation; feasible recovery; upper and lower bounds; approximation. How can an easier problem improve or bound an answer to the original problem?MATH.20 for comparison; CMP.4 for bounded search; CMP.8 for controlled approximation.
6CMP.6 - Derive an Iterative Computational Update from Local InformationStablelocal search; iterative update; neighborhood; step choice; noisy feedback; stopping. What does an admissible local change improve, and what follows on stopping?MATH.10/.20/.21 for variation, bounds or convergence; CMP.7 for learning that needs an update.
7CMP.7 - Construct a Learner from Examples and FeedbackStablelearning algorithm; rule class; inductive restriction; feedback; training fit; generalization. Which rule should examples select, and what supports its further use?CMP.4/.6 for selection or updating; MMP.7 for a modeled data source; C.11.DUA for consequential additional inquiry.