Sequential methods and algorithms

Abstract

The research aims to investigate the application and applicability of sequential methods and algorithms. The content of the concept of sequentiality is disclosed. Its polysemy and application in programming are shown. The notions of logical algorithm and sequential algorithm are introduced. The difference between sequential and logical algorithms is shown. A comparison with deterministic algorithms is given. The principles of logical algorithms and sequential algorithms are described. Common is a step-by-step calculation. However, the link of sequential algorithms is more complex and represents a multigraph. Similarities and differences between sequential algorithms and computational networks are shown. Sequential algorithms can be considered as integrated technological systems. The research shows that the application of sequential algorithms allows solving a larger number of problems that logical program algorithms do not solve. The research gives criteria for the applicability of logical and sequential algorithms