A comparison of identification criteria for inductive inference of recursive real-valued functions
From MaRDI portal
Publication:5958650
DOI10.1016/S0304-3975(00)00275-9zbMath0992.68168MaRDI QIDQ5958650
Eiju Hirowatari, Setsuo Arikawa
Publication date: 3 March 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
Learning figures with the Hausdorff metric by fractals -- towards computable binary classification ⋮ Prediction of Recursive Real-Valued Functions from Finite Examples
Cites Work
- Decision theoretic generalizations of the PAC model for neural net and other learning applications
- Computable functionals
- On computable sequences
- On the definitions of computable real continuous functions
- Toward a mathematical theory of inductive inference
- Language identification in the limit
- On notation for ordinal numbers
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item