Learning programs with an easy to calculate set of errors

We continued the study of learning an approximation to the desired function. Rather than measure the variance between the desired function and the approximation, we accounted for the difficulty of deciding membership in the set points comprising the variance. Our results indicate that the more complex a decision procedure is allowed, the larger the class of functions that become inferrible.

[1]  Stephen Cole Kleene,et al.  On notation for ordinal numbers , 1938, Journal of Symbolic Logic.

[2]  Alan L. Selman,et al.  A Hierarchy Theorem for Almost Everywhere Complex Sets With Application to Polynomial Complexity Degrees , 1987, Symposium on Theoretical Aspects of Computer Science.

[3]  R. Harré,et al.  Probability and Confirmation , 1970 .

[4]  Paul Young,et al.  An introduction to the general theory of algorithms , 1978 .

[5]  Leonard Pitt,et al.  A Characterization of Probabilistic Inference , 1984, FOCS.

[6]  Carl H. Smith,et al.  The Power of Pluralism for Automatic Program Synthesis , 1982, JACM.

[7]  Carl H. Smith,et al.  Inductive Inference: Theory and Methods , 1983, CSUR.

[8]  Carl H. Smith,et al.  Probability and Plurality for Aggregations of Learning Machines , 1987, Inf. Comput..

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

[10]  Manuel Blum,et al.  Toward a Mathematical Theory of Inductive Inference , 1975, Inf. Control..

[11]  John Case,et al.  Comparison of Identification Criteria for Machine Inductive Inference , 1983, Theor. Comput. Sci..

[12]  James S. Royer,et al.  Inductive Inference of Approximations , 1986, Inf. Control..

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

[14]  Carl H. Smith,et al.  Trade-Off among Parameters Effecting Inductive Inference , 1989, Inf. Comput..

[15]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .