  In this article we show that the Erd\H{o}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.
