Kolmogorov's contributions to information theory and algorithmic complexity
From MaRDI portal
Publication:582861
DOI10.1214/aop/1176991250zbMath0691.68005OpenAlexW1969998713MaRDI QIDQ582861
Thomas M. Cover, Robert M. Gray, Peter Gács
Publication date: 1989
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aop/1176991250
Analysis of algorithms and problem complexity (68Q25) Development of contemporary mathematics (01A65) History of computer science (68-03)
Related Items
Randomness as an invariant for number representations, Kolmogorov's Last Discovery? (Kolmogorov and Algorithmic Statistics), Entropy measures vs. Kolmogorov complexity, Akaike's information criterion and recent developments in information complexity, Sophistication vs logical depth, Upcrossing inequalities for stationary sequences and applications, Nonlinear extension of bode's integral based on an information-theoretic interpretation, On a definition of random sequences with respect to conditional probability, Non-stochastic infinite and finite sequences, Regression and ICOMP—A Simulation Study, CODING WITH MINIMAL PROGRAMS, Entropic measures, Markov information sources and complexity, Does snooping help?
