Approach to systematization of algorithms

Бесплатный доступ

The paper offers a method of investigating algorithms from an ontological perspective. It explores various approaches to creating and defining algorithms. A point of view has been singled out, according to which the algorithm is not only a scheme for calculating, but an instrument for knowledge and knowledge transfer. The connection between algorithms and ontologies is grounded. The article provides systematic and categorical classification of algorithms. The article proposes the basis of generalization for two groups of algorithms: linear and nonlinear. These groups contain typical subgroups: direct algorithms, cyclic algorithms, stratified algorithms, iterative algorithms, incremental algorithms. Incremental algorithms are represented by two schemes: a sequential circuit and a spiral scheme. The article explores the sorting algorithm. The paper uses a topological and formal description of algorithms. This makes it possible to generalize and isolate the cognitive meaning of algorithms. The article notes the existence of algorithms for quantitative processing and qualitative analysis. The method of generalization equally applies to these types of algorithms. Paper recommends further study of algorithms as an instrument of knowledge and knowledge transfer.

Еще

Algorithms, ontologies, knowledge, generalization, topological models, formal models, incremental models

Короткий адрес: https://sciup.org/170178764

IDR: 170178764   |   DOI: 10.18287/2223-9537-2017-7-3-388-397

Статья научная