fpf.tools
Library / Foundational Thinking DPF Suite
DPF

Computational Thinking DPF

14 patterns · 340 sections · 0.3 MB

Search this publication Original Markdown

Link to current text

Table of contents

Patterns · All sections
  1. CMP.1CMP.1 - Solve One Problem through Another or Transfer a Limit (Computational Reduction)
  2. CMP.2CMP.2 - Derive a Recursive Procedure from a Problem Decomposition
  3. CMP.3CMP.3 - Share and Schedule Repeated Subcomputations
  4. CMP.4CMP.4 - Construct Computational Search with Justified Exclusions
  5. CMP.5CMP.5 - Bound an Optimum or Recover a Feasible Candidate through a Relaxed Problem
  6. CMP.6CMP.6 - Derive an Iterative Computational Update from Local Information
  7. CMP.7CMP.7 - Construct a Learner from Examples and Feedback
  8. CMP.8CMP.8 - Construct an Approximate Computation with Controlled Error
  9. CMP.9CMP.9 - Construct a Randomized Estimator or Sampling Procedure
  10. CMP.10CMP.10 - Choose a Computational Representation for Its Access and Update Operations
  11. CMP.11CMP.11 - Derive a Computational Lower Bound from Indistinguishable Inputs
  12. CMP.12CMP.12 - Construct an Interpreter or a Meaning-Preserving Translation
  13. CMP.13CMP.13 - Construct a Computational Abstraction for the Property Being Asked
  14. CMP.14CMP.14 - Compose Interacting Computations through Their Required Observations

Showing 1–14 of 14 entries. Source edition 1f16950577d0.