On Kolmogorov's complexity and information
From MaRDI portal
Publication:2264646
zbMath0273.94024MaRDI QIDQ2264646
Publication date: 1973
Published in: Osaka Journal of Mathematics (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Information theory (general) (94A15) Recursive functions and relations, subrecursive hierarchies (03D20) Computability and recursion theory (03D99)
Related Items
Several results in program size complexity, Kolmogorov complexity conditional to large integers, Symbolic dynamics of one-dimensional maps: Entropies, finite precision, and noise
