Kolmogorov's contributions to information theory and algorithmic complexity
From MaRDI portal
Publication:582861
DOI10.1214/aop/1176991250zbMath0691.68005MaRDI QIDQ582861
Peter Gács, Thomas M. Cover, Robert M. Gray
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
68Q25: Analysis of algorithms and problem complexity
01A65: Development of contemporary mathematics
68-03: History of computer science
Related Items
Regression and ICOMP—A Simulation Study, Entropy measures vs. Kolmogorov complexity, Upcrossing inequalities for stationary sequences and applications, On a definition of random sequences with respect to conditional probability, Non-stochastic infinite and finite sequences, Does snooping help?, Entropic measures, Markov information sources and complexity, Akaike's information criterion and recent developments in information complexity, Nonlinear extension of bode's integral based on an information-theoretic interpretation