Comparison of identification criteria for machine inductive inference
From MaRDI portal
Publication:585192
DOI10.1016/0304-3975(83)90061-0zbMATH Open0524.03025OpenAlexW2018722248MaRDI QIDQ585192FDOQ585192
Authors: Jianyong Qiao, Sumit K. Garg 
Publication date: 1983
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(83)90061-0
identificationinductive inferencephilosophy of scienceanomalies in programsinherent relative computational complexityrecursive function theorytradeoff results
Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Turing machines and related notions (03D10)
Cites Work
- Title not available (Why is that?)
- Some natural properties of strong-identification in inductive inference
- Title not available (Why is that?)
- Toward a mathematical theory of inductive inference
- Title not available (Why is that?)
- Language identification in the limit
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
- Classes of computable functions defined by bounds on computation
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Title not available (Why is that?)
- The Power of Pluralism for Automatic Program Synthesis
- Periodicity in generations of automata
- Title not available (Why is that?)
- Some decidability results on grammatical inference and complexity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Mechanism, mentalism, and metamathematics. An essay on finitism
- Research in the theory of inductive inference by GDR mathematicians - A survey
- Gödel numberings of partial recursive functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Anomaly hierarchies of mechanized inductive inference
- On the size of machines
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (only showing first 100 items - show all)
- On the interplay between inductive inference of recursive functions, complexity theory and recursive numberings
- Kolmogorov numberings and minimal identification
- Costs of general purpose learning
- Prediction of Recursive Real-Valued Functions from Finite Examples
- Learning languages from positive data and a limited number of short counterexamples
- Learning languages from positive data and a finite number of queries
- Aggregating inductive expertise on partial recursive functions
- Variations on U-shaped learning
- Intrinsic complexity of learning geometrical concepts from positive data
- Trees and learning
- Learning-theoretic perspectives of acceptable numberings
- On unstable and unoptimal prediction
- 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
- Learnability and positive equivalence relations
- Counting extensional differences in BC-learning
- Learning how to separate.
- Increasing the power of uniform inductive learners
- Gold-style learning theory. A selection of highlights since Gold
- Measure, category and learning theory
- Spatial/kinematic domain and lattice computers
- Effectivity questions for Kleene's recursion theorem
- Effectivity questions for Kleene's recursion theorem
- Learning theory and epistemology
- Learning correction grammars
- On the inductive inference of recursive real-valued functions
- Learning to act and observe in partially observable domains
- Secretive interaction. Players and strategies
- Invertible classes
- On the amount of nonconstructivity in learning recursive functions
- Memory limited inductive inference machines
- Learning pattern languages over groups
- Learning secrets interactively. Dynamic modeling in inductive inference
- Machine induction without revolutionary paradigm shifts
- Simulating teams with many conjectures
- Learning recursive functions from approximations
- The power of probabilism in Popperian FINite learning
- Learning families of algebraic structures from informant
- The logic of reliable and efficient inquiry
- Inductive inference of approximations for recursive concepts
- Approximation methods in inductive inference
- Synthesizing noise-tolerant language learners
- Synthesizing learners tolerating computable noisy data
- Partial learning of recursively enumerable languages
- Explanatory and creative alternatives to the MDL principle
- Random Subgroups of Rationals
- Learnability and positive equivalence relations
- Hypothesis Spaces for Learning
- On the danger of half-truths
- Is Gold-Putnam diagonalization complete?
- Combining models of approximation with partial learning
- Inductive inference with additional information.
- Hierarchies of probabilistic and team FIN-learning
- Vacillatory and BC learning on noisy data
- On the influence of technology on learning processes
- Taming teams with mind changes
- Learners based on transducers
- Mind change complexity of learning logic programs
- On aggregating teams of learning machines
- Structural measures for games and process control in the branch learning model
- Trade-off among parameters affecting 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.
- Absolutely no free lunches!
- Learning to win process-control games watching game-masters
- Learning and classifying
- Learning in the presence of partial explanations
- The complexity of finding SUBSEQ\((A)\)
- Machine learning of higher-order programs
- Automata techniques for query inference machines
- The synthesis of language learners.
- Recursion theoretic models of learning: Some results and intuitions
- Hypothesis spaces for learning
- Learning via queries in [+, <]
- Computability-theoretic learning complexity
- Learning pattern languages over groups
- On the learnability of recursively enumerable languages from good examples
- Parsimony hierarchies for inductive inference
- Learning languages from positive data and negative counterexamples
- Learning algebraic structures from text
- An approach to intrinsic complexity of uniform learning
- Infinitary self-reference in learning theory
- The independence of control structures in abstract programming systems
- Synthesizing inductive expertise
- Resource restricted computability theoretic learning: Illustrative topics and problems
- Learning all subfunctions of a function
- Classes with easily learnable subclasses
- A note on batch and incremental learnability
- Learning from Positive Data and Negative Counterexamples: A Survey
- On the intrinsic complexity of learning recursive functions
- Robust learning is rich
- Learning by switching type of information.
- Probability and plurality for aggregations of learning machines
- Confident and consistent partial learning of recursive functions
- On the power of inductive inference from good examples
- Learning via finitely many queries
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)
