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