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.

	AS83	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]
	Blu67	Manuel Blum, A Machine-Independent Theory of the Complexity of Recursive Functions, Journal of the ACM (JACM), v.14 n.2, p.322-336, April 1967  [doi>10.1145/321386.321395]
	CS83	J. Case and C. H. Smith, Comparison of identification criteria for machine inductive inference. Theoretical Computer Science 25 (i983) 193-220.
	DS86	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]
	FBP91	Rusins Freivalds , Janis Barzdins , Karlis Podnieks, Inductive Inference of Recursive Functions: Complexity Bounds, Baltic Computer Science, Selected Papers, p.111-155, January 1991
	Fre91	Rusins Freivalds, Inductive Inference of Recursive Functions: Qualitative Theory, Baltic Computer Science, Selected Papers, p.77-110, January 1991
	FKS95	Rūsiņš Freivalds , Efim Kinber , Carl H. Smith, On the intrinsic complexity of learning, Information and Computation, v.123 n.1, p.64-71, Nov. 15, 1995  [doi>10.1006/inco.1995.1158 ]
	FS93	Rūsiņš Freivalds , Carl H. Smith, On the role of procrastination in machine learning, Information and Computation, v.107 n.2, p.237-271, Dec. 1993  [doi>10.1006/inco.1993.1068 ]
	FW79	R. Freivalds and R. Wiehagen, Inductive inferformation Processing and Cybernetics (ELK) 15 (1979) 179-185.
	GJ79	Michael R. Garey , David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman & Co., New York, NY, 1979
	Gol67	E.M. Gold, Language identification in the limit. Information and Control 10 (1967) 447-474.
	JB81	K.P. Jantke and H.-R. Beick, Combining postulates of naturalness in inductive inference. Journal of information Processing and Cybernetics (ELK) 17 (1981) 465-484.
	JS96	Sanjay Jain , Arun Sharma, The intrinsic complexity of language identification, Journal of Computer and System Sciences, v.52 n.3, p.393-402, June 1996  [doi>10.1006/jcss.1996.0030 ]
	JS97a	S. Jain and A. Sharma, The structure of intrinsic complexity of learning. Journal of Symbolic Logic 62 (1997) 1187-1201.
	JS97b	S. Jain and A. Sharma, Elementary formal systems, intrinsic complexity, and procrastination.
	Kle38	S. Kleene, On Notation for Ordinal Numbers. Journal of Symbolic Logic 3 (1938) 150--155.
	Kum95	Martin Kummer, A learning-theoretic characterization of classes of recursive functions, Information Processing Letters, v.54 n.4, p.205-211, May 26, 1995  [doi>10.1016/0020-0190(95)00036-C ]
	KW80	R. Klette and R. Wiehagen, Research in the thenrv nf inductive inference hv GDR mathematicians - a survey. Information Sciences 22 (1980) 149-169.
	MY78	Michael Machtey , Paul Young, An Introduction to the General Theory of Algorithms, Elsevier Science Inc., New York, NY, 1978
	Nes98	Jochen Nessel, Birds can fly…, Proceedings of the eleventh annual conference on Computational learning theory, p.56-63, July 24-26, 1998, Madison, Wisconsin, United States  [doi>10.1145/279943.279954]
	OSW86	D. Osherson, M. Stob, and S. Weinstein, Systems that Learn. MiT Press, Cambridge, 1986.
	PW90	Leonard Pitt , Manfred K. Warmuth, Prediction-preserving reducibility, Journal of Computer and System Sciences, v.41 n.3, p.430-467, Dec. 1990  [doi>10.1016/0022-0000(90)90028-J]
	Rog58	H. Rogers Jr., G6del numberings of partial recursive functions. Journal of Symbolic Logic 23 (1958) 331-341.
	Rog67	Hartley Rogers, Jr., Theory of recursive functions and effective computability, MIT Press, Cambridge, MA, 1987
	Smi94	Carl H. Smith, A recursive introduction to the theory of computation, Springer-Verlag New York, Inc., Secaucus, NJ, 1994

• Data structures for quadtree approximation and compression Communications of the ACM   28, 9
  Hanan Samet
  
  
• A hierarchical single-key-lock access control using the Chinese remainder theorem Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
  Kim S. Lee ,  Huizhu Lu ,  D. D. Fisher
  
  
• The GemStone object database management system Communications of the ACM   34, 10
  Paul Butterworth ,  Allen Otis ,  Jacob Stein
  
  
• Putting innovation to work: adoption strategies for multimedia communication systems Communications of the ACM   34, 12
  Ellen Francik ,  Susan Ehrlich Rudman ,  Donna Cooper ,  Stephen Levine
  
  
• An intelligent component database for behavioral synthesis Proceedings of the 27th ACM/IEEE conference on Design automation
  Gwo-Dong Chen ,  Daniel D. Gajski