Computational Thinking DPF

A pattern language for constructing, understanding, analyzing and transforming algorithms, including their interpretation and interaction.

• Author: Anatoly Levenchuk, with AI-assisted development and review
• Version: 20 September 2026
• Status: Eternal alpha: a repertoire open to correction and extension.
• License: © 2026 Anatoly Levenchuk. Original framework text: Creative Commons Attribution 4.0 International (CC BY 4.0). Cited sources retain their own terms.
• Publication: FPF ecosystem repository

Computational Thinking here means algorithmics within computer science. Begin with a question about how to obtain an answer, maintain a required behavior, or change a procedure. Use the Table of Contents to find a relevant method, then open its Problem frame, Solution, worked cases and checklist. The Readme follows worked connections between methods; the Preface explains their rationale, prerequisites and limits.

The reference code CMP names this DPF. Its numbers are stable pattern addresses; § shows position within a Part. Numerical algorithms are one application alongside symbolic, discrete, randomized and learning procedures. A computing device enters when its operations or physical limits matter to the algorithm or its realization.

This publication belongs to the Foundational Thinking DPF Suite. Its Reference explains the mathematical, physical, computational and methodological connections. References such as C.29.2 and B.5.MPC name patterns in FPF Core. Open a supplier when its contribution is needed; revisit a receiving conclusion when that contribution changes.

To cite this edition: Anatoly Levenchuk, Computational Thinking DPF, FPF ecosystem repository. Include the version date shown above.