Computational Thinking DPF
DocID: CMP within FPF Library.
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: 24 October 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 Library repository
Computational Thinking here means algorithmics within computer science: reasoning about effective ways to obtain and transform representations and to maintain required behavior. Begin with what the work needs to obtain or do, even when no algorithmic problem has yet been recognized. The Readme shows how to enter that inquiry. The Architectural Reference explains computation, its grounds, and how the methods work together; the Table of Contents gives direct entries to their complete constructions. A description can itself be an input to an interpreter, translator, analyzer or learner. A useful computation can return an answer or continue responding to an environment.
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 (Foundational) 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 Library repository. Include the version date shown above.