论文信息 - Program size, oracles, and the jump operation

Program size, oracles, and the jump operation

There are a number of questions regarding the size of programs for calculating natural numbers, sequences, sets, and functions, which are best answered by considering computations in which one is allowed to consult an oracle for the halting problem. Questions of this kind suggested by work of T. Kamae and D. W. Loveland are treated.

G. Chaitin

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

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

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

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

[5] Gregory J. Chaitin,et al. Information-Theoretic Limitations of Formal Systems , 1974, JACM.

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

[7] A note on a result of Kamae , 1975 .

[8] Gregory J. Chaitin,et al. ALGORITHMIC ENTROPY OF SETS , 1976 .

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