Toward a mathematical theory of inductive inference

DOI10.1016/S0019-9958(75)90261-2zbMATH Open0375.02028WikidataQ56224664 ScholiaQ56224664MaRDI QIDQ4154852FDOQ4154852

Publication date: 1975

Published in: Information and Control (Search for Journal in Brave)

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)

Automatic learning of subclasses of pattern languages
Equivalences between learning of data and probability distributions, and their applications
Learning languages from positive data and a limited number of short counterexamples
Learning languages from positive data and a finite number of queries
Numberings optimal for learning
The complexity of finding SUBSEQ\((A)\)
The synthesis of language learners.
Variations on U-shaped learning
On some open problems in reflective inductive inference
Recursion theoretic models of learning: Some results and intuitions
Title not available (Why is that?)
Incremental learning with temporary memory
Iterative learning of simple external contextual languages
Learning in the limit with lattice-structured hypothesis spaces
Increasing the power of uniform inductive learners
Parsimony hierarchies for inductive inference
On some open problems in monotonic and conservative learning
Learning algebraic structures from text
An approach to intrinsic complexity of uniform learning
Index sets in the arithmetical hierarchy
Synthesizing inductive expertise
Input-dependence in function-learning
Minimal concept identification and reliability
A note on batch and incremental learnability
From learning in the limit to stochastic finite learning
Consistent and coherent learning with \(\delta \)-delay
Learning by switching type of information.
Probability and plurality for aggregations of learning machines
Memory limited inductive inference machines
Learning in Friedberg Numberings
Synthesizing noise-tolerant language learners
Synthesizing learners tolerating computable noisy data
Some classes of term rewriting systems inferable from positive data
Generality's price: Inescapable deficiencies in machine-learned programs
A model for science kinematics
Saving the phenomena: Requirements that inductive inference machines not contradict known data
On the relative sizes of learnable sets
Mapping monotonic restrictions in inductive inference
Taming teams with mind changes
Note on a central lemma for learning theory
Noisy inference and oracles
Probabilistic language learning under monotonicity constraints
Separation of uniform learning classes.
Learning languages and functions by erasing
Some classes of Prolog programs inferable from positive data
Language learning from texts: Degrees of intrinsic complexity and their characterizations
On the inference of approximate programs
One-sided error probabilistic inductive inference and reliable frequency identification
Trade-off among parameters affecting inductive inference
The gap between abstract and concrete results in machine learning
Learning classes of approximations to non-recursive functions.
Learning by the process of elimination
Robust behaviorally correct learning.
On learning of functions refutably.
Learning languages with decidable hypotheses
Automatic learners with feedback queries
Iterative Learning of Simple External Contextual Languages
Inferring answers to queries
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
On the non-existence of maximal inference degrees for language identification
Unprincipled
Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions
The complexity of universal text-learners.
Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian
The functions of finite support: a canonical learning problem
Maps of restrictions for behaviourally correct learning
On the interplay between inductive inference of recursive functions, complexity theory and recursive numberings
Normal forms for semantically witness-based learners in inductive inference
Kolmogorov numberings and minimal identification
Noisy inference and oracles
Costs of general purpose learning
On the inference of optimal descriptions
On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms
Reflecting and self-confident inductive inference machines
Learning power and language expressiveness.
Model discrimination using an algorithmic information criterion
Logic and learning
Learning languages in the limit from positive information with finitely many memory changes
Aggregating inductive expertise on partial recursive functions
Trees and learning
On the power of recursive optimizers
Paradigms of truth detection
Truth-tracking by belief revision
Learnability and positive equivalence relations
Counting extensional differences in BC-learning
A theory of formal synthesis via inductive learning
Learning how to separate.
Gold-style learning theory. A selection of highlights since Gold
Efficiency in the identification in the limit learning paradigm
Measure, category and learning theory
PROBLEMS WITH COMPLEXITY IN GOLD'S PARADIGM OF INDUCTION Part I: Dynamic Complexity
PROBLEMS WITH COMPLEXITY IN GOLD'S PARADIGM OF INDUCTION Part II: Static Complexity
Learning theory and epistemology
Learning correction grammars
A solution to Wiehagen's thesis
Learning finite variants of single languages from informant
Priced learning
Secretive interaction. Players and strategies

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)