Learning with the knowledge of an upper bound on program size
From MaRDI portal
Publication:1207954
DOI10.1006/inco.1993.1005zbMath0769.68109MaRDI QIDQ1207954
Publication date: 16 May 1993
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1993.1005
inductive hypothesis formation; knowledge about an upper bound on the minimal size program; machine identification of grammars from texts of recursively enumerable languages; machine identification of programs from graphs of recursive functions; upper bound information
68T05: Learning and adaptive systems in artificial intelligence
Related Items
Robust learning with infinite additional information, Hypothesis spaces for learning, Characterizing language identification in terms of computable numberings, Learning recursive functions: A survey, Numberings optimal for learning, Characterizing language identification by standardizing operations, Robust learning aided by context, Inductive inference with additional information., The complexity of universal text-learners., Learning to win process-control games watching game-masters, Numberings Optimal for Learning, Hypothesis Spaces for Learning