Kolmogorov's legacy: Algorithmic Theory of Informatics and Kolmogorov Programmable Technology

In this survey, we explore Andrei Nikolayevich Kolmogorov's seminal work in just one of his many facets: its influence Computer Science especially his viewpoint of what herein we call 'Algorithmic Theory of Informatics.' Can a computer file 'reduce' its 'size' if we add to it new symbols? Do equations of state like second Newton law in Physics exist in Computer Science? Can Leibniz' principle of identification by indistinguishability be formalized? In the computer, there are no coordinates, no distances, and no dimensions; most of traditional mathematical approaches do not work. The computer processes finite binary sequences i.e. the sequences of 0 and 1. A natural question arises: Should we continue today, as we have done for many years, to approach Computer Science problems by using classical mathematical apparatus such as 'mathematical modeling'? The first who drew attention to this question and gave insightful answers to it was Kolmogorov in 1960s. Kolmogorov's empirical postulate about existence of a program that translates 'a natural number into its binary record and the record into the number' formulated in 1958 represents a hint of Kolmogorov's approach to Computer Science. Following his ideas, we interpret Kolmogorov algorithm, Kolmogorov machine, and Kolmogorov complexity in the context of modern information technologies showing that they essentially represent fundamental elements of Algorithmic Theory of Informatics, Kolmogorov Programmable Technology, and new Komputer Mathematics i.e. Mathematics of computers.

[1]  Vladimir I. Arnold.  Complexity of finite sequences of zeros and ones and geometry of finite spaces of functions , 2006 .

[2]  A. N. Shiryayev,et al.  Three Approaches to the Definition of the Notion of Amount of Information , 1993 .

[3]  Jean-Claude Simon.  Patterns and Operators: The Foundations of Data Representation , 1986 .

[4]  V. Tikhomirov.  On the Representation of Continuous Functions of Several Variables as Superpositions of Continuous Functions of a Smaller Number of Variables , 1991 .

[5]  Klaudia Frankfurter.  Patterns And Operators The Foundations Of Data Representation , 2016 .

[6]  S. Levashkin,et al.  Data Semantic Associative Analysis and Synthesis ♥ , 2010 .

[7]  Adolfo Guzman,et al.  Kolmogorov's Theory of Computer Science , 2016, IEEE Latin America Transactions.

[8]  Alistair Black,et al.  Information history , 2006, Annu. Rev. Inf. Sci. Technol..

[9]  Matilde Marcolli,et al.  Kolmogorov complexity and the asymptotic bound for error-correcting codes , 2012, ArXiv.

[10]  F. H. Adler.  Cybernetics, or Control and Communication in the Animal and the Machine. , 1949 .

[11]  A. N. Shiryayev.  The Combinatorial Foundations of Information Theory and the Probability Calculus , 1993 .

[12]  Harry E. Burke.  Handbook of Bar-Coding Systems , 1984 .

[13]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[14]  J. Rivera.  The Information . A History , a Theory , a Flood , 2013 .

[15]  E Weinan,et al.  Deep Learning-Based Numerical Methods for High-Dimensional Parabolic Partial Differential Equations and Backward Stochastic Differential Equations , 2017, Communications in Mathematics and Statistics.