Algorithms As Expressions Of Pj Problems

Peter Oye Sagay

An algorithm is a set of directives that together lead to the solution of a problem. The directives may be ordered or unordered, or composed of subsets of ordered and unordered directives. The order of the directives only refers to the actions mandated by the directives and not to the residences of the materials or information needed to carry-out the actions. In the case of unordered directives, the solution of the problem is not dependent on the order of the actions mandated by the directives.

The Language used to express an algorithm; the work expressed by the actions mandated by the directives; the containership and identity of the materials, data or information used to carry-out the actions; are expressions of Pj Problems. Consequently, algorithms are expressions of Pj Problems.

For Knowledge Sake, One Code (SiPjAjk) For All Knowledge TECTechnics Overview

What is Time?
St Augustine On Time
Bergson On Time
Heidegger On Time
Kant On Time
Sagay On Time
What is Space?
Newton On Space
Space Governance
Imperfect Leaders
Essence Of Mathematics
Toolness Of Mathematics
The Number Line
The Windflower Saga
Who Am I?
Primordial Equilibrium
Primordial Care
Force Of Being

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

TECTechnic Logo, Kimberlee J. Benart | © 2000-2020 | All rights reserved | Founder and Site Programmer, Peter O. Sagay.