Learnability and Positive Equivalence Relations

Prior work of Gavryushkin, Khoussainov, Jain and Stephan investigated what algebraic structures can be realised in worlds given by a positive (= recursively enumerable) equivalence relation which partitions the natural numbers into infinitely many equivalence classes. The present work investigates the infinite one-one numbered recursively enumerable (r.e.) families realised by such relations and asks how the choice of the equivalence relation impacts the learnability properties of these classes when studying learnability in the limit from positive examples, also known as learning from text. For all choices of such positive equivalence relations, for each of the following entries, there are one-one numbered r.e. families which satisfy it: (a) they are behaviourally correctly learnable but not vacillatorily learnable; (b) they are explanatorily learnable but not confidently learnable; (c) they are not behaviourally correctly learnable. Furthermore, there is a positive equivalence relation which enforces that (d) every vacillatorily learnable one-one numbered family of languages closed under this equivalence relation is already explanatorily learnable and cannot be confidently learnable.

[1]  John Case,et al.  Machine Inductive Inference and Language Identification , 1982, ICALP.

[2]  Timo Kötzing,et al.  Towards an Atlas of Computational Learning Theory , 2016, STACS.

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

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

[5]  Thomas Zeugmann,et al.  Language learning in dependence on the space of hypotheses , 1993, COLT '93.

[6]  Emmy Noether.  Idealtheorie in Ringbereichen , 1921 .

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

[8]  Günter Asser,et al.  Zeitschrift für mathematische Logik und Grundlagen der Mathematik , 1955 .

[9]  John Case,et al.  The Synthesis of Language Learners , 1999, Inf. Comput..

[10]  Martin Kummer.  An Easy Priority-Free Proof of a Theorem of Friedberg , 1990, Theor. Comput. Sci..

[11]  Yasuhito Mukouchi,et al.  Characterization of Finite Identification , 1992, AII.

[12]  Walter Baur,et al.  Rekursive Algebren mit Kettenbedingungen , 1974 .

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

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

[15]  N. Bazhenov,et al.  Learning families of algebraic structures from informant , 2019, Inf. Comput..

[16]  John Case,et al.  Vacillatory and BC learning on noisy data , 1996, Theor. Comput. Sci..

[17]  Thomas Zeugmann,et al.  Monotonic Versus Nonmonotonic Language Learning , 1991, Nonmonotonic and Inductive Logic.

[18]  Robert I. Soare,et al.  Recursively enumerable sets and degrees - a study of computable functions and computability generated sets , 1987, Perspectives in mathematical logic.

[19]  Klaus P. Jantke,et al.  Monotonic and Nonmonotonic Inductive Inference of Functions and Patterns , 1990, Nonmonotonic and Inductive Logic.

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

[21]  Yu. L. Ershov.  Positive equivalences , 1971 .

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

[23]  Sanjay Jain,et al.  Graphs realised by r.e. equivalence relations , 2014, Ann. Pure Appl. Log..

[24]  Thomas Zeugmann,et al.  Types of monotonic language learning and their characterization , 1992, COLT '92.

[25]  D. C. Cooper,et al.  Theory of Recursive Functions and Effective Computability , 1969, The Mathematical Gazette.

[26]  Yuri L. Ershov,et al.  Theory of Numberings , 1999, Handbook of Computability Theory.

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

[28]  Thomas Zeugmann,et al.  Learning Recursive Languages with Bounded Mind Changes , 1993, Int. J. Found. Comput. Sci..

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

[30]  Jerome A. Feldman,et al.  Some Decidability Results on Grammatical Inference and Complexity , 1972, Inf. Control..

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

[32]  Timo Kötzing,et al.  Limit Learning Equivalence Structures , 2019, ALT.

[33]  Sanjay Jain,et al.  Prescribed Learning of R.E. Classes , 2007, ALT.

[34]  Frank Stephan,et al.  Reducibilities among equivalence relations induced by recursively enumerable structures , 2016, Theor. Comput. Sci..

[35]  Rolf Wiehagen.  A Thesis in Inductive Inference , 1990, Nonmonotonic and Inductive Logic.

[36]  Ekaterina B. Fokina,et al.  Linear Orders Realized by C.E. Equivalence Relations , 2016, J. Symb. Log..

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