Pages that link to "Item:Q1898458"
From MaRDI portal
The following pages link to Characterizations of monotonic and dual monotonic language learning (Q1898458):
Displaying 26 items.
- Inductive inference and reverse mathematics (Q324252) (← links)
- Hypothesis spaces for learning (Q553319) (← links)
- Classes with easily learnable subclasses (Q598186) (← links)
- On the classification of recursive languages (Q598240) (← links)
- Monotonic and dual monotonic language learning (Q672148) (← links)
- Case-based representation and learning of pattern languages (Q674401) (← links)
- From learning in the limit to stochastic finite learning (Q860825) (← links)
- Prescribed learning of r.e. classes (Q1017658) (← links)
- Necessary and sufficient conditions for learning with correction queries (Q1034636) (← links)
- Noisy inference and oracles (Q1390946) (← links)
- Learning languages and functions by erasing (Q1575464) (← links)
- Learnability of automatic classes (Q1757849) (← links)
- The synthesis of language learners. (Q1854290) (← links)
- Incremental concept learning for bounded data mining. (Q1854293) (← links)
- Generalized notions of mind change complexity (Q1881221) (← links)
- Learning figures with the Hausdorff metric by fractals -- towards computable binary classification (Q1945017) (← links)
- On the data consumption benefits of accepting increased uncertainty (Q2381574) (← links)
- Prescribed Learning of R.E. Classes (Q3520050) (← links)
- A Note on the Relationship between Different Types of Correction Queries (Q3528420) (← links)
- Hypothesis Spaces for Learning (Q3618566) (← links)
- On the classification of computable languages (Q5048927) (← links)
- Vacillatory and BC learning on noisy data (Q5915395) (← links)
- Synthesizing noise-tolerant language learners (Q5941367) (← links)
- Synthesizing learners tolerating computable noisy data (Q5943099) (← links)
- Partial learning of recursively enumerable languages (Q5964064) (← links)
- Topological separations in inductive inference (Q5964065) (← links)
