Machine derived contents note: Introduction: Historical Introduction. What is LISP? Why do I like it? How to Program my Universal Turing Machine in LISP.- Program Size: A Self-Delimiting Turing Machine considered as a Set of (Program, Output) Pairs. How to Construct Self-delimiting Turing Machines: The Kraft Inequality. The Connection Between Program-Size Complexity and Algorithmic Probability. The Basic Result on Relative Complexity.- Randomness: Theoretical Interlude - What is Randomness? My definitions. Proof that Martin-Lf̲ Randomness is Equivalent to Martin-Lf̲ Randomness. Proof that Solovay Randomness is Equivalent to Strong Chaitin Randomness.- Future Work: Extending AIT to the Size of Programs for Computing Infinite Sets and to Computations with Oracles. Postscript - Letter to a Young Reader
