This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Angluin, D., Types of queries for concept learning, Technical Report TR-479, Computer Science, Yale University, 1986.
Angluin, D., Finding patterns common to a set of strings, JCSS 21 (1980), 42–62.
Angluin, D., Inductive inference of formal languages from positive data, Information and Control 45 (1980), 117–135.
Angluin, D., Inference of reversible languages, JACM 29 (1982), 741–765.
Blum, M., and Blum, L., Toward a mathematical theory of inductive ingerence, Information and Control 28 (1975), 125–155.
Daley, R., Smith, C., On the complexity of inductive inference, Information and Control 69 (1986), 12–40.
DeJong, K., A genetic-based global function optimization technique, Technical Report 80-2, Computer Science, University of Pittsburgh, 1980.
Feldman, J., Some decidability results on grammatical inference and complexity, Information and Control 20 (1972), 244–262.
Fulk, M., A study of inductive inference machines, Technical Report 85-10, Computer Science, SUNY Buffalo, 1985.
Gold, M., Language identification in the limit, Information and Control 10 (1967), 447–474.
Holland, J., Adaptation in Natural and Artificial Systems, University of Michigan Press, 1975.
Kelly, K., The automated discovery of universe theories, Ph.D. Dissertation, History and Philosophy of Science, University of Pittsburgh, 1986.
Lindsay, R., et al, Dendral, McGraw-Hill, 1980.
Minicozzi, E., Some natural properties of strong identification in inductive inference, Theoretical Computer Science 2 (1976), 345–360.
Pitt, L., Probabilistic inductive inference, Technical Report TR-400, Computer Science, Yale University, 1985.
Pitt, L., and Valiant, L., Computational limitations on learning from examples, Technical Report TR-05-86, Center for Research in Computer Technology, Harvard University, 1986.
Popper, K., The Logic of Discovery, London, 1959.
Royer, J., On machine inductive inference of approximations, Technical Report 85-005, Computer Science, University of Chicago, 1985.
Shafer-Richter, G., Some results in the theory of effective program synthesis: learning by defective information, LNCS 215 (1986), 219–225.
Shafer-Richter, G., Uber eingabeabhangigkeit und komplexitat von inferenzstrategien, Ph.D. Dissertation, Mathematics, Technische Hochschule, Aachen, 1984.
Shapiro, E., The model inference system, Proceedings of the 7th IJCAI, 1981.
Shapiro, E., Algorithmic program debugging, MIT Press, 1983.
Shinohara, T., Some problems on inductive inference from positive data, LNCS 215 (1986), 41–58.
Smith, C., and Velauthpillai, M., On the inference of approximate programs, Technical Report TR-1427, Computer Science, University of Maryland, 1985.
Valiant, L., A theory of the learnable, CACM 27 (1984), 1134–1142.
Wiehagen, R., Limes-erkennung rekursiver funktionen durch spezielle strategien, EIK 12 (1976), 93–99.
Wiehagen, R. and Liepe, W., Charakterische eigenshaften von erkennbaren klassen rekursiver funktionen, EIK 12 (1976), 421–438.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Daley, R.P. (1987). Towards the development of an analysis of learning algorithms. 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_81
Download citation
DOI: https://doi.org/10.1007/3-540-18081-8_81
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