What is the nature of Algorithm?
The nature of Algorithm is as follows:
Divisibility[]
Algorithm has divisibility and it can be divided into things called the parts of Algorithm.
- What are the parts of Algorithm?
Comparability[]
Algorithm has the equivalents of those which the others have, that is, it has comparability.
- What is comparable to Algorithm?
Connectivity[]
Algorithm has connectivity and it can be connected to those from which it can be separated.
- What is connected by Algorithm?
Sensitivity[]
Algorithm has sensitivity and it is sensitive to things which can affect (influence) it.
- What can affect Algorithm?
Transformability[]
Algorithm has transformability and it can be transformed (reordered) from one form to its other forms.
- What are the forms of Algorithm?
Substitutability[]
Algorithm has substitutability and it can be substituted by the things which qualify to substitute it.
- What can substitute for Algorithm?
Satisfiability[]
Algorithm has satisfiability and it can satisfy those which require it.
- What is in need of Algorithm?
See also the nature of:[]
|
|
This wiki is based on the theory of Sivashanmugam. You can download it here File:Tos.pdf