Complexity, Entropy, and Markov Chains

Abstract

We develop a theory of classical complexity. We study the relations between classical complexity and entropy, and conjecture that in an isolated system, classical absolute complexity always tends to grow, until it reaches its maximum. We calculate some exact closed-form expressions of the growth of average classical complexity over time in some concrete models, and gain further insights of both classical and quantum complexity by using the theory of Markov chains.