fpf.tools
DPF

Computational Thinking DPF

15 patterns · 366 sections

Choose a heading to read that text in full, or open the complete publication.

Read full textSearch this publicationOriginal Markdown

Table of contents

Overview · All sections
  1. Computational Thinking DPF
  2. Table of Contents
  3. Public units
  4. Part A - Construct an algorithm
  5. Part B - Control error and computational cost
  6. Part C - Interpret, transform and compose computations
  7. Computational Thinking - Readme
  8. Practical entries
  9. CP-INDEPENDENT-EXTENSIONS - A new data form and a new operation must work together
  10. CP-TRANSLATION-SCOPE - A translation works on test inputs; which executions does it preserve?
  11. CP-ANSWER-UNDER-LIMITS - Obtain the answer the work needs within available resources
  12. CP-RETRY-AND-RECOVER - Share calculations without merging requests or repeating their effects
  13. Computational Thinking DPF Architectural Reference
  14. CMP.Reference:1 - Problem frame and the algorithmic difficulty
  15. CMP.Reference:2 - Forces that shape the construction
  16. CMP.Reference:3 - The methods and their connections
  17. CMP.Reference:3.1 - Construct an algorithm
  18. CMP.Reference:3.2 - Control error and computational cost
  19. CMP.Reference:3.3 - Interpret, transform and compose computations
  20. CMP.Reference:3.4 - Constituent actions in ongoing work
  21. CMP.Reference:4 - Worked connection - One best selection becomes every best selection
  22. CMP.Reference:5 - Use checks, assumptions and recurring failures
  23. CMP.Reference:6 - Consequences and Architectural Rationale
  24. CMP.Reference:7 - Shared sources, alternatives and relations
  25. CMP.Reference:End
  26. Part A - Construct an algorithm
  27. CMP.1CMP.1 - Solve One Problem through Another or Transfer a Limit (Computational Reduction)
  28. CMP.1:1 - Problem frame
  29. CMP.1:2 - Problem
  30. CMP.1:3 - Forces
  31. CMP.1:4 - Solution
  32. CMP.1:4.1 - Specify the two problems and the intended conclusion
  33. CMP.1:4.2 - Construct a query without solving the original problem
  34. CMP.1:4.3 - Construct answer recovery and establish correctness
  35. CMP.1:4.4 - Follow the direction of the consequence
  36. CMP.1:4.5 - Derive the cost that can change the choice
  37. CMP.1:4.6 - Return a usable construction or a bounded limit
  38. CMP.1:5 - Archetypal Grounding
  39. CMP.1:5.1 - Solve difference constraints through a graph problem
  40. CMP.1:5.2 - An event decider would decide halting
  41. CMP.1:5.3 - A small description can create an expensive search
  42. CMP.1:5.4 - Recover a witness through adaptive decision queries
  43. CMP.1:6 - Bias-Annotation
  44. CMP.1:7 - Conformance Checklist
  45. CMP.1:8 - Common Anti-Patterns and How to Avoid Them
  46. CMP.1:9 - Consequences
  47. CMP.1:10 - Architectural Rationale
  48. CMP.1:11 - SoTA-Echoing
  49. CMP.1:12 - Relations
  50. CMP.1:End
  51. CMP.2CMP.2 - Derive a Recursive Procedure from a Problem Decomposition
  52. CMP.2:1 - Problem frame
  53. CMP.2:2 - Problem
  54. CMP.2:3 - Forces
  55. CMP.2:4 - Solution
  56. CMP.2:4.1 - Fix the question and the available operations
  57. CMP.2:4.2 - Choose a decomposition by asking how answers would join
  58. CMP.2:4.3 - Strengthen the returned result when the join needs more
  59. CMP.2:4.4 - Supply base cases and a decreasing measure
  60. CMP.2:4.5 - Establish the result and expose its computational cost
  61. CMP.2:4.6 - Use the result and revisit the assumption that changed
  62. CMP.2:5 - Archetypal Grounding
  63. CMP.2:5.1 - A join that initially loses the answer
  64. CMP.2:5.2 - A subproblem obtained by a transformation
  65. CMP.2:6 - Bias-Annotation
  66. CMP.2:7 - Conformance Checklist
  67. CMP.2:8 - Common Anti-Patterns and How to Avoid Them
  68. CMP.2:9 - Consequences
  69. CMP.2:10 - Architectural Rationale
  70. CMP.2:11 - SoTA-Echoing
  71. CMP.2:12 - Relations
  72. CMP.2:End
  73. CMP.3CMP.3 - Share and Schedule Repeated Subcomputations
  74. CMP.3:1 - Problem frame
  75. CMP.3:2 - Problem
  76. CMP.3:3 - Forces
  77. CMP.3:4 - Solution
  78. CMP.3:4.1 - State what a subcomputation means
  79. CMP.3:4.2 - Define reuse by the answer the continuation needs
  80. CMP.3:4.3 - Construct the dependency graph and an evaluation order
  81. CMP.3:4.4 - Retain what remains live, and recompute selectively
  82. CMP.3:4.5 - Recover the value, witness or continuation actually requested
  83. CMP.3:4.6 - Compare the resulting procedure with the original
  84. CMP.3:5 - Archetypal Grounding
  85. CMP.3:5.1 - Obtain a sequence-editing answer without expanding repeated calls
  86. CMP.3:5.2 - Share an expression while preserving its interpretation
  87. CMP.3:6 - Bias-Annotation
  88. CMP.3:7 - Conformance Checklist
  89. CMP.3:8 - Common Anti-Patterns and How to Avoid Them
  90. CMP.3:9 - Consequences
  91. CMP.3:10 - Architectural Rationale
  92. CMP.3:11 - SoTA-Echoing
  93. CMP.3:12 - Relations
  94. CMP.3:End
  95. CMP.4CMP.4 - Construct Computational Search with Justified Exclusions
  96. CMP.4:1 - Problem frame
  97. CMP.4:2 - Problem
  98. CMP.4:3 - Forces
  99. CMP.4:4 - Solution
  100. CMP.4:4.1 - Define a partial choice and its completions

Showing 1–100 of 366 entries. Source edition 8c72429c9a07.