Aspects of complexity of probabilistic learning under monotonicity constraints
From MaRDI portal
Publication:5958648
DOI10.1016/S0304-3975(00)00273-5zbMath0992.68169MaRDI QIDQ5958648
No author found.
Publication date: 3 March 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Monotonic and dual monotonic language learning
- Monotonic and non-monotonic inductive inference
- On the power of probabilistic strategies in inductive inference
- On the structure of degrees of inferability.
- Learning regular sets from queries and counterexamples
- Generalization and specialization strategies for learning r. e. languages
- Identifying nearly minimal Gödel numbers from additional information
- Classical recursion theory. Vol. II
- Extremes in the degrees of inferability
- Probabilistic language learning under monotonicity constraints
- Noisy inference and oracles
- On the intrinsic complexity of learning
- A theory of the learnable
- The position of index sets of identifiable sets in the arithmetical hierarchy
- Probabilistic Versus Deterministic Inductive Inference in Nonstandard Numberings
- Probabilistic inductive inference
- Inductive inference of formal languages from positive data
- Learning via queries
- Criteria of language learning
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Language identification in the limit
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
