Inductive Inference and Computable One‐One Numberings
From MaRDI portal
Publication:3328535
DOI10.1002/malq.19820282708zbMath0541.03025MaRDI 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
03D45: Theory of numerations, effectively presented structures
Related Items
Control structures in hypothesis spaces: The influence on learning, Hypothesis spaces for learning, Characterizing programming systems allowing program self-reference, On the power of probabilistic strategies in inductive inference, Learning in Friedberg numberings, Numberings optimal for learning, On the power of inductive inference from good examples, Discrete families of recursive functions and index sets, A solution to Wiehagen's thesis, Some independence results for control structures in complete numberings, Learning in Friedberg Numberings, Numberings Optimal for Learning, Hypothesis Spaces for Learning