On learning limiting programs

Machine learning of <italic>limit programs</italic> (i.e., programs allowed finitely many mind changes about their legitimate outputs) for <italic>computable</italic> functions is studied. Learning of <italic>iterated</italic> limit programs is also studied. To partially motivate these studies, it is shown that, in some cases, interesting global properties of computable functions can be proved from suitable (<italic>n</italic>+1)-iterated limit programs for them which can <italic>not</italic> be proved from <italic>any n</italic>-iterated limit programs for them. It is shown that learning power is increased when (<italic>n</italic>+1)-iterated limit programs rather than <italic>n</italic>-iterated limit programs are to be learned. Many tradeoff results are obtained regarding learning power, number (possibly zero) of limits taken, program size constraints, and number of errors tolerated in final programs learned.

[1]  Elliott Mendelson,et al.  Introduction to Mathematical Logic , 1979 .

[2]  M. W. Shields An Introduction to Automata Theory , 1988 .

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

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

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

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

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

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

[9]  Rolf Wiehagen,et al.  Inductive Inference with Additional Information , 1979, J. Inf. Process. Cybern..

[10]  James S. Royer A Connotational Theory of Program Structure , 1987, Lecture Notes in Computer Science.

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

[12]  Daniel N. Osherson,et al.  Systems That Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists , 1990 .

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

[14]  Rusins Freivalds,et al.  Connections between Identifying Functionals, standardizing Operations, and Computable Numberings , 1984, Math. Log. Q..

[15]  W. Browder,et al.  Annals of Mathematics , 1889 .

[16]  S. Feferman Arithmetization of metamathematics in a general setting , 1959 .

[17]  Arun Sharma,et al.  Learning with the Knowledge of an Upper Bound on Program Size , 1993, Inf. Comput..

[18]  R. Soare Recursively enumerable sets and degrees , 1987 .

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

[20]  John Case,et al.  Machine Learning of Higher-Order Programs , 1994, J. Symb. Log..

[21]  N. A. Lynch RELATIVIZATION OF THE THEORY OF COMPUTATION COMPLEXITY , 1972 .

[22]  John Case,et al.  Strong separation of learning classes , 1992, J. Exp. Theor. Artif. Intell..

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

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

[25]  Elliott Mendelson,et al.  Introduction to mathematical logic (3. ed.) , 1987 .

[26]  N. Shapiro Review: E. Mark Gold, Limiting Recursion; Hilary Putnam, Trial and Error Predicates and the Solution to a Problem of Mostowski , 1971 .

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

[28]  Joseph R. Shoenfield,et al.  Degrees of unsolvability , 1959, North-Holland mathematics studies.

[29]  William Craig,et al.  On axiomatizability within a system , 1953, Journal of Symbolic Logic.

[30]  Rolf Wiehagen,et al.  Research in the theory of inductive inference by GDR mathematicians - A survey , 1980, Inf. Sci..

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

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

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

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

[35]  Mark A. Fulk A study of inductive inference machines , 1986 .