Entropy as a fixed point

DOI10.1016/J.TCS.2005.10.026zbMATH Open1086.68060OpenAlexW1595385671MaRDI QIDQ817848FDOQ817848

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

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

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)

Cites Work

• A Mathematical Theory of Communication
• Inequalities: theory of majorization and its applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Shannon entropy and related functionals on convex sets
• A triangle inequality for measurement
• Title not available (Why is that?)
• Unique Fixed Points in Domain Theory

Cited In (9)

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

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)