Papers
Topics
Authors
Recent
Search
2000 character limit reached

Complexity, Entropy, and Markov Chains

Published 26 Feb 2019 in hep-th, cond-mat.stat-mech, and quant-ph | (1902.10538v1)

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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.