Journal of Symbolic Logic 59 (2):486-500 (1994)
A generator program for a computable function (by definition) generates an infinite sequence of programs all but finitely many of which compute that function. Machine learning of generator programs for computable functions is studied. To motivate these studies partially, it is shown that, in some cases, interesting global properties for computable functions can be proved from suitable generator programs which cannot be proved from any ordinary programs for them. The power (for variants of various learning criteria from the literature) of learning generator programs is compared with the power of learning ordinary programs. The learning power in these cases is also compared to that of learning limiting programs, i.e., programs allowed finitely many mind changes about their correct outputs
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Service-Learning and Engineering Ethics.Michael S. Pritchard - 2000 - Science and Engineering Ethics 6 (3):413-422.
Against Professional Development.Erica McWilliam - 2002 - Educational Philosophy and Theory 34 (3):289-299.
Ethics Programs and Their Dimensions.Steven N. Brenner - 1992 - Journal of Business Ethics 11 (5-6):391-399.
The Structure of Intrinsic Complexity of Learning.Sanjay Jain & Arun Sharma - 1997 - Journal of Symbolic Logic 62 (4):1187-1201.
International Service Learning Programs: Ethical Issues and Recommendations.Rebecca A. Reisch - 2011 - Developing World Bioethics 11 (2):93-98.
Added to index2009-01-28
Total downloads6 ( #542,263 of 2,143,766 )
Recent downloads (6 months)1 ( #386,855 of 2,143,766 )
How can I increase my downloads?
There are no threads in this forum
Nothing in this forum yet.