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
MINIMAL CONCEPT IDENTIFICATION AND RELIABILITY
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
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
Learning and classifying
Set-driven and rearrangement-independent learning of recursive languages
Incremental Learning with Ordinal Bounded Example Memory
On the role of update constraints and text-types in iterative learning
Learning in the presence of partial explanations
Learning efficient logic programs
Investigations on measure-one identification of classes of languages
Characterizing language identification by standardizing operations
Absolute versus probabilistic classification in a logical setting
Machine learning of higher-order programs
Iterative learning from texts and counterexamples using additional information
Hypothesis spaces for learning
Prudence and other conditions on formal language learning
Learning indexed families of recursive languages from positive data: A survey
Monotonic and dual monotonic language learning
Incremental learning of approximations from positive data
Computability-theoretic learning complexity
On the learnability of recursively enumerable languages from good examples
Control structures in hypothesis spaces: The influence on learning
Towards a new theory of confirmation
On the classification of computable languages
Some natural properties of strong-identification in inductive inference
Learning in Friedberg numberings
Learning languages from positive data and negative counterexamples
Prescribed learning of r.e. classes
Infinitary self-reference in learning theory
Dynamically Delayed Postdictive Completeness and Consistency in Learning
`Ideal learning' of natural language: positive results about learning from positive evidence
Learning with ordinal-bounded memory from positive data
Learning all subfunctions of a function
Classes with easily learnable subclasses
On the power of incremental learning.
Robust learning is rich
Research in the theory of inductive inference by GDR mathematicians - A survey
Relations between Gold-style learning and query learning
Confident and consistent partial learning of recursive functions
On the power of inductive inference from good examples
Inductive inference and reverse mathematics

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)