Learning with the knowledge of an upper bound on program size

DOI10.1006/INCO.1993.1005zbMath0769.68109OpenAlexW1970570926MaRDI QIDQ1207954

Arun Sharma, Sanjay Jain

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

zbMATH Keywords

inductive hypothesis formationknowledge about an upper bound on the minimal size programmachine identification of grammars from texts of recursively enumerable languagesmachine identification of programs from graphs of recursive functionsupper bound information

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (14)

Characterizing language identification by standardizing operations ⋮ The complexity of universal text-learners ⋮ On the Influence of Technology on Learning Processes ⋮ Numberings Optimal for Learning ⋮ Learning recursive functions: A survey ⋮ Characterizing language identification in terms of computable numberings ⋮ Numberings optimal for learning ⋮ Hypothesis spaces for learning ⋮ Robust learning with infinite additional information ⋮ Hypothesis Spaces for Learning ⋮ Robust learning aided by context ⋮ The complexity of universal text-learners. ⋮ Learning to win process-control games watching game-masters ⋮ Inductive inference with additional information.

This page was built for publication: Learning with the knowledge of an upper bound on program size