Kolmogorov structure functions for automatic complexity

DOI10.1016/J.TCS.2015.05.052MaRDI QIDQ896123zbMATH OpenOpenAlexFDO

Authors Bjørn Kjos-Hanssen

Publication date 11 December 2015

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

Full work available at URL https://doi.org/10.1016/j.tcs.2015.05.052

zbMATH Keywords

Kolmogorov complexityautomatic complexityKolmogorov structure function

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10) Formal languages and automata (68Q45) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Kolmogorov structure functions for automatic complexity in computational statistics
• scientific article; zbMATH DE number 1747450
• Automaticity. I: Properties of a measure of descriptional complexity
• Kolmogorov complexity of the initial segments of almost periodic sequences
• Bounds on the Kolmogorov complexity function for infinite words

Cites work

• scientific article; zbMATH DE number 1747450 (Why is no real title available?)
• Kolmogorov's Structure Functions and Model Selection
• Nondeterministic automatic complexity of almost square-free and strongly cube-free words
• The Kolmogorov complexity of infinite words

Cited in

(6)

• Kolmogorov complexity of the initial segments of almost periodic sequences
• An incompressibility theorem for automatic complexity
• Kolmogorov structure functions for automatic complexity in computational statistics
• Bounds on the Kolmogorov complexity function for infinite words
• Few Paths, Fewer Words: Model Selection With Automatic Structure Functions
• On the complexity of automatic complexity

This page was built for publication: Kolmogorov structure functions for automatic complexity

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