论文信息 - Noncomplex Sequences: Characterizations and Examples - 字舞流文

Noncomplex Sequences: Characterizations and Examples

Robert P. Daley

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

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

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

[4] Robert P. Daley. The Extent and Density of Sequences within the Minimal-Program Complexity Hierarchies , 1974, J. Comput. Syst. Sci..

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

[6] L. Levin,et al. THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS , 1970 .

[7] Manuel Blum,et al. A Machine-Independent Theory of the Complexity of Recursive Functions , 1967, JACM.