On the role of procrastination for machine learning

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

On the role of procrastination for machine learning

Full text

Pdf (1.36 MB)

Source

Annual Workshop on Computational Learning Theory archive
Proceedings of the fifth annual workshop on Computational learning theory table of contents

Pittsburgh, Pennsylvania, United States

Pages: 363 - 376

Year of Publication: 1992

ISBN:0-89791-497-X

Authors

Rūsiņš Freivalds	Institute of Mathematics and Computer Science, University of Latvia, Raina bulvaris 29, 226250, Riga, Latvia
Carl H. Smith	Department of Computer Science and Institute for Advanced Computer Studies, The University of Maryland, College Park, MD

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 30, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/130385.130426 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Dana Angluin , Carl H. Smith, Inductive Inference: Theory and Methods, ACM Computing Surveys (CSUR), v.15 n.3, p.237-269, Sept. 1983 [doi>10.1145/356914.356918]
	2	BARZDINS, J. Two theorems on the limiting synthesis of functions. In Theory of Algorithms and Programs, Barzdins, Ed., 1, Latvian State University, Riga, U.S.S.R., 1974.
	3	BLUM, L. AND BLUM, M. Toward a mathematical theory of inductive inference. Information and Control 28 (1975), 125-155.
	4	CASE, J. AND NGOMANGUELLE, S. Refinements of inductive inference by popperian machines. Kybernetika (1977). to appear.
	5	CASE, J. AND SMITH, C. Comparison of identification criteria for machine inductive inference. TheoreticM Computer Science 25, 2 (1983), 193- 220.
	6	CHURCH, A. The constructive second number class. Bulliten of the AMS 44 (1938), 224-232.
	7	CHURCH, A. AND KLEENE, S. Formal definitions in the theory of ordinal numbers. Fundamenta Mathematicae 28 (1937), 11-21.
	8	DALEY, 1%. On the error correcting power of pluralism in BC-type inductive inference. Theoretical Computer Science 24, 1 (1983), 95-104.
	9	Robert P Daley , Carl H Smith, On the complexity of inductive inference, Information and Control, v.69 n.1-3, p.12-40, April/May/June 1986 [doi>10.1016/S0019-9958(86)80042-0]
	10	FREIVALDS, R. Inductive inference of recursive functions: qualitative theory. Manuscript.
	11	Rūsiņš Freivalds , C. H. Smith , M. Velauthapillai, Trade-off among parameters affecting inductive inference, Information and Computation, v.82 n.3, p.323-349, Sep. 1989 [doi>10.1016/0890-5401(89)90005-9]
	12	Rusins Freivalds , Juris Viksna, Inductive Inference up to Immune Sets, Proceedings of the International Workshop on Analogical and Inductive Inference, p.138-147, October 01-06, 1989
	13	FRSIVALDS, R. V. ANn KINBER, E. B. Identification in the limit of minimal GSdel numbers. In Theory Of Algorithms and Programs, Barzdins, Ed., Latvian State University, Riga, U.S.S.R., 1977. Russian.
	14	William I. Gasarch , Ramesh K. Sitaraman , Carl H. Smith , Mahendran Velauthapillai, Learning programs with an easy to calculate set of errors, Proceedings of the first annual workshop on Computational learning theory, p.242-250, August 03-05, 1988, MIT, Cambridge, Massachusetts, United States
	15	GOLD, E. M. Language identification in the limit. Information and Control 10 (1967), 447- 474.
	16	KINBER, E. On some problems of identification of functions. In Machine methods of regulating discovery, Riga Polytechnical Institute, 1981. (Russian).
	17	KINBER, E. AND FREIVALDS, R. A distinction criterion for types of limiting synthesis. In Proceedings USSIt National Conference on Synthesis, Testing, Verification and Debugging of Programs, University of Latvia, Riga, USSR, 1981. (Russian).
	18	KLEENE, S. On notation for ordinal numbers. Journal of Symbolic Logic 3 (1938), 150-155.
	19	Michael Machtey , Paul Young, An Introduction to the General Theory of Algorithms, Elsevier Science Inc., New York, NY, 1978
	20	MINICOZZI, E. Some natural properties of strongidentification in inductive inference. Theoretical Computer Science 2 (1976), 345-360.
	21	OSHERSON, D., STOB, M., AND WEINSTEIN, S. Systems that Learn. MIT Press, Cambridge, Mass., 1986.
	22	ROGERS, H. JR. GSdel numberings of partial recursive functions. Journal of Symbolic Logic 23 (1958), 331-341.
	23	Hartley Rogers, Jr., Theory of recursive functions and effective computability, MIT Press, Cambridge, MA, 1987
	24	James S Royer, Inductive inference of approximations, Information and Control, v.70 n.2-3, p.156-178, Aug/Sept. 1986 [doi>10.1016/S0019-9958(86)80002-X]
	25	Carl H. Smith, The Power of Pluralism for Automatic Program Synthesis, Journal of the ACM (JACM), v.29 n.4, p.1144-1165, Oct. 1982 [doi>10.1145/322344.322356]
	26	Carl H. Smith , Mahendran Velauthapillai, On the inference of approximate programs, Theoretical Computer Science, v.77 n.3, p.249-266, Dec. 15, 1990 [doi>10.1016/0304-3975(90)90170-M]