The completeness of the algorithm algebra with data
The completeness of the algorithm algebra with data is shown which is intended for coordinated design of control flow and processed data is shown. The feasibility of an implementation of a control-driven and a data-driven algorithm development using both ascending and descending design strategies is...
Saved in:
| Date: | 2018 |
|---|---|
| Main Authors: | Akulovskiy, V.G., Doroshenko, А.Yu., Yatsenko, O.A. |
| Format: | Article |
| Language: | Russian |
| Published: |
PROBLEMS IN PROGRAMMING
2018
|
| Subjects: | |
| Online Access: | https://pp.isofts.kiev.ua/index.php/ojs1/article/view/207 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Problems in programming |
| Download file: | |
Institution
Problems in programmingSimilar Items
-
The construction and transformation of operations and some algorithmic designs of algorithms’ algebra with the data
by: Doroshenko, A.Yu., et al.
Published: (2025) -
Algebra of algorithms with the data and forecasting of computing process
by: Doroshenko, A.Yu., et al.
Published: (2025) -
Description of parallelism in algorithms of information management systems using algebraic apparatus
by: Akulovsky, V.G., et al.
Published: (2025) -
About the method of projecting abstract data type at the algebra of algorithmic
by: Doroshenko, A.Yu., et al.
Published: (2018) -
Means of parametrically controlled generation of algorithms on the basis of algebra of hyperscales
by: Yatsenko, O.A.
Published: (2015)