Comparison of identification criteria for machine inductive inference
From MaRDI portal
(Redirected from Publication:585192)
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)- Learning families of closed sets in matroids
- Combining models of approximation with partial learning
- Learning recursive functions: A survey
- Non-U-shaped vacillatory and team learning
- Closedness properties in ex-identification
- Saving the phenomena: Requirements that inductive inference machines not contradict known data
- On the relative sizes of learnable sets
- On the influence of technology on learning processes
- Hierarchies of probabilistic and team FIN-learning
- Taming teams with mind changes
- Vacillatory and BC learning on noisy data
- Mind change complexity of learning logic programs
- Predictive learning models for concept drift
- Learners based on transducers
- Probabilistic language learning under monotonicity constraints
- Separation of uniform learning classes.
- Maximal machine learnable classes
- Extremes in the degrees of inferability
- Learning languages and functions by erasing
- On aggregating teams of learning machines
- Language learning from texts: Degrees of intrinsic complexity and their characterizations
- Learning and extending sublanguages
- On the inference of approximate programs
- One-sided error probabilistic inductive inference and reliable frequency identification
- On an open problem in classification of languages
- Generalization versus classification
- Structural measures for games and process control in the branch learning model
- Anomalous learning helps succinctness
- Realism, rhetoric, and reliability
- Trade-off among parameters affecting inductive inference
- Robust separations in inductive inference
- Learning classes of approximations to non-recursive functions.
- Learning by the process of elimination
- Robust behaviorally correct learning.
- On learning of functions refutably.
- Mind change speed-up for learning languages from positive data
- Absolutely no free lunches!
- Learning in the presence of inaccurate information
- Inferring answers to queries
- On a question about learning nearly minimal programs
- Training digraphs
- Towards a mathematical theory of machine discovery from facts
- Incremental concept learning for bounded data mining.
- Generalized notions of mind change complexity
- Learning to win process-control games watching game-masters
- Identification of function distinguishable languages.
- Learning and classifying
- Kolmogorov numberings and minimal identification
- On the interplay between inductive inference of recursive functions, complexity theory and recursive numberings
- Learning in the presence of partial explanations
- Prediction of Recursive Real-Valued Functions from Finite Examples
- Costs of general purpose learning
- Learning languages from positive data and a limited number of short counterexamples
- Learning languages from positive data and a finite number of queries
- The complexity of finding SUBSEQ(A)
- Machine learning of higher-order programs
- Aggregating inductive expertise on partial recursive functions
- Automata techniques for query inference machines
- The synthesis of language learners.
- Variations on U-shaped learning
- Recursion theoretic models of learning: Some results and intuitions
- Hypothesis spaces for learning
- Intrinsic complexity of learning geometrical concepts from positive data
- Trees and learning
- Learning-theoretic perspectives of acceptable numberings
- On the power of recursive optimizers
- Algorithmic identification of probabilities is hard
- Causal learning with Occam's razor
- Theory choice, theory change, and inductive truth-conduciveness
- On unstable and unoptimal prediction
- Learnability and positive equivalence relations
- Learning via queries in [+, <]
- Computability-theoretic learning complexity
- Counting extensional differences in BC-learning
- Learning pattern languages over groups
- Learning how to separate.
- On the learnability of recursively enumerable languages from good examples
- Learning languages from positive data and negative counterexamples
- Increasing the power of uniform inductive learners
- Gold-style learning theory. A selection of highlights since Gold
- An approach to intrinsic complexity of uniform learning
- Parsimony hierarchies for inductive inference
- Measure, category and learning theory
- Learning algebraic structures from text
- The independence of control structures in abstract programming systems
- Infinitary self-reference in learning theory
- Effectivity questions for Kleene's recursion theorem
- Learning theory and epistemology
- Effectivity questions for Kleene's recursion theorem
- Spatial/kinematic domain and lattice computers
- Synthesizing inductive expertise
- Resource restricted computability theoretic learning: Illustrative topics and problems
- On the inductive inference of recursive real-valued functions
- Learning all subfunctions of a function
- Classes with easily learnable subclasses
- Learning correction grammars
- A note on batch and incremental learnability
- Learning from Positive Data and Negative Counterexamples: A Survey
- On the intrinsic complexity of learning recursive functions
- Learning by switching type of information.
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)
