Generalized kolmogorov complexity and other dual complexity measures

DOI10.1007/BF01068189zbMath0800.68507MaRDI QIDQ4007442

Mark S. Burgin

Publication date: 27 September 1992

Published in: Cybernetics (Search for Journal in Brave)

zbMATH Keywords

Kolmogorov complexitydual complexity measures

Mathematics Subject Classification ID

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

Related Items (3)

Algorithmic complexity as a criterion of unsolvability ⋮ Information theory: A multifaceted model of information ⋮ Algorithmic complexity of recursive and inductive algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Process complexity and effective random tests
• A Theory of Program Size Formally Identical to Information Theory
• A Machine-Independent Theory of the Complexity of Recursive Functions
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
• A formal theory of inductive inference. Part I

This page was built for publication: Generalized kolmogorov complexity and other dual complexity measures