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 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.
- Robust learning is rich
- Probability and plurality for aggregations of learning machines
- Confident and consistent partial learning of recursive functions
- Learning to act and observe in partially observable domains
- Secretive interaction. Players and strategies
- On the power of inductive inference from good examples
- Invertible classes
- On the amount of nonconstructivity in learning recursive functions
- Learning via finitely many queries
- Learning pattern languages over groups
- Optimal language learning from positive data
- Memory limited inductive inference machines
- Robust learning aided by context
- Avoiding coding tricks by hyperrobust learning
- Ordinal mind change complexity of language identification
- Learning secrets interactively. Dynamic modeling in inductive inference
- Training sequences
- Learning recursive functions from approximations
- scientific article; zbMATH DE number 605140 (Why is no real title available?)
- Enlarging learnable classes
- Strongly non-U-shaped language learning results by general techniques
- Iterative learning from positive data and negative counterexamples
- The power of probabilism in Popperian FINite learning
- Machine induction without revolutionary paradigm shifts
- Simulating teams with many conjectures
- Robust learning -- rich and poor
- The logic of reliable and efficient inquiry
- Learning via queries and oracles
- Learning families of algebraic structures from informant
- Learning multiple languages in groups
- Dynamic Modeling in Inductive Inference
- On the classification of recursive languages
- Inductive reasoning and Kolmogorov complexity
- Approximation methods in inductive inference
- Inductive inference of approximations for recursive concepts
- Synthesizing noise-tolerant language learners
- Synthesizing learners tolerating computable noisy data
- Partial learning of recursively enumerable languages
- Random Subgroups of Rationals
- Explanatory and creative alternatives to the MDL principle
- On the danger of half-truths
- Hypothesis Spaces for Learning
- Generality's price: Inescapable deficiencies in machine-learned programs
- Learnability and positive equivalence relations
- Is Gold-Putnam diagonalization complete?
- Inductive inference with additional 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)
