Control Structures in Hypothesis Spaces: The Influence on Learning

In any learnability setting, hypotheses are conjectured from some hypothesis space. Studied herein are the effects on learnability of the presence or absence of certain control structures in the hypothesis space. First presented are control structure characterizations of some rather specific but illustrative learnability results. Then presented are the main theorems. Each of these characterizes the invariance of a learning class over hypothesis space V (and a little more about V) as: V has suitable instances of all denotational control structures.

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

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

[3]  J. Ross Quinlan,et al.  C4.5: Programs for Machine Learning , 1992 .

[4]  Joseph E. Stoy,et al.  Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory , 1981 .

[5]  John Case,et al.  The Power of Vacillation in Language Learning , 1999, SIAM J. Comput..

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

[7]  Rusins Freivalds,et al.  Inductive Inference and Computable One-One Numberings , 1982, Math. Log. Q..

[8]  P. Odifreddi.  Classical recursion theory , 1989 .

[9]  John A. Allen,et al.  The anatomy of lisp , 1980 .

[10]  A. Church.  The calculi of lambda-conversion , 1941 .

[11]  Carl H. Smith,et al.  On the Intrinsic Complexity of Learning , 1995, Inf. Comput..

[12]  Arun Sharma,et al.  On the intrinsic complexity of language identification , 1994, COLT '94.

[13]  Dana Angluin,et al.  Inductive Inference of Formal Languages from Positive Data , 1980, Inf. Control..

[14]  Alberto Maria Segre,et al.  Programs for Machine Learning , 1994 .

[15]  Mark A. Fulk.  Prudence and Other Conditions on Formal Language Learning , 1990, Inf. Comput..

[16]  Elaine J. Weyuker,et al.  14 – Abstract Complexity , 1994 .

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

[18]  Rolf Wiehagen,et al.  Characterization Problems in the Theory of Inductive Inference , 1978, ICALP.

[19]  Richard M. Friedberg,et al.  Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication , 1958, Journal of Symbolic Logic.

[20]  Carl H. Smith,et al.  Co-learning of total recursive functions , 1994, COLT '94.

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

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

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

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

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

[26]  Claude Sammut,et al.  Learning to Fly , 1992, ML.

[27]  Thomas Zeugmann,et al.  A Guided Tour Across the Boundaries of Learning Recursive Languages , 1995, GOSLER Final Report.

[28]  Arun Sharma,et al.  The Intrinsic Complexity of Language Identification , 1996, J. Comput. Syst. Sci..

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

[30]  Martin Kummer.  A Note on Direct Sums of Friedbergnumberings , 1989, J. Symb. Log..

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

[32]  Kenneth W. Regan,et al.  Computability , 2022, Algorithms and Theory of Computation Handbook.

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

[34]  Elaine J. Weyuker,et al.  Computability, complexity, and languages , 1983 .

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

[36]  J. Case,et al.  Subrecursive Programming Systems: Complexity & Succinctness , 1994 .

[37]  James S. Royer,et al.  Subrecursive Programming Systems , 1994, Progress in Theoretical Computer Science.