Toward a Mathematical Theory of Inductive Inference

[1]  Robert P. Daley.  On the Inference of Optimal Descriptions , 1977, Theor. Comput. Sci..

[2]  Lenhart K. Schubert.  Representative Samples of Programmable Functions , 1974, Inf. Control..

[3]  Lenhart K. Schubert.  Iterated Limiting Recursion and the Program Minimization Problem , 1973, JACM.

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

[5]  Patrick C. Fischer,et al.  Computational speed-up by effective operators , 1972, Journal of Symbolic Logic.

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

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

[8]  James Jay Horning,et al.  A study of grammatical inference , 1969 .

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

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

[11]  Per Martin-Löf,et al.  The Definition of Random Sequences , 1966, Inf. Control..

[12]  Hilary Putnam,et al.  Trial and error predicates and the solution to a problem of Mostowski , 1965, Journal of Symbolic Logic.

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

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

[15]  M. Kendall,et al.  The Logic of Scientific Discovery. , 1959 .