A learning-theoretic characterization of classes of recursive functions
From MaRDI portal
Publication:673668
DOI10.1016/0020-0190(95)00036-CzbMath0875.68271MaRDI QIDQ673668
Publication date: 28 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Related Items (6)
On the intrinsic complexity of learning recursive functions ⋮ Inductive inference and computable numberings ⋮ Some independence results for control structures in complete numberings ⋮ Friedberg numberings in the Ershov hierarchy ⋮ Learning languages and functions by erasing ⋮ Learning by the process of elimination
Cites Work
- A connotational theory of program structure
- An enumeration of the primitive recursive functions without repetition
- Autostability of models and Abelian groups
- Enumerations of families of general recursive functions
- Computable enumerations of families of general recursive functions
- Discrete families of recursive functions and index sets
- The computable enumerations of families of general recursive functions
- On computable enumerations. I
- Theorie der Numerierungen I
- Language identification in the limit
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A learning-theoretic characterization of classes of recursive functions
