Several results in program size complexity

[1]  Howard P. Katseff.  Complexity Dips in Random Infinite Binary Sequences , 1978, Inf. Control..

[2]  G. Chaitin.  Program size, oracles, and the jump operation , 1977 .

[3]  Gregory J. Chaitin.  Information-Theoretic Characterizations of Recursive Infinite Strings , 1976, Theor. Comput. Sci..

[4]  Robert P. Daley.  Non-Complex Sequences: Characterizations and Examples , 1974, SWAT.

[5]  G. Chaitin.  A Theory of Program Size Formally Identical to Information Theory , 1975, JACM.

[6]  William Lawrence Gewirtz,et al.  Investigations in the Theory of Descriptive Complexity , 2015 .

[7]  T. Kamae.  On Kolmogorov's complexity and information , 1973 .

[8]  Joseph R. Shoenfield,et al.  Degrees of unsolvability , 1959, North-Holland mathematics studies.

[9]  Donald W. Loveland,et al.  A Variant of the Kolmogorov Concept of Complexity , 1969, Information and Control.

[10]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

[11]  D. C. Cooper,et al.  Theory of Recursive Functions and Effective Computability , 1969, The Mathematical Gazette.

[12]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[13]  Manuel Blum.  On the Size of Machines , 1967, Inf. Control..

[14]  Gregory J. Chaitin,et al.  On the Length of Programs for Computing Finite Binary Sequences , 1966, JACM.

[15]  T. Rado.  On non-computable functions , 1962 .

[16]  Hartley Rogers,et al.  Gödel numberings of partial recursive functions , 1958, Journal of Symbolic Logic.