On Kolmogorov's complexity and information

MaRDI QIDQ2264646zbMATH OpenFDO

Authors Teturo Kamae

Publication date 1973

Published in Osaka Journal of Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Information theory (general) (94A15) Recursive functions and relations, subrecursive hierarchies (03D20) Computability and recursion theory (03D99)

Cited in

(3)

• Several results in program size complexity
• Symbolic dynamics of one-dimensional maps: Entropies, finite precision, and noise
• Kolmogorov complexity conditional to large integers

This page was built for publication: On Kolmogorov's complexity and information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2264646)