The following pages link to Sanjay Jain (Q197705):
Displaying 50 items.
- (Q235645) (redirect page) (← links)
- On the role of update constraints and text-types in iterative learning (Q259061) (← links)
- Tree-automatic scattered linear orders (Q264574) (← links)
- On a question of nearly minimal identification of functions (Q294675) (← links)
- (Q324250) (redirect page) (← links)
- Inductive inference and reverse mathematics (Q324252) (← links)
- Parallel learning of automatic classes of languages (Q329605) (← links)
- Enlarging learnable classes (Q342717) (← links)
- Mind change speed-up for learning languages from positive data (Q388110) (← links)
- Learning and classifying (Q390916) (← links)
- (Q415612) (redirect page) (← links)
- Iterative learning from texts and counterexamples using additional information (Q415613) (← links)
- Learning with ordinal-bounded memory from positive data (Q440010) (← links)
- (Q553318) (redirect page) (← links)
- Hypothesis spaces for learning (Q553319) (← links)
- (Q588393) (redirect page) (← links)
- Learning all subfunctions of a function (Q596299) (← links)
- Classes with easily learnable subclasses (Q598186) (← links)
- Anomalous learning helps succinctness (Q671420) (← links)
- On a question about learning nearly minimal programs (Q674285) (← links)
- Elementary formal systems, intrinsic complexity, and procrastination (Q675045) (← links)
- Computational limits on team identification of languages (Q675220) (← links)
- Characterizing language identification in terms of computable numberings (Q676311) (← links)
- Program synthesis in the presence of infinite number of inaccuracies (Q676462) (← links)
- On the non-existence of maximal inference degrees for language identification (Q685478) (← links)
- Automatic learning of subclasses of pattern languages (Q690501) (← links)
- Index sets and universal numberings (Q716308) (← links)
- Input-dependence in function-learning (Q733744) (← links)
- Ordered semiautomatic rings with applications to geometry (Q782566) (← links)
- Learning languages in a union (Q859985) (← links)
- Learning a subclass of regular patterns in polynomial time (Q860829) (← links)
- Absolute versus probabilistic classification in a logical setting (Q924172) (← links)
- Learning and extending sublanguages (Q924178) (← links)
- Non-U-shaped vacillatory and team learning (Q927864) (← links)
- Learning languages from positive data and negative counterexamples (Q927865) (← links)
- Learning in Friedberg numberings (Q939445) (← links)
- Numberings optimal for learning (Q972383) (← links)
- On some open problems in reflective inductive inference (Q976076) (← links)
- Iterative learning of simple external contextual languages (Q982646) (← links)
- Incremental learning with temporary memory (Q982647) (← links)
- On some open problems in monotonic and conservative learning (Q989527) (← links)
- Prescribed learning of r.e. classes (Q1017658) (← links)
- One-shot learners using negative counterexamples and nearest positive examples (Q1029327) (← links)
- Learning in the presence of partial explanations (Q1183607) (← links)
- Learning with the knowledge of an upper bound on program size (Q1207954) (← links)
- Generalization and specialization strategies for learning r. e. languages (Q1273750) (← links)
- Learning with refutation (Q1278041) (← links)
- Extremes in the degrees of inferability (Q1319507) (← links)
- Characterizing language identification by standardizing operations (Q1333402) (← links)
- Approximate inference and scientific method (Q1341770) (← links)
