Tradeoffs in the inductive inference of nearly minimal size programs
From MaRDI portal
Publication:3312211
DOI10.1016/S0019-9958(82)80086-7zbMath0531.03024MaRDI QIDQ3312211
Publication date: 1982
Published in: Information and Control (Search for Journal in Brave)
recursive function; inductive inference machines; mind change bounds; anomalies in synthesized programs; nearly minimal size programs
03A05: Philosophical and critical aspects of logic and foundations
03D20: Recursive functions and relations, subrecursive hierarchies
03D10: Turing machines and related notions
Related Items
Infinitary self-reference in learning theory, Parsimony hierarchies for inductive inference, Anomalous learning helps succinctness, On a question about learning nearly minimal programs, One-sided error probabilistic inductive inference and reliable frequency identification, On the inference of approximate programs, Learning recursive functions: A survey, On the power of recursive optimizers, Characterizing language identification by standardizing operations, Program size restrictions in computational learning, Kolmogorov numberings and minimal identification, On the Influence of Technology on Learning Processes, Learning correction grammars