{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T15:23:11Z","timestamp":1725722591677},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540073895"},{"type":"electronic","value":"9783540375852"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1975]]},"DOI":"10.1007\/3-540-07389-2_199","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T10:54:49Z","timestamp":1330167289000},"page":"219-225","source":"Crossref","is-referenced-by-count":28,"title":["Minimal G\u00f6del numbers and their identification in the limit"],"prefix":"10.1007","author":[{"given":"R. V.","family":"Freivald","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,21]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","first-page":"331","DOI":"10.2307\/2964292","volume":"23","author":"H. Rogers Jr.","year":"1958","unstructured":"Rogers, H., Jr., G\u00f6del numberings of partial recursive functions. Journal of Symbolic Logic, 23(1958), 331\u2013341.","journal-title":"Journal of Symbolic Logic"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Gold,E.M., Language identification in the limit. Information and Control, 10 (1967), Nr. 3.","DOI":"10.1016\/S0019-9958(67)91165-5"},{"key":"22_CR3","first-page":"521","volume":"206","author":"J. M. Barzdin","year":"1972","unstructured":"Barzdin, J.M. and Freivald, R.V., On the prediction of general recursive functions. Doklady Akademii Nauk SSSR, 206 (1972) 521\u2013524 = Soviet Mathematics. Doklady, 13(1972), 1224\u20131228.","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"22_CR4","unstructured":"Barzdin,J.M. and Podnieks,K.M. Towards a theory of inductive inference (in Russian). In Mathematical Foundations of Computer Science, pp.9\u201315, High Tatras, 1973."},{"key":"22_CR5","first-page":"221","volume-title":"Theory of Algorithms and Programs 1","author":"E. B. Kinber","year":"1974","unstructured":"Kinber, E.B., On the synthesis in the limit of almost minimal G\u00f6del numbers (in Russian). In Theory of Algorithms and Programs 1 (J.M. Barzdin,Ed.),pp.221\u2013223,Latvian State University, Riga, 1974."},{"key":"22_CR6","volume-title":"Theory of recursive functions and effective computability","author":"H. Rogers Jr.","year":"1967","unstructured":"Rogers, H. Jr., Theory of recursive functions and effective computability, McGraw-Hill, New York et al, 1967."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1975 4th Symposium, Mari\u00e1nsk\u00e9 L\u00e1zn\u011b, September 1\u20135, 1975"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-07389-2_199.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T14:57:24Z","timestamp":1605625044000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-07389-2_199"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975]]},"ISBN":["9783540073895","9783540375852"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-07389-2_199","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1975]]}}}