RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Subscription
License agreement
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Uspekhi Mat. Nauk:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Uspekhi Mat. Nauk, 1983, Volume 38, Issue 4(232), Pages 27–36 (Mi umn2940)  

This article is cited in 59 scientific papers (total in 59 papers)

Combinatorial foundations of information theory and the calculus of probabilities

A. N. Kolmogorov


Full text: PDF file (651 kB)
References: PDF file   HTML file

English version:
Russian Mathematical Surveys, 1983, 38:4, 29–40

Bibliographic databases:

UDC: 51.01+519.1
MSC: 60C05, 94A15, 60G57
Received: 20.08.1982

Citation: A. N. Kolmogorov, “Combinatorial foundations of information theory and the calculus of probabilities”, Uspekhi Mat. Nauk, 38:4(232) (1983), 27–36; Russian Math. Surveys, 38:4 (1983), 29–40

Citation in format AMSBIB
\Bibitem{Kol83}
\by A.~N.~Kolmogorov
\paper Combinatorial foundations of information theory and the calculus of probabilities
\jour Uspekhi Mat. Nauk
\yr 1983
\vol 38
\issue 4(232)
\pages 27--36
\mathnet{http://mi.mathnet.ru/umn2940}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=710113}
\zmath{https://zbmath.org/?q=an:0597.60002}
\adsnasa{http://adsabs.harvard.edu/cgi-bin/bib_query?1983RuMaS..38...29K}
\transl
\jour Russian Math. Surveys
\yr 1983
\vol 38
\issue 4
\pages 29--40
\crossref{https://doi.org/10.1070/RM1983v038n04ABEH004203}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=A1983TA39200002}


Linking options:
  • http://mi.mathnet.ru/eng/umn2940
  • http://mi.mathnet.ru/eng/umn/v38/i4/p27

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. A. N. Kolmogorov, V. A. Uspenskii, “Algorithms and Randomness”, Theory Probab Appl, 32:3 (1987), 389  mathnet  crossref  mathscinet  zmath  isi
    2. Michiel van Lambalgen, “Von Mises' definition of random sequences reconsidered”, J. symb. log, 52:03 (1987), 725  crossref
    3. P. Vitani, M. Li, “Kolmogorovskaya slozhnost: dvadtsat let spustya”, UMN, 43:6(264) (1988), 129–166  mathnet  mathscinet  zmath
    4. Xiao-Jing Wang, “Statistical physics of temporal intermittency”, Phys Rev A, 40:11 (1989), 6647  crossref  adsnasa  isi
    5. Michiel van Lambalgen, “Algorithmic information theory”, J. symb. log, 54:04 (1989), 1389  crossref
    6. V. A. Uspenskii, A. L. Semenov, A. Kh. Shen', “Can an individual sequence of zeros and ones be random?”, Russian Math. Surveys, 45:1 (1990), 121–189  mathnet  crossref  mathscinet  zmath  adsnasa  isi
    7. W Ebeling, G Nicolis, “Entropy of Symbolic Sequences: The Role of Correlations”, Europhys Lett, 14:3 (1991), 191  crossref  mathscinet  adsnasa  isi
    8. P.M. Mäkilä, “On identification of stable systems and optimal approximation”, Automatica, 27:4 (1991), 663  crossref
    9. X.-J. Wang, “Dynamical sporadicity and anomalous diffusion in the Lévy motion”, Phys Rev A, 45:12 (1992), 8407  crossref  adsnasa  isi
    10. Ming Li, Paul M.B. Vitányi, “Inductive reasoning and kolmogorov complexity”, Journal of Computer and System Sciences, 44:2 (1992), 343  crossref
    11. Pierre Gaspard, Xiao-Jing Wang, “Noise, chaos, and (ε, τ)-entropy per unit time”, Physics Reports, 235:6 (1993), 291  crossref
    12. Ming Li, Paul M.B Vitányi, “Kolmogorov complexity arguments in combinatorics”, Journal of Combinatorial Theory, Series A, 66:2 (1994), 226  crossref
    13. A. Compagner, “Operational conditions for random-number generation”, Phys. Rev. E, 52:5 (1995), 5634  crossref
    14. O. Popov, D.M. Segal, E.N. Trifonov, “Linguistic complexity of protein sequences as compared to texts of human languages”, Biosystems, 38:1 (1996), 65  crossref
    15. Chen Shu-Heng, “Elements of information theory”, Journal of Economic Dynamics and Control, 20:5 (1996), 819  crossref
    16. V.V. V'yugin, “Ergodic theorems for individual random sequences”, Theoretical Computer Science, 207:2 (1998), 343  crossref
    17. Paolo Allegrini, Jack F. Douglas, Sharon C. Glotzer, “Dynamic entropy as a measure of caging and persistent particle motion in supercooled liquids”, Phys Rev E, 60:5 (1999), 5714  crossref  isi
    18. Jack H. Lutz, David L. Schweizer, “Feasible reductions to kolmogorov-loveland stochastic sequences”, Theoretical Computer Science, 225:1-2 (1999), 185  crossref
    19. A. E. Romashchenko, “Pairs of Words with Nonmaterializable Mutual Information”, Problems Inform. Transmission, 36:1 (2000), 1–18  mathnet  mathscinet  zmath
    20. C. Adami, N.J. Cerf, “Physical complexity of symbolic sequences”, Physica D: Nonlinear Phenomena, 137:1-2 (2000), 62  crossref
    21. Hamparsum Bozdogan, “Akaike's Information Criterion and Recent Developments in Information Complexity”, Journal of Mathematical Psychology, 44:1 (2000), 62  crossref
    22. R. Mansilla, “Algorithmic complexity in the minority game”, Phys. Rev. E, 62:4 (2000), 4553  crossref
    23. R. Mansilla, “Algorithmic complexity of real financial markets”, Physica A: Statistical Mechanics and its Applications, 301:1-4 (2001), 483  crossref
    24. Shi Feng, Li Na-na, Li Yuan-xiang, Zhou Huai-bei, “Phylogeny constructed by using diversity increment”, Wuhan Univ J of Nat Sci, 8:1 (2003), 303  crossref
    25. V. G. Vovk, G. R. Shafer, “Kolmogorov's Contributions to the Foundations of Probability”, Problems Inform. Transmission, 39:1 (2003), 21–31  mathnet  crossref  mathscinet  zmath
    26. V. V. V'yugin, V. P. Maslov, “On Extremal Relations between Additive Loss Functions and the Kolmogorov Complexity”, Problems Inform. Transmission, 39:4 (2003), 380–394  mathnet  crossref  mathscinet  zmath
    27. V. P. Maslov, “Nonlinear averaging axioms in financial mathematics and stock price dynamics”, Theory Probab. Appl., 48:4 (2004), 723–733  mathnet  crossref  crossref  mathscinet  zmath  isi  elib
    28. Jack H. Lutz, “The dimensions of individual strings and sequences”, Information and Computation, 187:1 (2003), 49  crossref
    29. Goren Gordon, “Multi-dimensional Linguistic Complexity”, Journal of Biomolecular Structure and Dynamics, 20:6 (2003), 747  crossref
    30. Claudio Bonanno, Stefano Galatolo, “Algorithmic information for interval maps with an indifferent fixed point and infinite invariant measure”, Chaos, 14:3 (2004), 756  crossref  mathscinet  zmath  isi
    31. John J. McCall, “Induction: From Kolmogorov and Solomonoff to De Finetti and Back to Kolmogorov”, Metroeconomica, 55:2-3 (2004), 195  crossref  mathscinet  zmath  elib
    32. C. L. Magee, O. L. de Weck, “3.1.3 Complex System Classification”, INCOSE International Symposium, 14:1 (2004), 471  crossref
    33. V. V. V'yugin, V. P. Maslov, “Theorems on Concentration for the Entropy of Free Energy”, Problems Inform. Transmission, 41:2 (2005), 134–149  mathnet  crossref  mathscinet  zmath  elib  elib
    34. V. V. V'yugin, V. P. Maslov, “Distribution of Investments in the Stock Market, Information Types, and Algorithmic Complexity”, Problems Inform. Transmission, 42:3 (2006), 251–261  mathnet  crossref  mathscinet  elib  elib
    35. Vladimir Vovk, “Well-calibrated predictions from on-line compression models”, Theoretical Computer Science, 364:1 (2006), 10  crossref
    36. Marie Ferbus-Zanda, Serge Grigorieff, “Kolmogorov complexities , on computable partially ordered sets”, Theoretical Computer Science, 352:1-3 (2006), 159  crossref
    37. HAIFENG LI, XIN CHEN, KESHU ZHANG, TAO JIANG, “A GENERAL FRAMEWORK FOR BICLUSTERING GENE EXPRESSION DATA”, J. Bioinform. Comput. Biol, 04:04 (2006), 911  crossref
    38. Michael J. Lee, “Pseudo-random-number generators and the square site percolation threshold”, Phys Rev E, 78:3 (2008), 031131  crossref  isi
    39. CRISTOBAL ROJAS, “Computability and information in models of randomness and chaos”, Math Struct Comp Sci, 18:2 (2008)  crossref  mathscinet  zmath  isi
    40. Farhad Ameri, Joshua D. Summers, Gregory M. Mocko, Matthew Porter, “Engineering design complexity: an investigation of methods and measures”, Res Eng Des, 2008  crossref  isi
    41. METIN CELIK, “Managing the Operational Constraints in Ship Machinery Design and Installation: Synthesis of Design-Based Failures for Improving the Structural Quality of Shipboard Systems”, Naval Engineers J, 120:3 (2008), 67  crossref  isi
    42. A. P. MASUCCI, G. J. RODGERS, “DIFFERENCES BETWEEN NORMAL AND SHUFFLED TEXTS: STRUCTURAL PROPERTIES OF WEIGHTED NETWORKS”, Advs. Complex Syst, 12:01 (2009), 113  crossref
    43. Joshua D. Summers, Jami J. Shah, “Mechanical Engineering Design Complexity Metrics: Size, Coupling, and Solvability”, J Mech Des, 132:2 (2010), 021004  crossref  isi
    44. James P. Crutchfield, William L. Ditto, Sudeshna Sinha, “Introduction to Focus Issue: Intrinsic and Designed Computation: Information Processing in Dynamical Systems—Beyond the Digital Hegemony”, Chaos, 20:3 (2010), 037101  crossref  elib
    45. D. Kochedykov, “A combinatorial approach to hypothesis similarity in generalization bounds”, Pattern Recognit. Image Anal, 21:4 (2011), 616  crossref
    46. Uspensky V.A., V'yugin V.V., “Development of the algorithmic information theory in Russia”, Journal of Communications Technology and Electronics, 56:6 (2011), 739–747  crossref  isi
    47. Maksimov V.P., Chadov A.L., “Gibridnye modeli v zadachakh ekonomicheskoi dinamiki”, Vestnik Permskogo universiteta. Seriya: Ekonomika, 2011, no. 2, 13–23  elib
    48. James Ladyman, James Lambert, Karoline Wiesner, “What is a complex system?”, Euro Jnl Phil Sci, 2012  crossref
    49. EIJI KONISHI, “MODELING QUANTUM MECHANICAL OBSERVERS VIA NEURAL-GLIAL NETWORKS”, Int. J. Mod. Phys. B, 26:09 (2012), 1250060  crossref
    50. EIJI KONISHI, “TIME AND A TEMPORALLY STATISTICAL QUANTUM GEOMETRODYNAMICS”, Int. J. Mod. Phys. A, 2013, 1330015  crossref
    51. Göker Arpağ, Ayşe Erzan, “An ensemble approach to the evolution of complex systems”, J Biosci, 2014  crossref
    52. MIOARA MUGUR-SCHÄCHTER, “On the concept of probability”, Math. Struct. Comp. Sci, 24:03 (2014)  crossref
    53. S. Pincus, B. H. Singer, “Higher-order dangers and precisely constructed taxa in models of randomness”, Proceedings of the National Academy of Sciences, 111:15 (2014), 5485  crossref
    54. Masashi ICHIMIYA, Ikuo NAKAMURA, Tatsuhiko HARA, “Randomness representation in turbulent flows with Kolmogorov complexity (In turbulence wedge developed from a single roughness element on a flat plate)”, Transactions of the JSME (in Japanese), 80:813 (2014), FE0117  crossref
    55. B. S. Darhovsky, A. Piryatinska, “New approach to the segmentation problem for time series of arbitrary nature”, Proc. Steklov Inst. Math., 287:1 (2014), 54–67  mathnet  crossref  crossref  isi  elib  elib
    56. H. Moradpour, N. Riazi, “Thermodynamic Equilibrium and Rise of Complexity in an Accelerated Universe”, Int J Theor Phys, 2015  crossref
    57. J.P.. Crutchfield, Sarah Marzen, “Signatures of infinity: Nonergodicity and resource scaling in prediction, complexity, and learning”, Phys. Rev. E, 91:5 (2015)  crossref
    58. Olimpia Lombardi, Federico Holik, Leonardo Vanni, “What is Shannon information?”, Synthese, 2015  crossref
    59. K. G. Koss, M. I. Myasnikov, O. F. Petrov, K. B. Statsenko, “Analysis of phase transitions in two-dimensional Coulomb clusters by the dynamic entropy method”, JETP Letters, 102:10 (2015), 655–661  mathnet  crossref  crossref  isi  elib
  • Успехи математических наук Russian Mathematical Surveys
    Number of views:
    This page:1807
    Full text:614
    References:57
    First page:2

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2019