The frequent paucity of trivial strings

DOI10.1016/J.IPL.2014.05.006zbMath1371.68127arXiv1310.6383OpenAlexW2134748241MaRDI QIDQ2252648

Jack H. Lutz

Publication date: 18 July 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1310.6383

zbMATH Keywords

Kolmogorov complexitytheory of computation

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Information-theoretic characterizations of recursive infinite strings
• Algorithmic Randomness and Complexity
• Instance complexity
• A New Approach to Formal Language Theory by Kolmogorov Complexity
• A variant of the Kolmogorov concept of complexity
• An introduction to Kolmogorov complexity and its applications

This page was built for publication: The frequent paucity of trivial strings