Toward a mathematical theory of inductive inference

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)

Inductive inference in the limit of empirically adequate theories
Learning and classifying
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
Unprincipled
Automatic learning of subclasses of pattern languages
Set-driven and rearrangement-independent learning of recursive languages
On the role of update constraints and text-types in iterative learning
The functions of finite support: a canonical learning problem
Incremental Learning with Ordinal Bounded Example Memory
Maps of restrictions for behaviourally correct learning
Kolmogorov numberings and minimal identification
On the interplay between inductive inference of recursive functions, complexity theory and recursive numberings
Normal forms for semantically witness-based learners in inductive inference
On the inference of optimal descriptions
Learning in the presence of partial explanations
Noisy inference and oracles
On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms
Equivalences between learning of data and probability distributions, and their applications
Costs of general purpose learning
Investigations on measure-one identification of classes of languages
Learning efficient logic programs
Learning languages from positive data and a limited number of short counterexamples
Numberings optimal for learning
Learning languages from positive data and a finite number of queries
Absolute versus probabilistic classification in a logical setting
Characterizing language identification by standardizing operations
The complexity of finding SUBSEQ(A)
Model discrimination using an algorithmic information criterion
Learning power and language expressiveness.
Reflecting and self-confident inductive inference machines
Machine learning of higher-order programs
Aggregating inductive expertise on partial recursive functions
Iterative learning from texts and counterexamples using additional information
The synthesis of language learners.
Learning languages in the limit from positive information with finitely many memory changes
On some open problems in reflective inductive inference
Logic and learning
Variations on U-shaped learning
Recursion theoretic models of learning: Some results and intuitions
Hypothesis spaces for learning
Trees and learning
Prudence and other conditions on formal language learning
Learning indexed families of recursive languages from positive data: A survey
On the power of recursive optimizers
Paradigms of truth detection
scientific article; zbMATH DE number 3503215 (Why is no real title available?)
Monotonic and dual monotonic language learning
Incremental learning of approximations from positive data
Truth-tracking by belief revision
Incremental learning with temporary memory
Iterative learning of simple external contextual languages
Learnability and positive equivalence relations
Learning in the limit with lattice-structured hypothesis spaces
Computability-theoretic learning complexity
Counting extensional differences in BC-learning
Towards a new theory of confirmation
A theory of formal synthesis via inductive learning
Some natural properties of strong-identification in inductive inference
Learning how to separate.
On the learnability of recursively enumerable languages from good examples
Learning in Friedberg numberings
Control structures in hypothesis spaces: The influence on learning
Learning languages from positive data and negative counterexamples
On some open problems in monotonic and conservative learning
Increasing the power of uniform inductive learners
On the classification of computable languages
Prescribed learning of r.e. classes
Gold-style learning theory. A selection of highlights since Gold
Efficiency in the identification in the limit learning paradigm
An approach to intrinsic complexity of uniform learning
Parsimony hierarchies for inductive inference
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 algebraic structures from text
Index sets in the arithmetical hierarchy
Infinitary self-reference in learning theory
Dynamically Delayed Postdictive Completeness and Consistency in Learning
Learning with ordinal-bounded memory from positive data
Learning theory and epistemology
`Ideal learning' of natural language: positive results about learning from positive evidence
Synthesizing inductive expertise
Input-dependence in function-learning
Learning all subfunctions of a function
Classes with easily learnable subclasses
Learning correction grammars
A note on batch and incremental learnability
From learning in the limit to stochastic finite learning
On the power of incremental learning.
Minimal concept identification and reliability
Consistent and coherent learning with \(\delta \)-delay
Learning by switching type of information.
A solution to Wiehagen's thesis
Learning finite variants of single languages from informant
Priced learning
Research in the theory of inductive inference by GDR mathematicians - A survey
Robust learning is rich
Probability and plurality for aggregations of learning machines

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)