The Power of Pluralism for Automatic Program Synthesis

Inductive reference machmes (IIMs) synthesize programs, given examples of their intended input-output behavior. Several different criteria for successful synthesis by llMs are defined. A given criterion is said to be more general than some other criterion if the class of sets which can be inferred by some IIM with respect to the given criterion is larger than the class of sets which can be referred by some IIM with respect to the other criterion A team of IIMs synthesizes programs for a set of functions if and only ff for each function m the set, at least one of the IIMs m the team successfully synthesizes the proper program. The trade-offs between the number of IIMs involved in the learnmg process and the generality of the criteria of success are examined

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

[2]  Hartley Rogers,et al.  Gödel numberings of partial recursive functions , 1958, Journal of Symbolic Logic.

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

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

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

[6]  Karlis Podnieks.  Comparing various concepts of function prediction. Part 1. , 1974 .

[7]  John D. Musa,et al.  A theory of software reliability and its application , 1975, IEEE Transactions on Software Engineering.

[8]  H. Putnam.  Mathematics, Matter, And Method , 1975 .

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

[10]  Eliana Minicozzi,et al.  Some Natural Properties of Strong-Identification in Inductive Inference , 1976, Theor. Comput. Sci..

[11]  L. Laudan.  Progress and Its Problems , 1977 .

[12]  John Case,et al.  Anomaly hierarchies of mechanized inductive inference , 1978, STOC.

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

[14]  Carl Herbert Smith.  Hierarchies of identification criteria for mechanized inductive inference. , 1979 .

[15]  Robert P. Daley.  On the Error Correcting Power of Pluralism in Inductive Inference , 1981, FCT.

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

[17]  Robert P. Daley.  On the Error Correcting Power of Pluralism in BC-Type Inductive Inference , 1983, Theoretical Computer Science.