Program size restrictions in computational learning

Sanjay Jain, Arun Sharma
1994 Theoretical Computer Science  
Jam, S. and A. Sharma, Program size restrictions in computational learning, Theoretical Computer Science 127 (1994) 351-386. A model for a subject S learning its environment E could be described thus: S, placed in E, receives data about E, and simultaneously conjectures a sequence of hypotheses. S is said to learn E just in case the sequence of hypotheses conjectured by S stabilizes to a final hypothesis which correctly represents E. Computational learning theory provides a framework for
more » ... g problems of this nature when the subject is a machine. A natural abstraction for the notion of hypothesis is a computer program. The present paper, in the above framework of learning, presents arguments for the final hypothesis to be succinct, and introduces a plethora of formulations of such succinctness. A revelation of this study is that some of the "natural" notions of succinctness may be uninteresting because learning capability of machines under these seemingly natural constraints is dependent on the choice of programming system used to interpret hypotheses. Singapore. Email addresses of the authors: and 0304-3975/94/SO7.00 0 1993-Elsevier Science B.V. All rights reserved SSDI 0304-3975(93)E0088-L 3 These motivations for succinctness in language learning are based on discussions with John Case. Program size restrictions in computational learning 355
doi:10.1016/0304-3975(94)90047-7 fatcat:gkwmnsnixrfk3eb2jqu6f3fkuq