Tradeoffs in the inductive inference of nearly minimal size programs

DOI10.1016/S0019-9958(82)80086-7zbMath0531.03024MaRDI QIDQ3312211

Keh-Jiann Chen

Publication date: 1982

Published in: Information and Control (Search for Journal in Brave)

zbMATH Keywords

recursive functioninductive inference machinesmind change boundsanomalies in synthesized programsnearly minimal size programs

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Recursive functions and relations, subrecursive hierarchies (03D20) Turing machines and related notions (03D10)

Related Items (14)

Characterizing language identification by standardizing operations ⋮ Program size restrictions in computational learning ⋮ On the Influence of Technology on Learning Processes ⋮ Parsimony hierarchies for inductive inference ⋮ Infinitary self-reference in learning theory ⋮ On the power of recursive optimizers ⋮ Kolmogorov numberings and minimal identification ⋮ Machine induction without revolutionary paradigm shifts ⋮ Learning recursive functions: A survey ⋮ Anomalous learning helps succinctness ⋮ On a question about learning nearly minimal programs ⋮ Learning correction grammars ⋮ One-sided error probabilistic inductive inference and reliable frequency identification ⋮ On the inference of approximate programs

This page was built for publication: Tradeoffs in the inductive inference of nearly minimal size programs