Total complexity and the inference of best programs

The problem of choosing a “best” program for a function presented by example is considered. General axioms for total complexity involving time and size measures are presented. For measures obeying the axioms, certain positive and negative results are obtained on the existence of effective algorithms for learning the best program.

[1]  E. Mark Gold,et al.  Limiting recursion , 1965, Journal of Symbolic Logic.

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

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

[4]  David Pager.  On the Efficiency of Algorithms , 1970, JACM.

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

[6]  Sheldon Klein,et al.  The Autoling System , 1968 .

[7]  E. Mark Gold,et al.  Language Identification in the Limit , 1967, Inf. Control..

[8]  Jerome A. Feldman,et al.  Some Decidability Results on Grammatical Inference and Complexity , 1972, Inf. Control..

[9]  Dennis M. Ritchie,et al.  The complexity of loop programs , 1967, ACM National Conference.

[10]  Joshua Lederberg,et al.  A Heuristic Programming Study of Theory Formation in Science , 1971, IJCAI.

[11]  Jerome A. Feldman.  Automatic programming. , 1972 .

[12]  Herbert A. Simon,et al.  Experiments with a Heuristic Compiler , 1963, JACM.

[13]  K. S. Fu,et al.  On syntactic pattern recognition and stochastic languages , 1972 .

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

[15]  Alan W. Biermann,et al.  On the Inference of Turing Machines from Sample Computations , 1972, Artif. Intell..

[16]  Juris Hartmanis,et al.  An Overview of the Theory of Computational Complexity , 1971, JACM.

[17]  G. Plotkin.  Automatic Methods of Inductive Inference , 1972 .

[18]  James B. Morris.  Formal Languages and their Relation to Automata , 1970 .

[19]  Manuel Blum,et al.  Inductive Inference: A Recursion Theoretic Approach , 1973, SWAT.