1. Bennett, C. (1988). Logical depth and physical complexity. In R. Herken (Ed.), In the universal turing machine: A half-century survey (pp. 227–257). Oxford University Press: New York.
2. Bennett, C., Gács, P., Li, M., Vitányi, P., & Zurek, W. (1998). Information distance. IEEE Transactions on Information Theory, 44(4), 1407–1423.
3. Chaitin, G. (1966). On the length of programs for computing finite binary sequences. Journal of the ACM, 13, 547–569.
4. Chaitin, G. (1969). On the length of programs for computing finite binary sequences: Statistical considerations. Journal of the ACM, 16, 145–159.
5. Chaitin, G. (1975). A theory of program size formally identical to information theory. Journal of the ACM, 22, 329–340.