DS-theory as a prototype of the theory of applied algorithms
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 (cano...
Saved in:
Date: | 2018 |
---|---|
Main Author: | Kolesnyk, V.G. |
Format: | Article |
Language: | rus |
Published: |
Інститут програмних систем НАН України
2018
|
Subjects: | |
Online Access: | https://pp.isofts.kiev.ua/index.php/ojs1/article/view/35 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Journal Title: | Problems in programming |
Institution
Problems in programmingSimilar Items
-
DS-theory. Presentation of canonical algorithm by means of algorithmic language
by: Kolesnyk, V.G.
Published: (2017) -
DS-theory. Research of R-data division factors in order to generate applied algorithms. Part 2
by: Kolesnyk, V.G.
Published: (2017) -
DS-theory. The research of P-data factors formating
by: Kolesnyk, V.G.
Published: (2018) -
DS-theory. Scientific aspects and prospects for development
by: Kolesnyk, V.G.
Published: (2018) -
DS-theory. Research of R-data division factors in order to generate applied algorithms. Part 1
by: Kolesnyk, V.G.
Published: (2017)