Machine learning of higher-order programs

Journal of Symbolic Logic 59 (2):486-500 (1994)
  Copy   BIBTEX

Abstract

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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 74,649

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

The Structure of Intrinsic Complexity of Learning.Sanjay Jain & Arun Sharma - 1997 - Journal of Symbolic Logic 62 (4):1187-1201.
Ethics Programs and Their Dimensions.Steven N. Brenner - 1992 - Journal of Business Ethics 11 (5-6):391-399.
Programs and Logics.Anita Wasilewska - 1985 - Studia Logica 44 (2):125 - 137.
Against Professional Development.Erica McWilliam - 2002 - Educational Philosophy and Theory 34 (3):289-299.
Service-Learning and Engineering Ethics.Michael S. Pritchard - 2000 - Science and Engineering Ethics 6 (3):413-422.

Analytics

Added to PP
2009-01-28

Downloads
13 (#760,623)

6 months
2 (#279,211)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Introduction to Mathematical Logic.John Corcoran - 1964 - Journal of Symbolic Logic 54 (2):618-619.
An Introduction to the General Theory of Algorithms.Michael Machtey & Paul Young - 1981 - Journal of Symbolic Logic 46 (4):877-878.
Degrees of Unsolvability.Leonard P. Sasso - 1975 - Journal of Symbolic Logic 40 (3):452-453.

Add more references