Methods of Ordering in Computer Sciences and Information Technologies

The purpose of the article is to analyze the known methods of ordering in computer science. The research methodology consists of methods of ordered pairs, relations, Gödel numbering, and Glushkov’s system of algorithmic algebras. The scientific novelty is to create a method of both description and transformation of orders. Conclusions. In the methods of ordered pairs, relations, Gödel numbering, mathematical logic, Post and Turing machines, and the modified system of Glushkov’s algorithmic algebras there is no possibility of equivalent transformations of orders which are available in algorithms