Open AccessThis article is
- freely available
Entropy 2009, 11(1), 85-110; doi:10.3390/e11010085
The Insights of Algorithmic Entropy
Victoria Management School, Victoria University, PO Box 600, Wellington, New Zealand
Received: 18 November 2008; Accepted: 20 January 2009 / Published: 4 March 2009
Download PDF Full-Text [410 KB, uploaded 4 March 2009 13:31 CET]
Abstract: The algorithmic entropy of a system, the length of the shortest algorithm that specifies the system’s exact state adds some missing pieces to the entropy jigsaw. Because the approach embodies the traditional entropies as a special case, problematic issues such as the coarse graining framework of the Gibbs’ entropy manifest themselves in a different and more manageable form, appearing as the description of the system and the choice of the universal computing machine. The provisional algorithmic entropy combines the best information about the state of the system together with any underlying uncertainty; the latter represents the Shannon entropy. The algorithmic approach also specifies structure that the traditional entropies take as given. Furthermore, algorithmic entropy provides insights into how a system can maintain itself off equilibrium, leading to Ashby’s law of requisite variety. This review shows how the algorithmic approach can provide insights into real world systems, by outlining recent work on how replicating structures that generate order can evolve to maintain a system far from equilibrium.
Keywords: Algorithmic entropy; Non equilibrium thermodynamics; Complex systems; Requisite variety
Article StatisticsClick here to load and display the download statistics.
Notes: Multiple requests from the same IP address are counted as one view.
MDPI and ACS Style
Devine, S. The Insights of Algorithmic Entropy. Entropy 2009, 11, 85-110.AMA Style
Devine S. The Insights of Algorithmic Entropy. Entropy. 2009; 11(1):85-110.Chicago/Turabian Style
Devine, Sean. 2009. "The Insights of Algorithmic Entropy." Entropy 11, no. 1: 85-110.