Algorithmic Triad - The Basic Concepts Of Algorithms
TECTechnics Classroom   TECTechnics Overview

Algorithmic Triad - The Basic Concepts Of Algorithms

Figure 117.1 illustrates the conceptual essence of algorithms. Assuming a problem has been properly defined, What is meant by Algorithmic Triad.

The strings: S7P3A32 (Force - Push).

The math:
Pj Problem of Interest is of type force (push and pull). Algorithm is the formal name assigned to the set of instructions used to solve a given problem. These instructions are essentially pull and push actions. The push actions are dominant (e.g instructions are pushed along to solution). Hence the Pj Problem of Interest is of type force-push.

Algorithms are at the heart of problem solving. They are the set of instructions used to solve problems. In essence they bridge problem conceptualization and definition to problem solution.

Specification of Input: means that the data members that constitute the ingredients needed for the solution of the problem must be specified.
Specification of Output: means that the products desired from the processing of the inputs must be specified.
Ambiguity Intolerance: means the operations involved in the processing of the input to produce the desired products must be unambiguous:
(a) The order in which the operations are performed must be given.
(b) At each step, the next operation must be unambiguously determined (deterministic). Non-deterministic algorithms are of theoretical importance but are not implied in the algorithmic triad which focuses on computational algorithm..
(c) The number of operations, including repetitions must be finite.

Blessed are they that have not seen, and yet have believed. John 20:29