Jump to text
On this page
Copy and source
Original source · lines 21–77
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:15:10 UTC

Table of Contents

Public units

UnitTitleUse
ReadmeComputational Thinking - ReadmeFollow worked connections between algorithmic methods.
Architectural ReferenceComputational Thinking DPF Architectural ReferenceUnderstand the connected methods, their rationale, sources and limits.
CMP.Reference:1Problem frame and the algorithmic difficulty
CMP.Reference:1.1A description specifies a family of possible processes
CMP.Reference:1.2Mathematical, physical and algorithmic grounds cooperate
CMP.Reference:1.3Build a whole, introduce a level, and generalize deliberately
CMP.Reference:1.4Descriptions can be computed with, and ways can be obtained
CMP.Reference:1.5A computation can be part of a larger computational practice
CMP.Reference:1.6Use the grounds to choose and revise a method
CMP.Reference:2Forces that shape the construction
CMP.Reference:3The methods and their connections
CMP.Reference:3.1Construct an algorithm
CMP.Reference:3.2Control error and computational cost
CMP.Reference:3.3Interpret, transform and compose computations
CMP.Reference:3.4Constituent actions in ongoing work
CMP.Reference:4Worked connection - One best selection becomes every best selection
CMP.Reference:5Use checks, assumptions and recurring failures
CMP.Reference:6Consequences and Architectural Rationale
CMP.Reference:7Shared sources, alternatives and relations

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.

Part B - Control error and computational cost

§ID & TitleStatusKeywords & Search QueriesDependencies
1CMP.8 - Construct an Approximate Computation with Controlled ErrorStableapproximation; scaling; discretization; finite stopping; rounding; conditioning. How can a permitted error reduce computation while retaining the answer quality needed next?MATH.20/.21 for bounds and convergence; CMP.3/.10 for shared computation and representation.
2CMP.9 - Construct a Randomized Estimator or Sampling ProcedureStablerandomized algorithm; sampling; estimator; proposal; dependence; stopping time. Which random procedure supplies the required law or finite-run estimate?A supplied probability target, with MMP.7 where modeled; CMP.10 for access and storage.
3CMP.10 - Choose a Computational Representation for Its Access and Update OperationsStabledata structures; representation; queries; updates; conversion; arithmetic; memory. Which representation makes the required operations affordable?CMP.2/.3 for compositional summaries and shared work; MATH for preserved structure.
4CMP.11 - Derive a Computational Lower Bound from Indistinguishable InputsStablelower bound; adversary; indistinguishable inputs; decision tree; communication; error. What must every algorithm in this model observe or communicate?MATH.19/.20 for argument and bound; CMP.1 for reduction; C.29.2 for the cost model.

Part C - Interpret, transform and compose computations

§ID & TitleStatusKeywords & Search QueriesDependencies
1CMP.12 - Construct an Interpreter or a Meaning-Preserving TranslationStableinterpreter; compiler; semantics; binding; environment; control; observable behavior. How does an expression execute, and what must its translation preserve?MATH.5/.17/.18 for expression composition and interpretation; C.29.3 when realizing the primitives.
2CMP.13 - Construct a Computational Abstraction for the Property Being AskedStableabstract interpretation; reachable states; sound approximation; fixed point; refinement. Which cheaper computation supports this property, and can its counterexample occur?MATH.2/.18 for identification and interpretation; CMP.3/.4 for scheduling and exploration.
3CMP.14 - Compose Interacting Computations through Their Required ObservationsStableconcurrent algorithm; shared state; protocol; atomicity; interference; progress. Which interactions preserve the required whole behavior?CMP.3/.10/.12 for dependencies, representation and semantics; C.29.3 for implementation assumptions.
4CMP.15 - Compose Independent Extensions of Data Variants and OperationsStableexpression problem; independent extension; data variants; operations; open recursion; joining implementation; dispatch; separate compilation. How can separately added forms and operations work together without changing old modules?CMP.12 for interpretation; CMP.14 when interactions change observations; NOT.2 and NOT.3 for new expression structure and meaning.
5CMP.16 - Construct Computational Units and Operations for a Required WholeStablecomputational abstraction; units and operations; constructors; invariant; closure; refinement; composition. How can the units and allowed operations be changed together so that the required whole can be obtained and justified?C.29.2 for the computational question; MATH.17/.18 for composition and interpretation; CMP.2/.10/.12/.14 for recursive construction, storage, execution meaning and interaction.