Kolmogorov's Theory of Computer Science

被引：0
|
作者：
Levashkin, S. [1 ]
Alexandrov, V. [2 ]
Guzman, A. [3 ]
机构：
[1] Moscow MV Lomonosov State Univ, Moscow, Russia
[2] RAS, St Petersburg Inst Informat & Automat, Moscow, Russia
[3] IPN, Ctr Invest Computac, Sydney, NSW, Australia
来源：
IEEE LATIN AMERICA TRANSACTIONS | 2016年 / 14卷 / 03期
关键词：
Algorithm; Algorithmic Theory of Information; Complexity; Information Theory; Information Technology; Quantitative Measure of Information; Theoretical Computer Science;
D O I：
10.1109/TLA.2016.7459633
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In the present work, we follow in chronological order the ideas, contributions and discoveries of the greatest Russian mathematician Andrei Kolmogorov in Computer Science. We interpret such Kolmogorov's concepts as algorithm, complexity, komputer mathematics, machine, in the context of the state-of-the art information theories and technologies. We conclude that in broad sense these theories and technologies follow the ways sketched and predicted by Kolmogorov about half century ago.
引用
收藏
页码：1447 / 1453
页数：7
相关论文
共 50 条
12345