Publication:3327404
From MaRDI portal
zbMath0541.60002MaRDI QIDQ3327404
Publication date: 1983
Related Items
An operational characterization of mutual information in algorithmic information theory, Algorithmic Statistics: Normal Objects and Universal Models, On algorithmic statistics for space-bounded algorithms, The Kolmogorov birthday paradox, Kolmogorov's Last Discovery? (Kolmogorov and Algorithmic Statistics), Sophistication vs logical depth, Sophistication revisited, Mathematical metaphysics of randomness, Non-stochastic infinite and finite sequences, Does snooping help?, Most sequences are stochastic, An extended coding theorem with application to quantum complexities, Some properties of antistochastic strings, Occam bound on lowest complexity of elements, Algorithmic Statistics Revisited, Two Problems for Sophistication, Algorithmic Statistics: Forty Years Later, Kolmogorov Complexity and Model Selection