The following pages link to (Q3704910):
Displaying 50 items.
- On the role of update constraints and text-types in iterative learning (Q259061) (← links)
- Inductive inference and reverse mathematics (Q324252) (← links)
- Strongly non-U-shaped language learning results by general techniques (Q342700) (← links)
- Mind change speed-up for learning languages from positive data (Q388110) (← links)
- Learning and classifying (Q390916) (← links)
- Iterative learning from texts and counterexamples using additional information (Q415613) (← links)
- Hypothesis spaces for learning (Q553319) (← links)
- Comparison of identification criteria for machine inductive inference (Q585192) (← links)
- Monotonic and dual monotonic language learning (Q672148) (← links)
- Characterizing language identification in terms of computable numberings (Q676311) (← links)
- On the non-existence of maximal inference degrees for language identification (Q685478) (← links)
- Resource restricted computability theoretic learning: Illustrative topics and problems (Q733738) (← links)
- Input-dependence in function-learning (Q733744) (← links)
- On the inference of approximate programs (Q803121) (← links)
- Prudence and other conditions on formal language learning (Q912648) (← links)
- Learning indexed families of recursive languages from positive data: A survey (Q924177) (← 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)
- Iterative learning of simple external contextual languages (Q982646) (← links)
- U-shaped, iterative, and iterative-with-counter learning (Q1009263) (← links)
- Prescribed learning of r.e. classes (Q1017658) (← links)
- Parallelism increases iterative learning power (Q1017664) (← links)
- Incremental learning of approximations from positive data (Q1029042) (← links)
- Learning in the presence of partial explanations (Q1183607) (← links)
- Learning with refutation (Q1278041) (← links)
- Maximal machine learnable classes (Q1305936) (← links)
- 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)
- Probabilistic language learning under monotonicity constraints (Q1390945) (← links)
- Learning by switching type of information. (Q1427864) (← links)
- Language learning from texts: Degrees of intrinsic complexity and their characterizations (Q1604194) (← links)
- Inductive inference with additional information. (Q1608312) (← links)
- Learning pattern languages over groups (Q1663643) (← links)
- The synthesis of language learners. (Q1854290) (← links)
- Intrinsic complexity of learning geometrical concepts from positive data (Q1877693) (← links)
- Automatic learning from positive data and negative counterexamples (Q2013555) (← links)
- Maps of restrictions for behaviourally correct learning (Q2104257) (← links)
- Learning languages with decidable hypotheses (Q2117759) (← links)
- Mapping monotonic restrictions in inductive inference (Q2117774) (← links)
- Normal forms for semantically witness-based learners in inductive inference (Q2117775) (← links)
- Learnability and positive equivalence relations (Q2232273) (← links)
- Results on memory-limited U-shaped learning (Q2384927) (← links)
- Intrinsic complexity of partial learning (Q2419119) (← links)
- Iterative learning from positive data and negative counterexamples (Q2464142) (← links)
- A general comparison of language learning from examples and from queries (Q2465036) (← links)
- Learning multiple languages in groups (Q2465037) (← links)
- Learning languages from positive data and a limited number of short counterexamples (Q2465639) (← links)
