The Cognitive Toolkit of Programming - Algorithmic Abstraction, Decomposition-Superposition

Oct 15, 2026

Uploaded by Rizky

Programming problem-solving involves conscious and unconscious cognitive operations through an iterative, schema-based refinement process. As the programmer adjusts the problem to prior experience-derived schemas, understanding and definition become progressively clearer. The core operations used to build refining models include language abstraction, analogy, algorithmic abstraction, decomposition-superposition, conversion, intuition, and variation. The paper highlights algorithmic abstraction and clarifies the essence of decomposition-superposition as a key element-pair in the cognitive toolkit of programming.

LanguageEnglish

CategoryResearch & Report

FormatPDF

Pages8

Reading Time20 min

AccessFree to download

The Cognitive Toolkit of Programming

Algorithmic abstraction

Programming theorems and analogy base

Table 1: The structure of programming theorems

THE COGNITIVE TOOLKIT OF PROGRAMMING– ALGORITHMIC ABSTRACTION, DECOMPOSITION-SUPERPOSITION Péter Szlávi, László Zsakó Abstract: As a programmer when solving a problem, a number of conscious and unconscious cognitive operations are being performed. Problem-solving is a gradual and cyclic activity; as the mind is adjusting the problem to its schemas formed by its previous experiences, the programmer gets closer and closer to understanding and defining the problem. The primary cognitive operations the programmer uses to set up refining models are: language abstraction, analogy, algorithmic abstraction, decomposition-superposition, conversion, intuition, and variation. In our paper we are shedding new light on algorithmic abstraction, while explaining the es-sence of decomposition-superposition, a key element-pair in the cognitive toolkit of program-ming. Key words: programming [~68N01], didactics [~00A35], systemic thinking [~97C30,~97C70], cognitive toolkit [~97Q30], algorithmic abstraction, decomposition, superposition 1. The Cognitive Toolkit of Programming As a programmer when solving a problem, a number of conscious and unconscious cognitive operations are being performed. Problem-solving is a gradual and cyclic activity; as the mind is adjusting the problem to its schemas formed by its previous experiences, the programmer gets closer and closer to understanding and defining the problem. We can say that programming is the series of the problem’s models, based on finer and finer schemas, which need to be elaborated until the basis of the model is the vocabulary, or the set of instruction schemas, of the given programming language (Figure 1) . The primary cognitive operations the programmer uses to set up refining models are the following: 􀁸 language abstraction [1], 􀁸 analogy [1], 􀁸 algorithmic abstraction, 􀁸 decomposition-superposition, 􀁸 conversion, 􀁸 intuition, 􀁸 and variation. The programmer applies these tools a number of times, for a number of reasons. This is why we will have to mention the given tools more than once. In our paper we are shedding new light on the well-known notion of algorithmic abstraction, while explaining the essence of decomposition–superposition, a key element-pair in the cognitive toolkit of programming. Our article closely connects to the argumentation started in [1] . Figure 1. The abstract model of programming 2. Algorithmic abstraction The programmer makes use of the cognitive tool of generalization many times and in manifold ways while programming. One of these ways is analogy-based thinking, which we have examined extensively in [1,2] in connection with problem schemas. We have found that analogy-based thinking can be facilitated if we elaborate and introduce well chosen schemas. Since schemas are the results of abstraction, we need to analyze them from this aspect as well. If we want to save memory, we can create the starting set of analogies by generalizing and abstracting numerous specific problems that are similar, together with their solutions. That is, we highlight their similarity while eliminating their difference, for the sake of finding the “common ancestor,” the abstract core. 1 The elements of the analogy base are an abstract problem and the optimal solution. This thought leads us to the notion of programming theorems: abstract problem + abstract algorithm + verification. We do not need to keep verification in mind all the time; it is enough to perform it only upon introducing the theorem. Just as scientists do when using certain theorems: they check first the conditions and the goal of the research, then accept the truthfulness of the theorems to use without further examination. Needless to say, in public education verification is performed without any sort of formalism, just by common sense; however, it needs to take place, as it facilitates the understanding of how the algorithm and the problem are related. Table 1 provides an exa

FAQs

What cognitive operations does the programmer use to build refining models?

The paper identifies language abstraction, analogy, algorithmic abstraction, decomposition-superposition, conversion, intuition, and variation as primary operations used to set up refining models.

How does the paper explain algorithmic abstraction?

Algorithmic abstraction is discussed as a generalization process connected to analogy-based thinking and problem schemas, where abstract cores are formed by eliminating differences among similar problems.

What is decomposition-superposition in the cognitive toolkit?

Decomposition-superposition is presented as an essential element-pair in the cognitive toolkit of programming, and the paper emphasizes its essence while shedding new light on algorithmic abstraction.

Oct 15, 2026

Uploaded by Rizky