On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers

It is suggested that there are infinite computable sets of natural numbers with the property that no infinite subset can be computed more simply or more quickly than the whole set. Attempts to establish this without restricting in any way the computer involved in the calculations are not

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

[2]  É. Borel.  Leçons sur la théorie des fonctions , 2009 .

[3]  M. Blum,et al.  Machine dependence of degrees of difficulty. , 1965 .

[4]  Gregory J. Chaitin,et al.  On the Length of Programs for Computing Finite Binary Sequences: statistical considerations , 1969, JACM.

[5]  T. G.,et al.  Number: the Language of Science , 1931, Nature.

[6]  Tobias Dantzig,et al.  Number: the Language of Science , 1931 .

[7]  J. Hartmanis,et al.  On the Computational Complexity of Algorithms , 1965 .

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

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

[10]  G. Hardy,et al.  An Introduction to the Theory of Numbers , 1938 .

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

[12]  I︠u︡. V. Linnik,et al.  Elementary methods in analytic number theory , 1967 .

[13]  G. Sacks.  Degrees of unsolvability , 1965 .

[14]  Abraham Adolf Fraenkel,et al.  Abstract set theory , 1953 .

[15]  J. B. S. HALDANE,et al.  Number: the Language of Science , 1941, Nature.

[16]  Journal of the Association for Computing Machinery , 1961, Nature.

[17]  R. G. Cooke,et al.  Abstract Set Theory , 1954, Nature.

[18]  Ray J. Solomonoff,et al.  A Formal Theory of Inductive Inference. Part I , 1964, Inf. Control..

[19]  Ray J. Solomonoff,et al.  A Formal Theory of Inductive Inference. Part II , 1964, Inf. Control..

[20]  Gregory J. Chaitin,et al.  On the difficulty of computations , 1970, IEEE Trans. Inf. Theory.