Kolmogorov complexities \(K_{\max}\), \(K_{\min}\) on computable partially ordered sets

DOI10.1016/J.TCS.2005.11.001zbMath1087.68044OpenAlexW1979345712MaRDI QIDQ818126

Serge Grigorieff, Marie C. Ferbus-Zanda

Publication date: 24 March 2006

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

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

zbMATH Keywords

Kolmogorov complexityinfinite computation

Mathematics Subject Classification ID

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

Related Items (1)

Kolmogorov complexity for possibly infinite computations

Cites Work

• Program size complexity for possibly infinite computations
• Kolmogorov complexity for possibly infinite computations
• Process complexity and effective random tests
• A decomposition theorem for partially ordered sets
• Combinatorial foundations of information theory and the calculus of probabilities
• A Theory of Program Size Formally Identical to Information Theory
• Kolmogorov complexity and set theoretical representations of integers
• Random reals and possibly infinite computations Part I: Randomness in ∅′
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Kolmogorov complexities \(K_{\max}\), \(K_{\min}\) on computable partially ordered sets