Entropy as a fixed point

DOI10.1016/J.TCS.2005.10.026zbMath1086.68060OpenAlexW1595385671MaRDI QIDQ817848

Keye Martin

Publication date: 20 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.10.026

zbMATH Keywords

entropycomplexityalgorithminformationdomain theory

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Measures of information, entropy (94A17) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

A domain of unital channels ⋮ COMPLEXITY, INFORMATION, ENERGY ⋮ A Technique for Verifying Measurements ⋮ Algebraic information theory for binary channels

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• A triangle inequality for measurement
• On the Shannon entropy and related functionals on convex sets
• Unique Fixed Points in Domain Theory
• Inequalities: theory of majorization and its applications

This page was built for publication: Entropy as a fixed point