scientific article; zbMATH DE number 3539202
From MaRDI portal
Publication:4115138
zbMath0346.02019MaRDI QIDQ4115138
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (69)
Decision lists over regular patterns. ⋮ A solution to Wiehagen's thesis ⋮ Robust learning -- rich and poor ⋮ Memory limited inductive inference machines ⋮ Automatic learners with feedback queries ⋮ Results on memory-limited U-shaped learning ⋮ From learning in the limit to stochastic finite learning ⋮ Saving the phenomena: Requirements that inductive inference machines not contradict known data ⋮ Learning pattern languages over groups ⋮ Learning all subfunctions of a function ⋮ A theory of formal synthesis via inductive learning ⋮ Computability-theoretic learning complexity ⋮ Recursion theoretic models of learning: Some results and intuitions ⋮ Learning from Positive Data and Negative Counterexamples: A Survey ⋮ Iterative learning from positive data and counters ⋮ Learning secrets interactively. Dynamic modeling in inductive inference ⋮ Iterative learning from texts and counterexamples using additional information ⋮ Gold-Style Learning Theory ⋮ Research in the theory of inductive inference by GDR mathematicians - A survey ⋮ Parallelism Increases Iterative Learning Power ⋮ Learning in Friedberg Numberings ⋮ Learning with ordinal-bounded memory from positive data ⋮ Iterative Learning of Simple External Contextual Languages ⋮ Dynamically Delayed Postdictive Completeness and Consistency in Learning ⋮ Dynamic Modeling in Inductive Inference ⋮ Separation of uniform learning classes. ⋮ 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 ⋮ Some natural conditions on incremental learning ⋮ Aggregating inductive expertise on partial recursive functions ⋮ Monotonic and dual monotonic language learning ⋮ Iterative learning from positive data and negative counterexamples ⋮ Automatic learning of subclasses of pattern languages ⋮ Learnability of automatic classes ⋮ Hypothesis spaces for learning ⋮ Automatic learning from positive data and negative counterexamples ⋮ Hierarchies of probabilistic and team FIN-learning ⋮ Iterative learning of simple external contextual languages ⋮ Incremental learning with temporary memory ⋮ Learning in the limit with lattice-structured hypothesis spaces ⋮ On some open problems in monotonic and conservative learning ⋮ Learners based on transducers ⋮ A comparison of identification criteria for inductive inference of recursive real-valued functions ⋮ Closedness properties in ex-identification ⋮ Topological separations in inductive inference ⋮ Resource restricted computability theoretic learning: Illustrative topics and problems ⋮ Hypothesis Spaces for Learning ⋮ U-shaped, iterative, and iterative-with-counter learning ⋮ Parallelism increases iterative learning power ⋮ Automatic Learners with Feedback Queries ⋮ Learning Pattern Languages over Groups ⋮ Incremental learning of approximations from positive data ⋮ 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 ⋮ Priced Learning ⋮ On the power of incremental learning. ⋮ Incremental concept learning for bounded data mining. ⋮ On the inference of approximate programs ⋮ On learning formulas in the limit and with assurance. ⋮ On the role of update constraints and text-types in iterative learning ⋮ Variants of iterative learning ⋮ Learning languages with decidable hypotheses ⋮ Towards a map for incremental learning in the limit from positive and negative information
This page was built for publication:
