Learning small programs with additional information

DOI10.1007/3-540-63045-7_11MaRDI QIDQ4376050zbMATH OpenFDO

Authors Gints Tervits, Rolf Wiehagen, Rūsiņš Freivalds, Carl H. Smith

Publication date 1 June 1998

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-63045-7_11

zbMATH Keywords

co-learningcomputational learning theoryconfidence-learningfinite identificationidentification in the limitinductive inference of programsrecursive functions

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Applications of computability and recursion theory (03D80) General topics in the theory of software (68N01) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Small programming exercises 19
• Small programming exercises 21
• Small programming exercises 11
• Small programming exercises 13
• Small programming exercises 22
• On a question about learning nearly minimal programs
• Small programming exercises 18
• Small programming exercises 14
• Small programming exercises 17

Cited in

(3)

• Learning with the knowledge of an upper bound on program size
• On learning and co-learning of minimal programs
• Some philosophical concerns about the confidence in `confident learning'

This page was built for publication: Learning small programs with additional information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4376050)