DS-theory as a prototype of the theory of applied algorithms

Abstract

The notion of the decomposition scheme as a core for DS-theory is proposed and described here. The notions of clump-property and algorithmic dependence are also described. Decomposition scheme is proposed to be used taking into account its algorithmic nature as the basis for building universal (canonical) algorithm. The questions of the canonical algorithm transformation into the specific application-oriented algorithms are discussed. The operations over the decomposition schemes which are itself operations over algorithms are described.