Toward a mathematical theory of inductive inference

Automata and formal grammars in connection with logical questions (03D05) Turing machines and related notions (03D10) Recursive functions and relations, subrecursive hierarchies (03D20) Applications of computability and recursion theory (03D80) Computability and recursion theory (03D99) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cited in

(only showing first 100 items - show all)

Toward the interpretation of non-constructive reasoning as non-monotonic learning
Prescribed learning of r.e. classes
Incremental learning of approximations from positive data
Towards a new theory of confirmation
Probability and plurality for aggregations of learning machines
Index sets in the arithmetical hierarchy
Synthesizing inductive expertise
On the power of recursive optimizers
Saving the phenomena: Requirements that inductive inference machines not contradict known data
Paradigms of truth detection
On the relative sizes of learnable sets
Research in the theory of inductive inference by GDR mathematicians - A survey
Two notions of correctness and their relation to testing
Learning in the presence of partial explanations
Aggregating inductive expertise on partial recursive functions
On the power of inductive inference from good examples
Some natural properties of strong-identification in inductive inference
On the inference of optimal descriptions
Model discrimination using an algorithmic information criterion
Investigations on measure-one identification of classes of languages
A note on batch and incremental learnability
Approximation methods in inductive inference
Maximal machine learnable classes
Inductive inference in the limit for first-order sentences
A model for science kinematics
Extremes in the degrees of inferability
Characterizing language identification by standardizing operations
On the danger of half-truths
Learning in the presence of inaccurate information
Kolmogorov numberings and minimal identification
Probabilistic language learning under monotonicity constraints
Noisy inference and oracles
Learning how to separate.
Separation of uniform learning classes.
Learning by switching type of information.
Robust learning aided by context
Learning languages and functions by erasing
Some classes of Prolog programs inferable from positive data
Structural measures for games and process control in the branch learning model
Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian
Avoiding coding tricks by hyperrobust learning
Language learning from texts: Degrees of intrinsic complexity and their characterizations
Learning pattern languages over groups
A theory of formal synthesis via inductive learning
Learnability of automatic classes
Increasing the power of uniform inductive learners
Equivalences between learning of data and probability distributions, and their applications
Trade-off among parameters affecting inductive inference
On the power of incremental learning.
Learning classes of approximations to non-recursive functions.
The synthesis of language learners.
Incremental concept learning for bounded data mining.
Robust behaviorally correct learning.
The complexity of universal text-learners.
Learning by the process of elimination
On learning of functions refutably.
Learning power and language expressiveness.
Trees and learning
Robust learning -- rich and poor
Generalized notions of mind change complexity
Counting extensional differences in BC-learning
Inductive inference in the limit of empirically adequate theories
Recursion theoretic models of learning: Some results and intuitions
Learning secrets interactively. Dynamic modeling in inductive inference
Learning figures with the Hausdorff metric by fractals -- towards computable binary classification
Truth-tracking by belief revision
Automatic learning from positive data and negative counterexamples
Maps of restrictions for behaviourally correct learning
On the interplay between inductive inference of recursive functions, complexity theory and recursive numberings
Learning languages with decidable hypotheses
Mapping monotonic restrictions in inductive inference
Normal forms for semantically witness-based learners in inductive inference
Towards a map for incremental learning in the limit from positive and negative information
Learning languages in the limit from positive information with finitely many memory changes
Absolutely no free lunches!
Learning families of algebraic structures from informant
Learnability and positive equivalence relations
A solution to Wiehagen's thesis
Generality's price: Inescapable deficiencies in machine-learned programs
`Ideal learning' of natural language: positive results about learning from positive evidence
Learning efficient logic programs
Inductive inference and computable numberings
Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions
Iterative learning from positive data and negative counterexamples
Learning languages from positive data and a limited number of short counterexamples
Learning languages from positive data and a finite number of queries
Variations on U-shaped learning
On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms
Inductive inference of approximations for recursive concepts
Relations between Gold-style learning and query learning
On the role of update constraints and text-types in iterative learning
Automatic learners with feedback queries
Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism
Learning theory in the arithmetic hierarchy. II.
Learning finite variants of single languages from informant
Priced learning
Computability-theoretic learning complexity
Gold-style learning theory. A selection of highlights since Gold
Efficiency in the identification in the limit learning paradigm
Learning Tree Languages

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)