Quantifying the Rise and Fall of Complexity in Closed Systems: The Coffee Automaton

Built on

Complexity, depth, and sophistication
M. Koppel · 1987
Earlier work this paper cites.
An Introduction to Kolmogorov Complexity and Its Applications (1st edition)
M. Li and P. Vitányi · 1993
Earlier work this paper cites.
The Quark and the Jaguar: Adventures in the Simple and the Complex
M. Gell-Mann · 1994
Earlier work this paper cites.
Logical depth and physical complexity
C. H. Bennett · 1995
Earlier work this paper cites.
Classical dynamics of the quantum harmonic chain
T. A Brun and J. B Hartle · 1999
Earlier work this paper cites.

Algorithmic statistics
P. Gács, J. Tromp, and P. M. B. Vitányi · 2001
Cited alongside, same era.
Kolmogorov’s structure functions with an application to the foundations of model selection
N. Vereshchagin and P. Vitányi · 2002
Cited alongside, same era.
A new universal two part code for estimation of string Kolmogorov complexity and algorithmic minimum sufficient statistic
S. Evans, G. Saulnier, and S. Bush · 2003
Cited alongside, same era.
Quantifying self-organization with optimal predictors
C. R. Shalizi, K. L. Shalizi, and R. Haslinger · 2004
Cited alongside, same era.

Methods and techniques of complex systems science: an overview
C. R. Shalizi · 2006
Later among the works it cites.
Sophistication revisited
L. Antunes and L. Fortnow · 2009
Later among the works it cites.
From Eternity to Here: The Quest for the Ultimate Theory of Time
S. M. Carroll · 2010
Later among the works it cites.
Sophistication as randomness deficiency
F. Mota, S. Aaronson, L. Antunes, and A. Souto · 2013
Later among the works it cites.