1. Information-theoretic aspects of the Turing degrees;Chaitin;AMS Notices,1972
2. Information-theoretic aspects of the Turing degrees;Chaitin;AMS Notices,1972
3. There are few minimal descriptions. A necessary and sufficient condition for an infinite binary string to be recursive;Chaitin;Recursive Function Theory Newsletter,1973
4. A theory of program size formally identical to information theory;Chaitin;J. ACM,1975
5. A variant of the Kolmogorov concept of complexity;Loveland;Information and Control,1969