Inductive inference of automata, functions and programs
From MaRDI portal
Cited in
(27)- On the power of recursive optimizers
- Learnability of automatic classes
- Learning secrets interactively. Dynamic modeling in inductive inference
- On the interplay between inductive inference of recursive functions, complexity theory and recursive numberings
- Towards a map for incremental learning in the limit from positive and negative information
- A solution to Wiehagen's thesis
- On the role of update constraints and text-types in iterative learning
- Robust learning of automatic classes of languages
- Confident and consistent partial learning of recursive functions
- Hypothesis spaces for learning
- Learners based on transducers
- Optimal language learning from positive data
- 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
- On the power of probabilistic strategies in inductive inference
- Learning recursive functions: A survey
- Learning indexed families of recursive languages from positive data: A survey
- Consistent and coherent learning with \(\delta \)-delay
- On some open problems in reflective inductive inference
This page was built for publication: Inductive inference of automata, functions and programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4155651)
