Recursion Theoretic Characterizations of Language Learning

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

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

[3]  D. Osherson,et al.  A note on formal learning theory , 1982, Cognition.

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

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

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

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

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

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

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

[11]  S. Pinker.  Formal models of language learning , 1979, Cognition.

[12]  James S. Royer,et al.  Inductive Inference of Approximations , 1986, Inf. Control..

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

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

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