Toward a mathematical theory of inductive inference
From MaRDI portal
Publication:4154852
Analysis of algorithms and problem complexity (68Q25) Automata and formal grammars in connection with logical questions (03D05) Recursive functions and relations, subrecursive hierarchies (03D20) Applications of computability and recursion theory (03D80) Algorithms in computer science (68W99) Turing machines and related notions (03D10) Computability and recursion theory (03D99)
Cited in
(only showing first 100 items - show all)- Taming teams with mind changes
- Learning languages and functions by erasing
- Some classes of Prolog programs inferable from positive data
- Iterative Learning of Simple External Contextual Languages
- Learning classes of approximations to non-recursive functions.
- Learning by the process of elimination
- Robust behaviorally correct learning.
- Some classes of term rewriting systems inferable from positive data
- Learning algebraic structures from text
- Minimal concept identification and reliability
- The synthesis of language learners.
- Incremental learning with temporary memory
- Iterative learning of simple external contextual languages
- Consistent and coherent learning with \(\delta \)-delay
- Synthesizing noise-tolerant language learners
- Synthesizing learners tolerating computable noisy data
- Probability and plurality for aggregations of learning machines
- Generality's price: Inescapable deficiencies in machine-learned programs
- Synthesizing inductive expertise
- Noisy inference and oracles
- Probabilistic language learning under monotonicity constraints
- A note on batch and incremental learnability
- On learning of functions refutably.
- Language learning from texts: Degrees of intrinsic complexity and their characterizations
- Inferring answers to queries
- Learning by switching type of information.
- Learning languages from positive data and a limited number of short counterexamples
- scientific article; zbMATH DE number 3503215 (Why is no real title available?)
- Variations on U-shaped learning
- Index sets in the arithmetical hierarchy
- Memory limited inductive inference machines
- On a question about learning nearly minimal programs
- Towards a mathematical theory of machine discovery from facts
- Characterizing language identification in terms of computable numberings
- Learning in Friedberg Numberings
- On some open problems in reflective inductive inference
- Learning languages with decidable hypotheses
- Learning languages from positive data and a finite number of queries
- Saving the phenomena: Requirements that inductive inference machines not contradict known data
- Separation of uniform learning classes.
- On the non-existence of maximal inference degrees for language identification
- Automatic learning of subclasses of pattern languages
- On the inference of approximate programs
- One-sided error probabilistic inductive inference and reliable frequency identification
- An approach to intrinsic complexity of uniform learning
- From learning in the limit to stochastic finite learning
- On the relative sizes of learnable sets
- Learning in the limit with lattice-structured hypothesis spaces
- Input-dependence in function-learning
- Numberings optimal for learning
- Recursion theoretic models of learning: Some results and intuitions
- Mapping monotonic restrictions in inductive inference
- Note on a central lemma for learning theory
- Increasing the power of uniform inductive learners
- Equivalences between learning of data and probability distributions, and their applications
- On some open problems in monotonic and conservative learning
- Parsimony hierarchies for inductive inference
- Automatic learners with feedback queries
- Trade-off among parameters affecting inductive inference
- The gap between abstract and concrete results in machine learning
- The complexity of finding SUBSEQ\((A)\)
- A model for science kinematics
- Confident and consistent partial learning of recursive functions
- Dynamic Modeling in Inductive Inference
- Monotonic and dual monotonic language learning
- Towards a new theory of confirmation
- Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism
- Incremental learning of approximations from positive data
- Quantum inductive inference by finite automata
- Research in the theory of inductive inference by GDR mathematicians - A survey
- scientific article; zbMATH DE number 605140 (Why is no real title available?)
- Unscrambling the quantum omelette
- Optimal language learning from positive data
- Learning with ordinal-bounded memory from positive data
- Learning and classifying
- Learning in the presence of inaccurate information
- Enlarging learnable classes
- Strongly non-U-shaped language learning results by general techniques
- Robust learning aided by context
- Incremental concept learning for bounded data mining.
- Learning efficient logic programs
- Machine learning of higher-order programs
- Learnability of automatic classes
- Reflective inductive inference of recursive functions
- Hypothesis spaces for learning
- Learning recursive functions: A survey
- Automatic Learners with Feedback Queries
- Relations between Gold-style learning and query learning
- Training sequences
- Learning languages in a union
- Non-U-shaped vacillatory and team learning
- Iterative learning from texts and counterexamples using additional information
- Ignoring data may be the only way to learn efficiently
- Prescribed learning of r.e. classes
- Computability-theoretic learning complexity
- Robust learning is rich
- Generalized notions of mind change complexity
- Incremental Learning with Ordinal Bounded Example Memory
- Investigations on measure-one identification of classes of languages
- On an open problem in classification of languages
This page was built for publication: Toward a mathematical theory of inductive inference
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4154852)
