Anomaly hierarchies of mechanized inductive inference

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Anomaly hierarchies of mechanized inductive inference

Full text

Pdf (541 KB)

Source

Annual ACM Symposium on Theory of Computing archive
Proceedings of the tenth annual ACM symposium on Theory of computing table of contents

San Diego, California, United States

Pages: 314 - 319

Year of Publication: 1978

Authors

John Case
Carl Smith

Sponsors

ACM: Association for Computing Machinery
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 7, Citation Count: 5

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions 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/800133.804360 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	Barzdin, J., "Two theorems on the limiting synthesis of functions," Latvic. Gosudarst. Univ. ucenye Zapiski, 210 (1974), 82-88 (Russian).
	2	Blum, L. and Blum M., "Toward a mathematical theory of inductive inference," Information and Control, 28, (1975), 125-155.
	3	Case, J., "Periodicity in generations of automata," Mathematical Systems Theory, 8 (1974), 15-32.
	4	Chen, K.J., private communication.
	5	Feldman, J., "Some decidability results on grammatical inference and complexity," Information and Control, 20 (1972), 244-262.
	6	Gold, M., "Language Identification in the limit," Information and Comtrol, 10 (1967), 447-474.
	7	Harrington, L., private communication.
	8	Minicozzi, E., "Some natural properties of strong-identification in inductive inference," Theoretical Computer Science, 2 (1976), 345-360.
	9	Newton, I., Mathematical Principles of Natural Philosophy, translated by A. Motte, 1792, edited by F. Cajori, University of California Press, Berkeley, 1946.
	10	Popper, K., The Logic of Scientific Discovey (2nd edition), Harper Torch Books, N.Y., 1934.
	11	Hartley Rogers, Jr., Theory of recursive functions and effective computability, MIT Press, Cambridge, MA, 1987
	12	Carl Herbert Smith, Hierarchies of identification criteria for mechanized inductive inference., 1979
	13	Steel, J., private communication.
	14	van Leeuwen, J., private communication.

CITED BY 5

	Ganesh R. Baliga , John Case , Sanjay Jain, Synthesizing enumeration techniques for language learning, Proceedings of the ninth annual conference on Computational learning theory, p.169-180, June 28-July 01, 1996, Desenzano del Garda, Italy
	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
	Dana Angluin , Carl H. Smith, Inductive Inference: Theory and Methods, ACM Computing Surveys (CSUR), v.15 n.3, p.237-269, Sept. 1983
	Dana Angluin, Inference of Reversible Languages, Journal of the ACM (JACM), v.29 n.3, p.741-765, July 1982
	Kalvis Apsītis , Rūsiņš Freivalds , Carl H. Smith, Choosing a learning team: a topological approach, Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, p.283-289, May 23-25, 1994, Montreal, Quebec, Canada