1. Speed-up theorems and incompleteness theorems in automata theory;Arbib,1966
2. Machine dependence of degrees of difficulty;Arbib;Proc. Am. Math. Soc. XVI,1965
3. A machine-independent theory of the complexity of recursive functions;Blum;J. Assoc. Comp. Mach., XIV,1967
4. On the length of programs for computing finite binary sequences;Chaitin;J. Assoc. Comp. Mach., XIII,1966
5. Chaitin, G., On the simplicity and speed of programs for computing infinite sets of natural numbers, J. Assoc. Comp. Mach., in press.