Quantifying the Rise and Fall of Complexity in Closed Systems: The Coffee Automaton Scott Aaronson∗ Sean M. Carroll†

First Page		Document Content
Date: 2014-05-27 14:31:46 Information theory Randomness Metaphysics Theoretical computer science Theory of computation Entropy Kolmogorov complexity Sophistication Complexity Random sequence Algorithmic information theory Mutual information		Quantifying the Rise and Fall of Complexity in Closed Systems: The Coffee Automaton Scott Aaronson∗ Sean M. Carroll† Add to Reading List Source URL: www.scottaaronson.com Download Document from Source Website File Size: 1,25 MB Share Document on Facebook

	Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of view DocID: 1xVR3 - View Document
	Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗ DocID: 1xUAX - View Document
	Theoretical Computer Science–24 Contents lists available at ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcs DocID: 1xUr4 - View Document
	Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingen DocID: 1xTuz - View Document
	CS 153 Current Topics in Theoretical Computer Science Spring 2016 DocID: 1vryF - View Document