Composition laws for entropy and temperature in tree-like graphs

Authors:
G. Jumarie
Affiliations:
Department of Mathematics and Computer Science Université du Québec à Montréal P.O. Box 8888, St. A Montréal, Quebec H3C 3P8, Canada
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
1993

Citing 3
Cited 0

Relative information: theories and applications

Relative information: theories and applications
Complex Systems: Operational Approaches in Neurobiology, Physics and Computers

Complex Systems: Operational Approaches in Neurobiology, Physics and Computers
Extension of quantum information by using entropy of deterministic functions

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.98

Visualization

Abstract

The (Shannon) entropy of a random variable can be thought of as the maximum value of its conditional entropy given another random variable. Exploiting this idea provides possible composition laws for entropies defined on tree-like graphs. The same approach applies to quantum entropy. These elements could serve as a point of departure to analyze the complexity of computational systems.