scientific article; zbMATH DE number 517033
From MaRDI portal
Publication:4282560
Recommendations
Cited in
(65)- Prescribed learning of r.e. classes
- Probabilistic language learning under monotonicity constraints
- Noisy inference and oracles
- A theory of formal synthesis via inductive learning
- Learning classes of approximations to non-recursive functions.
- Trees and learning
- Generalized notions of mind change complexity
- Learning figures with the Hausdorff metric by fractals -- towards computable binary classification
- Automatic learning from positive data and negative counterexamples
- Maps of restrictions for behaviourally correct learning
- On the interplay between inductive inference of recursive functions, complexity theory and recursive numberings
- Mapping monotonic restrictions in inductive inference
- Normal forms for semantically witness-based learners in inductive inference
- Towards a map for incremental learning in the limit from positive and negative information
- Learning languages in the limit from positive information with finitely many memory changes
- A solution to Wiehagen's thesis
- Results on memory-limited U-shaped learning
- Iterative learning from positive data and negative counterexamples
- On the role of update constraints and text-types in iterative learning
- On reliability and refutability in nonconstructive identification
- A solution to Wiehagen's thesis
- scientific article; zbMATH DE number 4176473 (Why is no real title available?)
- A map of update constraints in inductive inference
- scientific article; zbMATH DE number 3855086 (Why is no real title available?)
- Strongly non-U-shaped language learning results by general techniques
- Prescribed Learning of R.E. Classes
- Learning in Friedberg Numberings
- Hypothesis Spaces for Learning
- scientific article; zbMATH DE number 3930986 (Why is no real title available?)
- scientific article; zbMATH DE number 3950511 (Why is no real title available?)
- scientific article; zbMATH DE number 4008385 (Why is no real title available?)
- scientific article; zbMATH DE number 4055080 (Why is no real title available?)
- Probabilistic Versus Deterministic Inductive Inference in Nonstandard Numberings
- scientific article; zbMATH DE number 1351087 (Why is no real title available?)
- An inductive inference approach to classification
- scientific article; zbMATH DE number 2077146 (Why is no real title available?)
- Inductive inference of recursive functions: qualitative theory
- Set-driven and rearrangement-independent learning of recursive languages
- scientific article; zbMATH DE number 4119662 (Why is no real title available?)
- On the role of search for learning from examples
- scientific article; zbMATH DE number 827975 (Why is no real title available?)
- Hypothesis spaces for learning
- Learners based on transducers
- Aspects of complexity of probabilistic learning under monotonicity constraints
- A comparison of identification criteria for inductive inference of recursive real-valued functions
- Topological separations in inductive inference
- Probabilistic language learning under monotonicity constraints
- Learnability and positive equivalence relations
- Optimal language learning from positive data
- Monotonic and dual monotonic language learning
- A learning-theoretic characterization of classes of recursive functions
- On the Weihrauch degree of the additive Ramsey theorem
- Hilbert's tenth problem for term algebras with a substitution operator
- Complemented subsets and Boolean-valued, partial functions
- Defining long words succinctly in FO and MSO
- On the first-order parts of problems in the Weihrauch degrees
- Algorithmically random series
- Ideal presentations and numberings of some classes of effective quasi-Polish spaces
- Lower bounds on () and other properties of -register machines
- Reifying dynamical algebra: maximal ideals in countable rings, constructively
- Maps for learning indexable classes
- Learning recursive functions: A survey
- Learning indexed families of recursive languages from positive data: A survey
- Learning and extending sublanguages
- Learning in Friedberg numberings
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4282560)
