论文标题
Kolmogorov的遗产：信息学算法理论和Kolmogorov的可编程技术
Kolmogorov's legacy: Algorithmic Theory of Informatics and Kolmogorov Programmable Technology
论文作者
论文摘要
在这项调查中，我们探索了安德烈·尼古拉耶夫·科尔莫格罗夫（Andrei Nikolayevich Kolmogorov）的开创性作品，这仅仅是他的许多方面之一：它的影响力科学，尤其是他对本文所谓的“信息学算法理论”的看法。 如果我们添加新符号，计算机文件可以“减少”其“大小”吗？计算机科学中的第二牛顿法律等国家方程是否存在？莱布尼兹（Leibniz）可以正式化识别原则吗？ 在计算机中，没有坐标，没有距离，也没有尺寸。大多数传统的数学方法不起作用。计算机处理有限的二进制序列，即0和1的序列。出现一个自然的问题：我们今天是否应该像我们多年来一样继续使用经典的数学设备来解决计算机科学问题，例如“数学建模”？第一个提请注意这个问题并给出有见地的答案的人是1960年代的Kolmogorov。科尔莫格罗夫（Kolmogorov）关于一个程序的存在，该程序的存在将“自然数字转化为二进制记录，并将记录转化为1958年制定的数字'，这表明了科尔莫格罗夫（Kolmogorov）的计算机科学方法。 遵循他的想法，我们在现代信息技术的背景下，解释了Kolmogorov算法，Kolmogorov Machine和Kolmogorov的复杂性，这表明它们实际上代表了算法理论的基本要素，Kolmogorov，Kolmogorov的可编程技术和New Komputer Mathematics I.E..E.E. Mathematics oblemersics obyersics obyersics obyersics obyersics obyersics obyersics。
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.
