Comparison of identification criteria for machine inductive inference
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3932417 (Why is no real title available?)
- scientific article; zbMATH DE number 3746428 (Why is no real title available?)
- scientific article; zbMATH DE number 3515457 (Why is no real title available?)
- scientific article; zbMATH DE number 3518782 (Why is no real title available?)
- scientific article; zbMATH DE number 3573853 (Why is no real title available?)
- scientific article; zbMATH DE number 3586480 (Why is no real title available?)
- scientific article; zbMATH DE number 3604877 (Why is no real title available?)
- scientific article; zbMATH DE number 605140 (Why is no real title available?)
- scientific article; zbMATH DE number 3431764 (Why is no real title available?)
- scientific article; zbMATH DE number 3206286 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- scientific article; zbMATH DE number 3387326 (Why is no real title available?)
- scientific article; zbMATH DE number 3404166 (Why is no real title available?)
- scientific article; zbMATH DE number 3420728 (Why is no real title available?)
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Anomaly hierarchies of mechanized inductive inference
- Classes of computable functions defined by bounds on computation
- Gödel numberings of partial recursive functions
- Language identification in the limit
- Mechanism, mentalism, and metamathematics. An essay on finitism
- On the size of machines
- Periodicity in generations of automata
- Research in the theory of inductive inference by GDR mathematicians - A survey
- Some decidability results on grammatical inference and complexity
- Some natural properties of strong-identification in inductive inference
- The Power of Pluralism for Automatic Program Synthesis
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
- Toward a mathematical theory of inductive inference
Cited in
(only showing first 100 items - show all)- Confident and consistent partial learning of recursive functions
- Dynamic Modeling in Inductive Inference
- scientific article; zbMATH DE number 605140 (Why is no real title available?)
- Learning via queries in [+, <]
- Optimal language learning from positive data
- Learning languages and functions by erasing
- Learning and classifying
- On the intrinsic complexity of learning recursive functions
- Learning multiple languages in groups
- 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
- Automata techniques for query inference machines
- Incremental concept learning for bounded data mining.
- Learning algebraic structures from text
- Machine learning of higher-order programs
- The synthesis of language learners.
- Hypothesis spaces for learning
- Learning recursive functions: A survey
- Probability and plurality for aggregations of learning machines
- Generality's price: Inescapable deficiencies in machine-learned programs
- Synthesizing inductive expertise
- Probabilistic language learning under monotonicity constraints
- Predictive learning models for concept drift
- A note on batch and incremental learnability
- Training sequences
- Language learning from texts: Degrees of intrinsic complexity and their characterizations
- Non-U-shaped vacillatory and team learning
- Inferring answers to queries
- The independence of control structures in abstract programming systems
- Learning by switching type of information.
- Computability-theoretic learning complexity
- Robust learning is rich
- Generalized notions of mind change complexity
- On an open problem in classification of languages
- Avoiding coding tricks by hyperrobust learning
- On a question about learning nearly minimal programs
- Training digraphs
- Towards a mathematical theory of machine discovery from facts
- Robust learning -- rich and poor
- Closedness properties in ex-identification
- Learning and extending sublanguages
- Identification of function distinguishable languages.
- Ordinal mind change complexity of language identification
- Saving the phenomena: Requirements that inductive inference machines not contradict known data
- Separation of uniform learning classes.
- On the power of inductive inference from good examples
- On the inference of approximate programs
- One-sided error probabilistic inductive inference and reliable frequency identification
- Anomalous learning helps succinctness
- An approach to intrinsic complexity of uniform learning
- Mind change speed-up for learning languages from positive data
- On the relative sizes of learnable sets
- Resource restricted computability theoretic learning: Illustrative topics and problems
- Generalization versus classification
- Learning families of closed sets in matroids
- Maximal machine learnable classes
- Learning via finitely many queries
- Recursion theoretic models of learning: Some results and intuitions
- Learning pattern languages over groups
- Realism, rhetoric, and reliability
- Extremes in the degrees of inferability
- Robust separations in inductive inference
- Learning from Positive Data and Negative Counterexamples: A Survey
- On the learnability of recursively enumerable languages from good examples
- Learning in the presence of partial explanations
- Iterative learning from positive data and negative counterexamples
- Infinitary self-reference in learning theory
- On the classification of recursive languages
- Learning languages from positive data and negative counterexamples
- Parsimony hierarchies for inductive inference
- Learning via queries and oracles
- Learning all subfunctions of a function
- Classes with easily learnable subclasses
- The complexity of finding SUBSEQ\((A)\)
- Inductive reasoning and Kolmogorov complexity
- Taming teams with mind changes
- Hierarchies of probabilistic and team FIN-learning
- Learnability and positive equivalence relations
- Invertible classes
- Inductive inference of approximations for recursive concepts
- Measure, category and learning theory
- Costs of general purpose learning
- Approximation methods in inductive inference
- Learning classes of approximations to non-recursive functions.
- Learning by the process of elimination
- Robust behaviorally correct learning.
- Learning to act and observe in partially observable domains
- Synthesizing noise-tolerant language learners
- Synthesizing learners tolerating computable noisy data
- Vacillatory and BC learning on noisy data
- On the amount of nonconstructivity in learning recursive functions
- Aggregating inductive expertise on partial recursive functions
- On learning of functions refutably.
- On aggregating teams of learning machines
- Learners based on transducers
- Structural measures for games and process control in the branch learning model
- Learning languages from positive data and a limited number of short counterexamples
- Learning-theoretic perspectives of acceptable numberings
This page was built for publication: Comparison of identification criteria for machine inductive inference
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q585192)
