This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Literature
Rogers, H., Jr., Gödel numberings of partial recursive functions. Journal of Symbolic Logic, 23(1958), 331–341.
Gold,E.M., Language identification in the limit. Information and Control, 10 (1967), Nr. 3.
Barzdin, J.M. and Freivald, R.V., On the prediction of general recursive functions. Doklady Akademii Nauk SSSR, 206 (1972) 521–524 = Soviet Mathematics. Doklady, 13(1972), 1224–1228.
Barzdin,J.M. and Podnieks,K.M. Towards a theory of inductive inference (in Russian). In Mathematical Foundations of Computer Science, pp.9–15, High Tatras, 1973.
Kinber, E.B., On the synthesis in the limit of almost minimal Gödel numbers (in Russian). In Theory of Algorithms and Programs 1 (J.M. Barzdin,Ed.),pp.221–223,Latvian State University, Riga, 1974.
Rogers, H. Jr., Theory of recursive functions and effective computability, McGraw-Hill, New York et al, 1967.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Freivald, R.V. (1975). Minimal Gödel numbers and their identification in the limit. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975. MFCS 1975. Lecture Notes in Computer Science, vol 32. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07389-2_199
Download citation
DOI: https://doi.org/10.1007/3-540-07389-2_199
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07389-5
Online ISBN: 978-3-540-37585-2
eBook Packages: Springer Book Archive