The following pages link to Sanjay Jain (Q197705):
Displaying 50 items.
- Program size restrictions in computational learning (Q1342242) (← links)
- Learning in the presence of inaccurate information (Q1351959) (← links)
- On aggregating teams of learning machines (Q1367526) (← links)
- Kolmogorov numberings and minimal identification (Q1389656) (← links)
- On the intrinsic complexity of learning recursive functions (Q1398370) (← links)
- Learning how to separate. (Q1426149) (← links)
- Learning by switching type of information. (Q1427864) (← links)
- Robust learning aided by context (Q1567396) (← links)
- Learning languages and functions by erasing (Q1575464) (← links)
- Ordinal mind change complexity of language identification (Q1575840) (← links)
- Mind change complexity of learning logic programs (Q1603595) (← links)
- Language learning from texts: Degrees of intrinsic complexity and their characterizations (Q1604194) (← links)
- Learning pattern languages over groups (Q1663643) (← links)
- Regular patterns, regular languages and context-free languages (Q1675877) (← links)
- Semiautomatic structures (Q1694004) (← links)
- The complexity of verbal languages over groups (Q1713480) (← links)
- Learnability of automatic classes (Q1757849) (← links)
- The synthesis of language learners. (Q1854290) (← links)
- Incremental concept learning for bounded data mining. (Q1854293) (← links)
- Robust behaviorally correct learning. (Q1854310) (← links)
- On a generalized notion of mistake bounds (Q1854426) (← links)
- On learning of functions refutably. (Q1874231) (← links)
- Intrinsic complexity of learning geometrical concepts from positive data (Q1877693) (← links)
- Robust learning -- rich and poor (Q1880777) (← links)
- Counting extensional differences in BC-learning (Q1887167) (← links)
- Complexity issues for vacillatory function identification (Q1891146) (← links)
- Finite identification of functions by teams with success ratio \(\frac 12\) and above (Q1899912) (← links)
- Language learning with some negative information (Q1900931) (← links)
- Machine induction without revolutionary changes in hypothesis size (Q1923103) (← links)
- The intrinsic complexity of language identification (Q1924378) (← links)
- Learning without coding (Q1939265) (← links)
- Team learning of computable languages (Q1969436) (← links)
- Automatic learning from positive data and negative counterexamples (Q2013555) (← links)
- On the amount of nonconstructivity in learning formal languages from text (Q2051759) (← links)
- Lamplighter groups and automata (Q2170284) (← links)
- Learnability and positive equivalence relations (Q2232273) (← links)
- Bi-immunity over different size alphabets (Q2243580) (← links)
- The isomorphism problem for tree-automatic ordinals with addition (Q2274485) (← links)
- Searching for shortest and least programs (Q2286740) (← links)
- Reductions between types of numberings (Q2326424) (← links)
- Exact satisfiabitity with jokers (Q2327478) (← links)
- Graphs realised by r.e. equivalence relations (Q2349100) (← links)
- Generality's price: Inescapable deficiencies in machine-learned programs (Q2368918) (← links)
- Invertible classes (Q2382282) (← links)
- Results on memory-limited U-shaped learning (Q2384927) (← links)
- Enumerations including laconic enumerators (Q2410366) (← links)
- Intrinsic complexity of partial learning (Q2419119) (← links)
- Uncountable automatic classes and learning (Q2431428) (← links)
- Some natural conditions on incremental learning (Q2461797) (← links)
- Iterative learning from positive data and negative counterexamples (Q2464142) (← links)
