Applied theory of algorithms
The standard form of presentation of algorithms such as Markov normal algorithm, due to their extremely high level of detail suitable for engineering practice. Turing machine is a convenient abstract model of any person or algorithm computing machine, but in the real world any kind of memory and time of operation is not infinite, but rather strictly limited. However, if the development and implementation of specific algorithms in engineering practice enough to go out of their general properties.
Applied theory of algorithms itself little concern about the existence of algorithms, it directs its efforts primarily on developing the most effective methods for their description, conversion and implementation. Algorithm as a set of interconnected operators that reflect the basic set of operations transformation projects. Methods of operators are strictly defined (usually operators are some of the algorithms), and in particular the implementation of the algorithm are set as initial value data and parameters that are included in the description of the operators.
To describe the algorithms use different methods to different degrees of detail and formalized. The theoretical description is given in a formalized form, which - without any details to substantiate the procedure, as the proposed algorithm. For visual presentation structure algorithms are widely used graphical tools: graphs, diagrams, network. A formal and complete description of the algorithms perform on specially developed for this purpose algorithmic languages, it contains all the necessary information to implement the algorithm, not directly related to specific features of computers. Machine implementation of the algorithm requires its translation into the language of a particular machine in a program. The role of automatic translation of algorithmic languages have a special software compilers. Often a general description of the algorithm is directly translated into machine language decryption algorithm operators in computers.
In contrast to the general theory of algorithms applied theory considers not only deterministic but probabilistic (statistical) and heuristic algorithms. In the latter case than deterministic or statistically defined rules algorithm also includes substantial indications of the direction of sensible process.
The standard form of presentation of algorithms such as Markov normal algorithm, due to their extremely high level of detail suitable for engineering practice. Turing machine is a convenient abstract model of any person or algorithm computing machine, but in the real world any kind of memory and time of operation is not infinite, but rather strictly limited. However, if the development and implementation of specific algorithms in engineering practice enough to go out of their general properties.
Applied theory of algorithms itself little concern about the existence of algorithms, it directs its efforts primarily on developing the most effective methods for their description, conversion and implementation. Algorithm as a set of interconnected operators that reflect the basic set of operations transformation projects. Methods of operators are strictly defined (usually operators are some of the algorithms), and in particular the implementation of the algorithm are set as initial value data and parameters that are included in the description of the operators.
To describe the algorithms use different methods to different degrees of detail and formalized. The theoretical description is given in a formalized form, which - without any details to substantiate the procedure, as the proposed algorithm. For visual presentation structure algorithms are widely used graphical tools: graphs, diagrams, network. A formal and complete description of the algorithms perform on specially developed for this purpose algorithmic languages, it contains all the necessary information to implement the algorithm, not directly related to specific features of computers. Machine implementation of the algorithm requires its translation into the language of a particular machine in a program. The role of automatic translation of algorithmic languages have a special software compilers. Often a general description of the algorithm is directly translated into machine language decryption algorithm operators in computers.
In contrast to the general theory of algorithms applied theory considers not only deterministic but probabilistic (statistical) and heuristic algorithms. In the latter case than deterministic or statistically defined rules algorithm also includes substantial indications of the direction of sensible process.
No comments:
Post a Comment