On learning of functions refutably.
From MaRDI portal
Publication:1874231
DOI10.1016/S0304-3975(02)00421-8zbMath1038.68096OpenAlexW2144694779MaRDI QIDQ1874231
Rolf Wiehagen, Sanjay Jain, Thomas Zeugmann, E. B. Kinber
Publication date: 22 May 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00421-8
Related Items (4)
Refuting learning revisited. ⋮ Trees and learning ⋮ Reflective inductive inference of recursive functions ⋮ On the interplay between inductive inference of recursive functions, complexity theory and recursive numberings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Comparison of identification criteria for machine inductive inference
- Towards a mathematical theory of machine discovery from facts
- One-sided error probabilistic inductive inference and reliable frequency identification
- Research in the theory of inductive inference by GDR mathematicians - A survey
- Some natural properties of strong-identification in inductive inference
- Learning with refutation
- On one-sided versus two-sided classification
- On the intrinsic complexity of learning
- On completely recursively enumerable classes and their key arrays
- Reflecting inductive inference machines and its improvement by therapy
- Periodicity in generations of automata
- Toward a mathematical theory of inductive inference
- Classifying Predicates and Languages
- Inductive inference of recursive functions: Qualitative theory
- Inductive inference of recursive functions: Complexity bounds
- Generalization versus classification
- On the classification of computable languages
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Limiting recursion
- Language identification in the limit
This page was built for publication: On learning of functions refutably.
