Learning all subfunctions of a function
From MaRDI portal
Publication:596299
DOI10.1016/J.IC.2004.03.003zbMath1069.68056OpenAlexW2098087623MaRDI QIDQ596299
Rolf Wiehagen, Sanjay Jain, E. B. Kinber
Publication date: 10 August 2004
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2004.03.003
Related Items (1)
Cites Work
- Comparison of identification criteria for machine inductive inference
- Prudence and other conditions on formal language learning
- Robust learning aided by context
- Avoiding coding tricks by hyperrobust learning
- Robust learning -- rich and poor
- Robust separations in inductive inference
- Inductive inference of formal languages from positive data
- Toward a mathematical theory of inductive inference
- Inductive inference of recursive functions: Complexity bounds
- On the role of search for learning from examples
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Language identification in the limit
- Robust learning is rich
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Learning all subfunctions of a function