Robust learning with infinite additional information
From MaRDI portal
Publication:5941287
DOI10.1016/S0304-3975(00)00023-2zbMath0972.68095MaRDI QIDQ5941287
Frank Stephan, Susanne Kaufmann
Publication date: 20 August 2001
Published in: Theoretical Computer Science (Search for Journal in Brave)
inductive inference; learning of recursive functions; robust access to oracles; transactions between learning models
68Q32: Computational learning theory
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Monotonic and non-monotonic inductive inference
- One-sided error probabilistic inductive inference and reliable frequency identification
- On the structure of degrees of inferability.
- Learning regular sets from queries and counterexamples
- Synthesizing inductive expertise
- On the relative sizes of learnable sets
- Learning in the presence of partial explanations
- Learning with the knowledge of an upper bound on program size
- Some natural properties of strong-identification in inductive inference
- Classical recursion theory. Vol. II
- Extremes in the degrees of inferability
- Learning recursive functions from approximations
- On one-sided versus two-sided classification
- Trees and learning
- Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
- Inductive inference of formal languages from positive data
- Inductive inference and unsolvability
- ON LEARNING LIMITING PROGRAMS
- Toward a mathematical theory of inductive inference
- Classifying Predicates and Languages
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Classes of Recursively Enumerable Sets and Degrees of Unsolvability
- Degrees in Which the Recursive Sets are Uniformly Recursive
- Language identification in the limit
