Inductive Inference and Computable One‐One Numberings
From MaRDI portal
Publication:3328535
DOI10.1002/MALQ.19820282708zbMATH Open0541.03025OpenAlexW1976876753MaRDI QIDQ3328535FDOQ3328535
Authors: Rolf Wiehagen, Rūsiņš Freivalds, Efim Kinber 
Publication date: 1982
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.19820282708
Cited In (13)
- Numberings optimal for learning
- Characterizing programming systems allowing program self-reference
- Hypothesis spaces for learning
- Discrete families of recursive functions and index sets
- Control structures in hypothesis spaces: The influence on learning
- Learning in Friedberg numberings
- A solution to Wiehagen's thesis
- On the power of inductive inference from good examples
- On the power of probabilistic strategies in inductive inference
- Learning in Friedberg Numberings
- Hypothesis Spaces for Learning
- Some independence results for control structures in complete numberings
- Numberings Optimal for Learning
This page was built for publication: Inductive Inference and Computable One‐One Numberings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3328535)
