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., On the complexity of minimum inference of regular sets, Information and Control 39 (1978), 337–350.
Angluin, D. and Smith, C., Inductive inference: theory and methods, Computing Surveys, to appear.
Barzdin, J., Two theorems on the limiting synthesis of functions, Theory of Algorithms and Programs I, Latvian State University, Riga, U.S.S.R. (1974), 82–88.
Barzdin, J. and FreIvald, R., On the prediction of general recursive functions, Soviet Math. Doklady 13 (1972), 1224–1228.
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, Journal Assoc. Comput. Mach. 14 (1967), 322–326.
Case, J. and Ngo-Manguelle, S., Refinements of inductive inference by Popperian machines, Technical Report, SUNY Buffalo, Department of Computer Science (1979).
Case, J. and Smith, C., Comparison of identification criteria fon machine inductive inference, Theoretical Computer Science 25 (1983), 193–220.
Freivald, R., On the complexity and optimality of computation in the limit, Theory of Algorithms and Programs II. Lativan State University, Riga, U.S.S.R. (1975), 155–173.
Gold, E., Language identification in the limit, Information and Control 10 (1967), 447–474.
Gold, E., Complexity of automaton identification from given data, Information and Control 37 (1978), 302–320.
Hempel, C., Aspects of Scientific Explanation, The Free Press (1965), New York.
Khodzhayev, J., On the complexity of computation on Turing machines with oracles, Ph.D. Dissertation, Tashkent (1970).
Kinber, E., On speeding up the limiting identification of recursive functions by changing the sequence of questions, Elektronische Informationsverarbeitung und Kybernetik 13 (1977), 369–383.
Klette, R. and Wiehagen, R., Research in the theory of inductive inference by GDR mathematicians — a survey, Information Sciences 22 (1980), 149–169.
Machtey, M. and Young, P., An Introduction to the General Theory of Algorithms, North-Holland (1978), New York.
Pudlak, P., Polynomially complete problems in the logic of automated discovery, Lecture Notes in Computer Science 32 (1975), 358–361.
Pudlak, P. and Springsteel, F., Complexity in mechanized hypothesis formation, Theorectical Computer Science 8 (1979), 203–225.
Putnam, H., Probability and confirmation, Mathematics, Matter, and Method, Cambridge University Press (1975). Originally appeared in 1963 as a Voice of America Lecture.
Rogers, H., Gödel numberings of partial recursive functions, Journal of Symbolic Logic 23 (1958), 331–341.
Rogers, H., Theory of Recursive Functions and Effective Computability, McGraw Hill (1967), New York.
Selman, A., Polynomial time enumeiation reducibility, SIAM Journal on Computing 7 (1978), 440–457.
Young, P., Speed-ups by changing the order in which sets are enumerated, Math. Systems Theory 5 (1971), 148–152.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Daley, R.P., Smith, C.H. (1984). On the complexity of inductive inference. In: Chytil, M.P., Koubek, V. (eds) Mathematical Foundations of Computer Science 1984. MFCS 1984. Lecture Notes in Computer Science, vol 176. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030306
Download citation
DOI: https://doi.org/10.1007/BFb0030306
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13372-8
Online ISBN: 978-3-540-38929-3
eBook Packages: Springer Book Archive