论文信息 - Several Results in Program Size Complexity

Several Results in Program Size Complexity

Abstract Intuitively, the program size complexity of a binary string measures the amount of information in the string. Researchers have formalized this notion in a number of different ways. Here, we demonstrate similarities between some of these formulations. We also investigate in some detail the properties of Kolmogorov's complexity measure.

Howard P. Katseff | Michael Sipser

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

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

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

[4] P. Martin-Löf. Complexity oscillations in infinite binary sequences , 1971 .

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

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

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

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

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

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

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

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

[13] Gregory J. Chaitin,et al. A recent technical report , 1974, SIGA.

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

[15] Robert P. Daley. Noncomplex Sequences: Characterizations and Examples , 1976, J. Symb. Log..