Inductive Inference and Computable One‐One Numberings

DOI10.1002/MALQ.19820282708MaRDI QIDQ3328535zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

inductive inferenceuniform reducibilityone-one numberings

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

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
• Learning in Friedberg numberings
• Control structures in hypothesis spaces: The influence on learning
• 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)