Geodesic
Kolmogorov and modern Informatics
Matematičeskoe obrazovanie, Tome 96 (2020) no. 4, pp. 42-54.

Voir la notice de l'article provenant de la source Math-Net.Ru

Andrey Kolmogorov has introduced such fundamental concepts as Kolmogorov's algorithm, Kolmogorov machine, Kolmogorov complexity, which ultimately have led him to rethink mathematical science and the foundations of new mathematics of computers.
Keywords: Andrey Nikolaevich Kolmogorov, Kolmogorov's algorithm, Kolmogorov's car, Kolmogorov difficulty, computer mathematics. 
@article{MO_2020_96_4_a6,
     author = {S. P. Levashkin},
     title = {Kolmogorov and modern {Informatics}},
     journal = {Matemati\v{c}eskoe obrazovanie},
     pages = {42--54},
     publisher = {mathdoc},
     volume = {96},
     number = {4},
     year = {2020},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MO_2020_96_4_a6/}
}
TY  - JOUR
AU  - S. P. Levashkin
TI  - Kolmogorov and modern Informatics
JO  - Matematičeskoe obrazovanie
PY  - 2020
SP  - 42
EP  - 54
VL  - 96
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MO_2020_96_4_a6/
LA  - ru
ID  - MO_2020_96_4_a6
ER  - 
%0 Journal Article
%A S. P. Levashkin
%T Kolmogorov and modern Informatics
%J Matematičeskoe obrazovanie
%D 2020
%P 42-54
%V 96
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MO_2020_96_4_a6/
%G ru
%F MO_2020_96_4_a6
S. P. Levashkin. Kolmogorov and modern Informatics. Matematičeskoe obrazovanie, Tome 96 (2020) no. 4, pp. 42-54. http://geodesic.mathdoc.fr/item/MO_2020_96_4_a6/

[1] V. V. Aleksandrov, A. V. Arsenteva, Informatsiya i razvivayuschiesya struktury, Leningradskii Institut Informatiki i Avtomatizatsii AN SSSR, L., 1984 <ext-link ext-link-type='mr-item-id' href='http://mathscinet.ams.org/mathscinet-getitem?mr=740046'>740046</ext-link>

[2] V. V. Aleksandrov, S. V. Kuleshov, O. V. Tsvetkov, Tsifrovaya tekhnologiya infokommunikatsii: Peredacha, khranenie i semanticheskii analiz teksta, zvuka, video, Nauka, SPb., 2008

[3] N. K. Vereschagin, V. A. Uspenskii, A. Kh, Shen, Kolmogorovskaya slozhnost i algoritmicheskaya sluchainost, MTsNMO, M., 2013

[4] D. Yu. Grigorev, “Algorifmy Kolmogorova silnee mashin Tyuringa”, Zap. nauchn. sem. LOMI, 60, 1976

[5] A. N. Kolmogorov, V. A. Uspenskii, “K opredeleniyu algoritma”, UMN, 13:4(82) (1958)

[6] A. N. Kolmogorov, “O predstavlenii nepreryvnykh funktsii neskolkikh peremennykh v vide superpozitsii nepreryvnykh funktsii odnogo peremennogo i slozheniya”, Dokl. AN SSSR, 114:5 (1957) <ext-link ext-link-type='zbl-item-id' href='https://zbmath.org/?q=an:0090.27103'>0090.27103</ext-link>

[7] A. N. Kolmogorov, “Tri podkhoda k opredeleniyu ponyatiya "kolichestvo informatsii’’”, Probl. peredachi inform., 1965, no. 1(1) <ext-link ext-link-type='mr-item-id' href='http://mathscinet.ams.org/mathscinet-getitem?mr=184801'>184801</ext-link>

[8] A. N. Kolmogorov, “Kombinatornye osnovaniya teorii informatsii i ischisleniya veroyatnostei”, UMN, 38:4(232) (1983)

[9] S. P. Levashkin, V. V. Aleksandrov, “K-slozhnost v kontekcte noveishikh informatsionnykh tekhnologii”, Informatsionno-izmeritelnye i upravlyayuschie sistemy, 10:5 (2012)

[10] V. I. Arnold, “Complexity of finite sequences of zeros and ones and geometry of finite spaces of functions”, Functional Analysis and Other Mathematics, 1:1 (2006) <ext-link ext-link-type='mr-item-id' href='http://mathscinet.ams.org/mathscinet-getitem?mr=2381959'>2381959</ext-link>

[11] H. E. Burke, Handbook of Bar Coding Systems, Van Nostrand Reinhold Company, 1984

[12] J. Gleick, The information: a history, a theory, a flood, Fourth Estate, London, 2011

[13] S. Levashkin, V. Alexandrov, Data semantic associative analysis and synthesis, , 2012 <ext-link ext-link-type='uri' href='http://levashkin.com/files/Levashkin-Alexandrov.pdf'>http://levashkin.com/files/Levashkin-Alexandrov.pdf</ext-link>

[14] Y. I. Manin, M. Marcolli, Kolmogorov complexity and the asymptotic bound for error-correcting codes, arXiv: <ext-link ext-link-type='uri' href='http://arxiv.org/abs/1203.0653'>1203.0653</ext-link><ext-link ext-link-type='mr-item-id' href='http://mathscinet.ams.org/mathscinet-getitem?mr=3229051'>3229051</ext-link>

[15] C. T. Shannon, “A mathematical theory of communication”, Bell System Technical Journal, 27 (1948) <ext-link ext-link-type='doi' href='https://doi.org/10.1002/j.1538-7305.1948.tb01338.x'>10.1002/j.1538-7305.1948.tb01338.x</ext-link><ext-link ext-link-type='mr-item-id' href='http://mathscinet.ams.org/mathscinet-getitem?mr=26286'>26286</ext-link><ext-link ext-link-type='zbl-item-id' href='https://zbmath.org/?q=an:1154.94303'>1154.94303</ext-link>

[16] J. C. Simon, Patterns and operators. The foundations of data representation, McGraw-Hill, 1984

[17] W. E., J. Han, A. Jentzen, “Deep learning-based numerical methods for high-dimensional parabolic partial differential equations and backward stochastic differential equations”, Comm. Math. Stats., 5:4 (2017) <ext-link ext-link-type='mr-item-id' href='http://mathscinet.ams.org/mathscinet-getitem?mr=3736669'>3736669</ext-link>

[18] N. Wiener, Cybernetics: On Control and Communication in the Animal and the Machine, Hermann & Cie &, Paris; MIT Press, Camb. Mass., 1948 <ext-link ext-link-type='mr-item-id' href='http://mathscinet.ams.org/mathscinet-getitem?mr=25096'>25096</ext-link>