Minimal Gödel numbers and their identification in the limit-Reference-Cited by-同舟云学术

Minimal Gödel numbers and their identification in the limit

Published:1975 Issue: Volume: Page:219-225
ISSN:0302-9743
Container-title:Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975
language:
Short-container-title:

Author:

Freivald R. V.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-07389-2_199.pdf

Reference6 articles.

1. Rogers, H., Jr., Gödel numberings of partial recursive functions. Journal of Symbolic Logic, 23(1958), 331–341.

2. Gold,E.M., Language identification in the limit. Information and Control, 10 (1967), Nr. 3.

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.

4. 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.

5. 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.

Cited by 23 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Connections Between Inductive Inference and Machine Learning;Encyclopedia of Machine Learning and Data Mining;2017

2. Complexity of Inductive Inference;Encyclopedia of Machine Learning and Data Mining;2017

3. Connections Between Inductive Inference and Machine Learning;Encyclopedia of Machine Learning and Data Mining;2016

4. Complexity of Inductive Inference;Encyclopedia of Machine Learning and Data Mining;2016

5. On the Amount of Nonconstructivity in Learning Recursive Functions;Lecture Notes in Computer Science;2011