This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Angluin, D. and Smith, C. H. Inductive inference: theory and methods. Computing Surveys 15 (1983), 237–269.
Blum, L. and Blum, M. Toward a mathematical theory of inductive inference. Information and Control 28 (1975), 125–155.
Blum, M. A machine-independent theory of the complexity of recursive functions. JACM 14 (1967), 322–336.
Case, J. and Lynes, C. Machine inductive inference and language identification. In Automata Languages and Programming, 9th Colloquium, Lecture Notes in Computer Science, 140, Springer Verlag, Berlin, 1982.
Case, J. and Smith, C. Comparison of identification criteria for machine inductive inference. Theoretical Computer Science 25, 2 (1983), 193–220.
Chen, K. J.Tradeoffs in machine inductive inference. SUNY/Buffalo, N.Y., 1981. Ph.D. Dissertation.
Chen, K. J. Tradeoffs in the inductive inference of nearly minimal size programs. Information and Control 52, 1 (1982), 68–86.
Daley, R. On the error correcting power of pluralism in BC-type inductive inference. Theoretical Computer Science 24, 1 (1983), 95–104.
Daley, R. P. and Smith, C. H. On the complexity of inductive inference. Information and Control 69 (1986), 12–40.
Freivalds, R. V. Finite identification of general recursive functions by probabilistic strategies. In Fundamentals of Computation Theory, L. Budach, Ed., Akademie-Verlag, Berlin, 1979.
Freivalds, R. V. On the principle capabilities of probabilistic algorithms in inductive inference. Semiotika i informatika 12 (1979), 137–140. (in Russian).
Gold, E. M. Language identification in the limit. Information and Control 10 (1967), 447–474.
Machtey, M. and Young, P.An Introduction to the General Theory of Algorithms. North-Holland, New York, New York, 1978.
Osherson, D. N. and Weinstein, S. Criteria of language learning. Information and Control 52 (1982), 123–138.
Pitt, L. A Characterization of Probabilistic Inference. In In Proceedings of the 25th Annual Symposium on Foundations of Computer Science, Palm Beach, Florida, 1984.
Podnieks, K. M. Computational complexity of prediction strategies. In Theory Of Algorithms and Programs, Barzdin, Ed., Latvian State University, Riga, U.S.S.R., 1977. Russian.
Rogers, H. Jr.Theory of Recursive Functions and Effective Computability. McGraw Hill, New York, 1967.
Royer, J. S. On machine inductive inference of approximations. Information and Control (1986). to appear.
Smith, C. H. The power of pluralism for automatic program synthesis. Journal of the ACM 29, 4 (1982), 1144–1165.
Wiehagen, R. Limes-erkennung rekursiver funktionen durch spezielle strategien. Elektronische Informationsverarbeitung und Kybernetik 12 (1976), 93–99.
Wiehagen, R., Freivalds, R., and Kinber, E. K. On the power of probabilistic strategies in inductive inference. Theoretical Computer Science 28 (1984), 111–133.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Smith, C.H., Velauthapillai, M. (1987). On the inference of programs approximately computing the desired function. In: Jantke, K.P. (eds) Analogical and Inductive Inference. AII 1986. Lecture Notes in Computer Science, vol 265. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18081-8_92
Download citation
DOI: https://doi.org/10.1007/3-540-18081-8_92
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18081-4
Online ISBN: 978-3-540-47739-6
eBook Packages: Springer Book Archive