|
Эта публикация цитируется в 60 научных статьях (всего в 60 статьях)
Комбинаторные основания теории информации и исчисления
вероятностей
А. Н. Колмогоров
Полный текст:
PDF файл (651 kB)
Список литературы:
PDF файл
HTML файл
Англоязычная версия:
Russian Mathematical Surveys, 1983, 38:4, 29–40
Реферативные базы данных:
УДК:
51.01+519.1
MSC: 60C05, 94A15, 60G57 Поступила в редакцию: 20.08.1982
Образец цитирования:
А. Н. Колмогоров, “Комбинаторные основания теории информации и исчисления
вероятностей”, УМН, 38:4(232) (1983), 27–36; Russian Math. Surveys, 38:4 (1983), 29–40
Цитирование в формате AMSBIB
\RBibitem{Kol83}
\by А.~Н.~Колмогоров
\paper Комбинаторные основания теории информации и~исчисления
вероятностей
\jour УМН
\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}
Образцы ссылок на эту страницу:
http://mi.mathnet.ru/umn2940 http://mi.mathnet.ru/rus/umn/v38/i4/p27
Citing articles on Google Scholar:
Russian citations,
English citations
Related articles on Google Scholar:
Russian articles,
English articles
Эта публикация цитируется в следующих статьяx:
-
A. N. Kolmogorov, V. A. Uspenskii, “Algorithms and Randomness”, Theory Probab Appl, 32:3 (1987), 389
-
Michiel van Lambalgen, “Von Mises' definition of random sequences reconsidered”, J. symb. log, 52:03 (1987), 725
-
П. Витаньи, М. Ли, “Колмогоровская сложность: двадцать лет спустя”, УМН, 43:6(264) (1988), 129–166
-
Xiao-Jing Wang, “Statistical physics of temporal intermittency”, Phys Rev A, 40:11 (1989), 6647
-
Michiel van Lambalgen, “Algorithmic information theory”, J. symb. log, 54:04 (1989), 1389
-
В. А. Успенский, А. Л. Семёнов, А. Х. Шень, “Может ли (индивидуальная) последовательность нулей и единиц быть случайной?”, УМН, 45:1(271) (1990), 105–162
; 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 -
W Ebeling, G Nicolis, “Entropy of Symbolic Sequences: The Role of Correlations”, Europhys Lett, 14:3 (1991), 191
-
P.M. Mäkilä, “On identification of stable systems and optimal approximation”, Automatica, 27:4 (1991), 663
-
X.-J. Wang, “Dynamical sporadicity and anomalous diffusion in the Lévy motion”, Phys Rev A, 45:12 (1992), 8407
-
Ming Li, Paul M.B. Vitányi, “Inductive reasoning and kolmogorov complexity”, Journal of Computer and System Sciences, 44:2 (1992), 343
-
Pierre Gaspard, Xiao-Jing Wang, “Noise, chaos, and (ε, τ)-entropy per unit time”, Physics Reports, 235:6 (1993), 291
-
Ming Li, Paul M.B Vitányi, “Kolmogorov complexity arguments in combinatorics”, Journal of Combinatorial Theory, Series A, 66:2 (1994), 226
-
A. Compagner, “Operational conditions for random-number generation”, Phys. Rev. E, 52:5 (1995), 5634
-
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
-
Chen Shu-Heng, “Elements of information theory”, Journal of Economic Dynamics and Control, 20:5 (1996), 819
-
V.V. V'yugin, “Ergodic theorems for individual random sequences”, Theoretical Computer Science, 207:2 (1998), 343
-
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
-
Jack H. Lutz, David L. Schweizer, “Feasible reductions to kolmogorov-loveland stochastic sequences”, Theoretical Computer Science, 225:1-2 (1999), 185
-
А. Е. Ромащенко, “Пары слов с нематериализуемой взаимной информацией”, Пробл. передачи информ., 36:1 (2000), 3–20
; A. E. Romashchenko, “Pairs of Words with Nonmaterializable Mutual Information”, Problems Inform. Transmission, 36:1 (2000), 1–18 -
C. Adami, N.J. Cerf, “Physical complexity of symbolic sequences”, Physica D: Nonlinear Phenomena, 137:1-2 (2000), 62
-
Hamparsum Bozdogan, “Akaike's Information Criterion and Recent Developments in Information Complexity”, Journal of Mathematical Psychology, 44:1 (2000), 62
-
R. Mansilla, “Algorithmic complexity in the minority game”, Phys. Rev. E, 62:4 (2000), 4553
-
R. Mansilla, “Algorithmic complexity of real financial markets”, Physica A: Statistical Mechanics and its Applications, 301:1-4 (2001), 483
-
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
-
В. Г. Вовк, Г. Р. Шейфер, “Вклад А. Н. Колмогорова в основания теории вероятностей”, Пробл. передачи информ., 39:1 (2003), 24–35
; V. G. Vovk, G. R. Shafer, “Kolmogorov's Contributions to the Foundations of Probability”, Problems Inform. Transmission, 39:1 (2003), 21–31 -
В. В. Вьюгин, В. П. Маслов, “Об экстремальных соотношениях между аддитивными функциями потерь и колмогоровской сложностью”, Пробл. передачи информ., 39:4 (2003), 71–87
; 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 -
В. П. Маслов, “Аксиомы нелинейного осреднения в финансовой математике и динамика курса акций”, Теория вероятн. и ее примен., 48:4 (2003), 800–810
; V. P. Maslov, “Nonlinear averaging axioms in financial mathematics
and stock price dynamics”, Theory Probab. Appl., 48:4 (2004), 723–733 -
Jack H. Lutz, “The dimensions of individual strings and sequences”, Information and Computation, 187:1 (2003), 49
-
Goren Gordon, “Multi-dimensional Linguistic Complexity”, Journal of Biomolecular Structure and Dynamics, 20:6 (2003), 747
-
Claudio Bonanno, Stefano Galatolo, “Algorithmic information for interval maps with an indifferent fixed point and infinite invariant measure”, Chaos, 14:3 (2004), 756
-
John J. McCall, “Induction: From Kolmogorov and Solomonoff to De Finetti and Back to Kolmogorov”, Metroeconomica, 55:2-3 (2004), 195
-
C. L. Magee, O. L. de Weck, “3.1.3 Complex System Classification”, INCOSE International Symposium, 14:1 (2004), 471
-
В. В. Вьюгин, В. П. Маслов, “Теоремы о концентрации для энтропии и свободной энергии”, Пробл. передачи информ., 41:2 (2005), 72–88
; V. V. V'yugin, V. P. Maslov, “Theorems on Concentration for the Entropy of Free Energy”, Problems Inform. Transmission, 41:2 (2005), 134–149 -
В. В. Вьюгин, В. П. Маслов, “Распределение инвестиций на фондовом рынке, информационные
типы и алгоритмическая сложность”, Пробл. передачи информ., 42:3 (2006), 97–108
; 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 -
Vladimir Vovk, “Well-calibrated predictions from on-line compression models”, Theoretical Computer Science, 364:1 (2006), 10
-
Marie Ferbus-Zanda, Serge Grigorieff, “Kolmogorov complexities , on computable partially ordered sets”, Theoretical Computer Science, 352:1-3 (2006), 159
-
HAIFENG LI, XIN CHEN, KESHU ZHANG, TAO JIANG, “A GENERAL FRAMEWORK FOR BICLUSTERING GENE EXPRESSION DATA”, J. Bioinform. Comput. Biol, 04:04 (2006), 911
-
Michael J. Lee, “Pseudo-random-number generators and the square site percolation threshold”, Phys Rev E, 78:3 (2008), 031131
-
CRISTOBAL ROJAS, “Computability and information in models of randomness and chaos”, Math Struct Comp Sci, 18:2 (2008)
-
Farhad Ameri, Joshua D. Summers, Gregory M. Mocko, Matthew Porter, “Engineering design complexity: an investigation of methods and measures”, Res Eng Des, 2008
-
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
-
A. P. MASUCCI, G. J. RODGERS, “DIFFERENCES BETWEEN NORMAL AND SHUFFLED TEXTS: STRUCTURAL PROPERTIES OF WEIGHTED NETWORKS”, Advs. Complex Syst, 12:01 (2009), 113
-
Joshua D. Summers, Jami J. Shah, “Mechanical Engineering Design Complexity Metrics: Size, Coupling, and Solvability”, J Mech Des, 132:2 (2010), 021004
-
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
-
D. Kochedykov, “A combinatorial approach to hypothesis similarity in generalization bounds”, Pattern Recognit. Image Anal, 21:4 (2011), 616
-
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
-
Максимов В.П., Чадов А.Л., “Гибридные модели в задачах экономической динамики”, Вестник Пермского университета. Серия: Экономика, 2011, № 2, 13–23
-
James Ladyman, James Lambert, Karoline Wiesner, “What is a complex system?”, Euro Jnl Phil Sci, 2012
-
EIJI KONISHI, “MODELING QUANTUM MECHANICAL OBSERVERS VIA NEURAL-GLIAL NETWORKS”, Int. J. Mod. Phys. B, 26:09 (2012), 1250060
-
EIJI KONISHI, “TIME AND A TEMPORALLY STATISTICAL QUANTUM GEOMETRODYNAMICS”, Int. J. Mod. Phys. A, 2013, 1330015
-
Göker Arpağ, Ayşe Erzan, “An ensemble approach to the evolution of complex systems”, J Biosci, 2014
-
MIOARA MUGUR-SCHÄCHTER, “On the concept of probability”, Math. Struct. Comp. Sci, 24:03 (2014)
-
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
-
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
-
Б. С. Дарховский, А. Пирятинская, “Новый подход к проблеме сегментации временны́х рядов произвольной природы”, Стохастическое исчисление, мартингалы и их применения, Сборник статей. К 80-летию со дня рождения академика Альберта Николаевича Ширяева, Тр. МИАН, 287, МАИК «Наука/Интерпериодика», М., 2014, 61–74
; 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 -
H. Moradpour, N. Riazi, “Thermodynamic Equilibrium and Rise of Complexity in an Accelerated Universe”, Int J Theor Phys, 2015
-
J.P.. Crutchfield, Sarah Marzen, “Signatures of infinity: Nonergodicity and resource scaling in prediction, complexity, and learning”, Phys. Rev. E, 91:5 (2015)
-
Olimpia Lombardi, Federico Holik, Leonardo Vanni, “What is Shannon information?”, Synthese, 2015
-
К. Г. Косс, М. И. Мясников, О. Ф. Петров, К. Б. Стаценко, “Анализ фазовых переходов в двумерных кулоновских кластерах методом динамической энтропии”, Письма в ЖЭТФ, 102:10 (2015), 745–751
; 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 -
Б. С. Дарховский, “О сложности и размерности непрерывных конечномерных отображений”, Теория вероятн. и ее примен., 65:3 (2020), 479–497
|
Просмотров: |
Эта страница: | 1975 | Полный текст: | 703 | Литература: | 63 | Первая стр.: | 2 |
|