scientific article; zbMATH DE number 3539202

Cited in

(82)

U-shaped, iterative, and iterative-with-counter learning
Parallelism increases iterative learning power
Incremental learning of approximations from positive data
Saving the phenomena: Requirements that inductive inference machines not contradict known data
Research in the theory of inductive inference by GDR mathematicians - A survey
Aggregating inductive expertise on partial recursive functions
Separation of uniform learning classes.
On learning formulas in the limit and with assurance.
Learning pattern languages over groups
A theory of formal synthesis via inductive learning
Learnability of automatic classes
On the power of incremental learning.
Incremental concept learning for bounded data mining.
Variants of iterative learning
Decision lists over regular patterns.
Robust learning -- rich and poor
Recursion theoretic models of learning: Some results and intuitions
Learning secrets interactively. Dynamic modeling in inductive inference
Automatic learning from positive data and negative counterexamples
Learning languages with decidable hypotheses
Towards a map for incremental learning in the limit from positive and negative information
A solution to Wiehagen's thesis
Results on memory-limited U-shaped learning
Some natural conditions on incremental learning
Iterative learning from positive data and negative counterexamples
On the role of update constraints and text-types in iterative learning
Automatic learners with feedback queries
Learning pattern languages over groups
Priced learning
Computability-theoretic learning complexity
Learning from Positive Data and Negative Counterexamples: A Survey
Gold-style learning theory. A selection of highlights since Gold
Automatic Learners with Feedback Queries
Parallelism Increases Iterative Learning Power
Learning in Friedberg Numberings
Iterative Learning of Simple External Contextual Languages
Dynamically Delayed Postdictive Completeness and Consistency in Learning
Dynamic Modeling in Inductive Inference
Hypothesis Spaces for Learning
Difficulties in Forcing Fairness of Polynomial Time Inductive Inference
Iterative Learning from Texts and Counterexamples Using Additional Information
Incremental Learning with Ordinal Bounded Example Memory
Learning from streams
Iterative learning from positive data and counters
Iterative learning from texts and counterexamples using additional information
Learning with ordinal-bounded memory from positive data
Memory limited inductive inference machines
Hypothesis spaces for learning
Learners based on transducers
Hierarchies of probabilistic and team FIN-learning
A comparison of identification criteria for inductive inference of recursive real-valued functions
Closedness properties in ex-identification
Learning all subfunctions of a function
Topological separations in inductive inference
Secretive interaction. Players and strategies
Monotonic and dual monotonic language learning
Automatic learning of subclasses of pattern languages
Mechanical turkeys
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 in the limit with lattice-structured hypothesis spaces
Resource restricted computability theoretic learning: Illustrative topics and problems
Some classical results in inductive inference of recursive functions
On the inference of approximate programs
From learning in the limit to stochastic finite learning
Learning recursive functions: A survey
Reflective inductive inference of recursive functions
Quantum inductive inference by finite automata
Developments from enquiries into the learnability of the pattern languages from positive data
Learning indexed families of recursive languages from positive data: A survey
Learning in Friedberg numberings
Iterative learning of simple external contextual languages
Incremental learning with temporary memory
On some open problems in monotonic and conservative learning

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 Q4115138)