scientific article; zbMATH DE number 517033
From MaRDI portal
Publication:4282560
zbMath0794.03058MaRDI QIDQ4282560
Publication date: 17 March 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Learning and adaptive systems in artificial intelligence (68T05) Probability and inductive logic (03B48) Recursive functions and relations, subrecursive hierarchies (03D20)
Related Items (37)
Trees and learning ⋮ A solution to Wiehagen's thesis ⋮ Generalized notions of mind change complexity ⋮ Results on memory-limited U-shaped learning ⋮ A map of update constraints in inductive inference ⋮ Strongly non-U-shaped language learning results by general techniques ⋮ A theory of formal synthesis via inductive learning ⋮ Probabilistic language learning under monotonicity constraints ⋮ Noisy inference and oracles ⋮ Learning figures with the Hausdorff metric by fractals -- towards computable binary classification ⋮ Prescribed Learning of R.E. Classes ⋮ Learning in Friedberg Numberings ⋮ Optimal language learning from positive data ⋮ Learning recursive functions: A survey ⋮ Learning indexed families of recursive languages from positive data: A survey ⋮ Learning and extending sublanguages ⋮ Learning in Friedberg numberings ⋮ Monotonic and dual monotonic language learning ⋮ Iterative learning from positive data and negative counterexamples ⋮ A learning-theoretic characterization of classes of recursive functions ⋮ Probabilistic language learning under monotonicity constraints ⋮ Hypothesis spaces for learning ⋮ Automatic learning from positive data and negative counterexamples ⋮ Learnability and positive equivalence relations ⋮ Learners based on transducers ⋮ Aspects of complexity of probabilistic learning under monotonicity constraints ⋮ Topological separations in inductive inference ⋮ Hypothesis Spaces for Learning ⋮ Prescribed learning of r.e. classes ⋮ Set-driven and rearrangement-independent learning of recursive languages ⋮ Learning classes of approximations to non-recursive functions. ⋮ Maps of restrictions for behaviourally correct learning ⋮ On the role of update constraints and text-types in iterative learning ⋮ 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
This page was built for publication:
