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.

翻译：本文证明，埃尔德什-卡茨定理——该定理非正式地指出极大整数的素因子个数收敛于正态分布——可通过算法信息论给出一个优雅的证明。