Complexity Issues for Vacillatory Function Identification

It was previously shown by Barzdin and Podnieks that one does not increase the power of learning programs for functions by allowing learning algorithms to converge to a finite set of correct programs instead of requiring them to converge to a single correct program. In this paper we define some new, subtle, but natural concepts of mind change complexity for function learning and show that, if one bounds this complexity for learning algorithms, then, by contrast with Barzdin and Podnieks result, there are interesting and sometimes complicated tradeoffs between these complexity bounds, bounds on the number of final correct programs, and learning power.

[1]  Gregory A. Riccardi.  The Independence of Control Structures in Abstract Programming Systems , 1981, J. Comput. Syst. Sci..

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

[3]  R. V. Freivald.  Minimal Gödel Numbers and Their Identification in the Limit , 1975, MFCS.

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

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

[6]  Rolf Wiehagen,et al.  On the Complexity of Program Synthesis from Examples , 1986, J. Inf. Process. Cybern..

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

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

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

[10]  E. Mark Gold,et al.  Complexity of Automaton Identification from Given Data , 1978, Inf. Control..

[11]  Keh-Jiann Chen,et al.  Tradeoffs in machine inductive inference , 1981 .

[12]  Dana Angluin,et al.  Finding Patterns Common to a Set of Strings , 1980, J. Comput. Syst. Sci..

[13]  Ya. M. Barzdin,et al.  Towards a Theory of Inductive Inference (in Russian) , 1973, MFCS.

[14]  Keh-Jiann Chen.  Tradeoffs in the Inductive Inference of Nearly Minimal Size Programs , 1982, Inf. Control..

[15]  John Case.  The power of vacillation , 1988, COLT '88.

[16]  Thomas Zeugmann.  On the Synthesis of Fastest Programs in Inductive Inference , 1983, J. Inf. Process. Cybern..

[17]  Daniel N. Osherson,et al.  Criteria of Language Learning , 1982, Inf. Control..

[18]  Yves Marcoux.  Composition is almost as good as s-1-1 , 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.

[19]  Carl H. Smith,et al.  On the Complexity of Inductive Inference , 1986, Inf. Control..

[20]  John Case,et al.  Convergence to nearly minimal size grammars by vacillating learning machines , 1989, COLT '89.

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