Information measures for infinite sequences

DOI10.1016/J.TCS.2010.03.026MaRDI QIDQ974755zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Luís Antunes, André Souto

Publication date 7 June 2010

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL http://repositorio.inesctec.pt/handle/123456789/2960

zbMATH Keywords

computational depthKolmogorov complexitysophistication

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• scientific article; zbMATH DE number 4072382
• Sophistication revisited
• scientific article; zbMATH DE number 2038716
• Depth as randomness deficiency
• Sophistication vs logical depth

Cites work

• A formal theory of inductive inference. Part I
• A Kolmogorov complexity characterization of constructive Hausdorff dimension.
• Algorithmic Complexity and Stochastic Properties of Finite Binary Sequences
• Algorithmic statistics
• An almost machine-independent theory of program-length complexity, sophistication, and induction
• An introduction to Kolmogorov complexity and its applications
• Asymptotic orbit complexity of infinite measure preserving transformations
• Complexity oscillations in infinite binary sequences
• Computational depth: Concept and applications
• Depth as randomness deficiency
• Dimension in Complexity Classes
• Effective Strong Dimension in Algorithmic Information and Computational Complexity
• Entropy, Hausdorff measures old and new, and limit sets of geometrically finite Kleinian groups
• scientific article; zbMATH DE number 3427210 (Why is no real title available?)
• scientific article; zbMATH DE number 3844071 (Why is no real title available?)
• scientific article; zbMATH DE number 4072382 (Why is no real title available?)
• scientific article; zbMATH DE number 4093436 (Why is no real title available?)
• Low-depth witnesses are easy to find
• On the Length of Programs for Computing Finite Binary Sequences
• Sophistication revisited
• The Kolmogorov complexity of random reals
• Two definitions of fractional dimension

Cited in

(4)

• Chaitin complexity, Shannon information content of a single event, and infinite random sequences. II
• scientific article; zbMATH DE number 4072382 (Why is no real title available?)
• A general notion of useful information
• Statistical estimation of the structure of a finite population

This page was built for publication: Information measures for infinite sequences

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