论文信息 - On the Length of Programs for Computing Finite Binary Sequences

On the Length of Programs for Computing Finite Binary Sequences

The use of Turing machines for calculating finite binary sequences is studied from the point of view of information theory and the theory of recursive functions. Various results are obtained concerning the number of instructions in programs. A modified form of Turing machine is studied from the same point of view. An application to the problem of defining a patternless sequence is proposed in terms of the concepts here developed.

Gregory J. Chaitin | G. Chaitin

[1] K. Popper,et al. The Logic of Scientific Discovery , 1960 .

[2] A. Turing. On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[3] Richard Von Mises,et al. Probability, statistics and truth , 1939 .

[4] A. Church. On the concept of a random sequence , 1940 .

[5] J. Neumann,et al. Theory of games and economic behavior , 1945, 100 Years of Math Milestones.

[6] E. T.. An Introduction to the Theory of Numbers , 1946, Nature.

[7] C. E. SHANNON,et al. A mathematical theory of communication , 1948, MOCO.

[8] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1951 .

[9] Claude E. Shannon,et al. A Universal Turing Machine with Two Internal States , 1956 .

[10] Amiel Feinstein,et al. Foundations of Information Theory , 1959 .

[11] Martin D. Davis,et al. Computability and Unsolvability , 1959, McGraw-Hill Series in Information Processing and Computers.

[12] D. Loveland. A New Interpretation of the von Mises' Concept of Random Sequence† , 1966 .

[13] Lars Löfgren,et al. Recognition of order and evolutionary systems , 1967 .