On the intrinsic complexity of learning recursive functions

The intrinsic complexity of learning compares the difficulty of learning classes of objects by using some reducibility notion. For several types of learning recursive functions, both natural complete classes are exhibited and necessary and sufficient conditions for completeness are derived. Informally, a class is complete iff both its topological structure is highly complex while its algorithmic structure is easy. Some self-describing classes turn out to be complete. Furthermore, the structure of the intrinsic complexity is shown to be much richer than the structure of the mind change complexity, though in general, intrinsic complexity and mind change complexity can behave "orthogonally".

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

[2]  Klaus P. Jantke,et al.  Combining Postulates of Naturalness in Inductive Inference , 1981, J. Inf. Process. Cybern..

[3]  Carl H. Smith,et al.  Recursion theoretic models of learning: Some results and intuitions , 2005, Annals of Mathematics and Artificial Intelligence.

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

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

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

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

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

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

[10]  Jochen Nessel Birds can fly… , 1998, COLT' 98.

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

[12]  Rusins Freivalds,et al.  Inductive Inference of Recursive Functions: Complexity Bounds , 1991, Baltic Computer Science.

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

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

[15]  Carl H. Smith,et al.  A Recursive Introduction to the Theory of Computation , 1994, Graduate Texts in Computer Science.

[16]  Rusins Freivalds,et al.  Inductive Inference of Recursive Functions: Qualitative Theory , 1991, Baltic Computer Science.

[17]  Frank Stephan,et al.  On one-sided versus two-sided classification , 2001, Arch. Math. Log..

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

[19]  Carl H. Smith,et al.  On the Role of Procrastination in Machine Learning , 1993, Inf. Comput..

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

[21]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[22]  Efim Kinber,et al.  On the Classification of Computable Languages , 1997, STACS.

[23]  Martin Kummer A Learning-Theoretic Characterization of Classes of Recursive Functions , 1995, Inf. Process. Lett..

[24]  Leonard Pitt,et al.  Prediction-Preserving Reducibility , 1990, J. Comput. Syst. Sci..

[25]  Andris Ambainis,et al.  Ordinal Mind Change Complexity of Language Identification , 1997, Theor. Comput. Sci..