An information-theoretic proof of the Erdős-Kac theorem

Abstract

In this article we show that the Erdős-Kac theorem, which informally states that the number of prime divisors of very large integers converges to a normal distribution, has an elegant proof via Algorithmic Information Theory.

arXiv commentThere is an error in this paper that is addressed in arXiv:2308.10817