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)

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
A map of update constraints in inductive inference
Parallel learning of automatic classes of languages
Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism
Unscrambling the quantum omelette
Automatic Learners with Feedback Queries
Ignoring data may be the only way to learn efficiently
Optimal language learning from positive data
Robust learning aided by context
Reflective inductive inference of recursive functions
Avoiding coding tricks by hyperrobust learning
On the power of probabilistic strategies in inductive inference
Title not available (Why is that?)
Training sequences
Iterative learning from positive data and negative counterexamples
Enlarging learnable classes
Strongly non-U-shaped language learning results by general techniques
Robust learning -- rich and poor
Dynamic Modeling in Inductive Inference
Comparison of identification criteria for machine inductive inference
On the classification of recursive languages
Characterization of language learning front informant under various monotonicity constraints
Towards a map for incremental learning in the limit from positive and negative information
Polynomial-time inference of arbitrary pattern languages
Closedness properties in ex-identification
Toward the interpretation of non-constructive reasoning as non-monotonic learning
Topological separations in inductive inference
Learning recursive functions: A survey
Non-U-shaped vacillatory and team learning
Difficulties in Forcing Fairness of Polynomial Time Inductive Inference
Prudence in vacillatory language identification
Learnability of automatic classes
Numberings Optimal for Learning
Quantum inductive inference by finite automata
Maximal machine learnable classes
Extremes in the degrees of inferability
On an open problem in classification of languages
Learning and extending sublanguages
Generalization versus classification
Anomalous learning helps succinctness
Robust separations in inductive inference
Learning languages in a union
Learning in the presence of inaccurate information
Incremental concept learning for bounded data mining.
Generalized notions of mind change complexity
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

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)