Inductive Inference and Computable One‐One Numberings
From MaRDI portal
Publication:3328535
DOI10.1002/malq.19820282708zbMath0541.03025OpenAlexW1976876753MaRDI QIDQ3328535
Rolf Wiehagen, E. B. Kinber, Rūsiņš Freivalds
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
Related Items
A solution to Wiehagen's thesis ⋮ Learning in Friedberg Numberings ⋮ Numberings Optimal for Learning ⋮ Learning in Friedberg numberings ⋮ Some independence results for control structures in complete numberings ⋮ On the power of inductive inference from good examples ⋮ Numberings optimal for learning ⋮ Hypothesis spaces for learning ⋮ Control structures in hypothesis spaces: The influence on learning ⋮ Characterizing programming systems allowing program self-reference ⋮ Hypothesis Spaces for Learning ⋮ On the power of probabilistic strategies in inductive inference ⋮ Discrete families of recursive functions and index sets
This page was built for publication: Inductive Inference and Computable One‐One Numberings