Entropy as a fixed point

DOI10.1016/J.TCS.2005.10.026MaRDI QIDQ817848zbMATHOpenAlexFDO

Authors 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

entropyinformationalgorithmcomplexitydomain theory

Mathematics Subject Classification ID

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

Recommendations

• Automata, Languages and Programming
• Quantum algorithmic entropy
• Quantum algorithmic complexities and entropy
• Quantum entropy and complexity
• Entropy and algorithmic complexity in quantum information theory

Cites work

• scientific article; zbMATH DE number 1670818 (Why is no real title available?)
• scientific article; zbMATH DE number 3743898 (Why is no real title available?)
• scientific article; zbMATH DE number 783754 (Why is no real title available?)
• A Mathematical Theory of Communication
• A triangle inequality for measurement
• Inequalities: theory of majorization and its applications
• On the Shannon entropy and related functionals on convex sets
• Unique Fixed Points in Domain Theory

Cited in

(9)

• On the critical points of the entropic principle
• A domain of unital channels
• A Technique for Verifying Measurements
• Automata, Languages and Programming
• COMPLEXITY, INFORMATION, ENERGY
• Computability of entropy and information in classical Hamiltonian systems
• Algebraic information theory for binary channels
• Countability constraints in order-theoretic approaches to computability
• Entropy is the only finitely observable invariant

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

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