{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:21Z","timestamp":1725663261361},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540514985"},{"type":"electronic","value":"9783540481805"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51498-8_25","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:00:49Z","timestamp":1330203649000},"page":"257-266","source":"Crossref","is-referenced-by-count":0,"title":["Monte-Carlo inference and its relations to reliable frequency identification"],"prefix":"10.1007","author":[{"given":"Efim","family":"Kinber","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Zeugmann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1145\/356914.356918","volume":"15","author":"D. Angluin","year":"1989","unstructured":"ANGLUIN, D., AND SMITH, C. H. (1989), Inductive inference: theory and methods. Computing Surveys 15, 237\u2013269","journal-title":"Computing Surveys"},{"key":"25_CR2","unstructured":"ANGLUIN, D., AND SMITH, C. H. (1986), Formal inductive inference, in Encyclopedia of Artificial Intelligence, (S. Shapiro, Ed.), to app."},{"key":"25_CR3","unstructured":"BARZDIN, YA. M. (1974), Two theorems on the limiting synthesis of functions, in Theory of Algorithms and Programs I, (Ya. M. Barzdin, Ed.), pp. 82\u201388, Latvian State University."},{"key":"25_CR4","unstructured":"Theory of Algorithms and Programs I, II, III, (1974), (1975), (1977) (Ya. M. Barzdin, Ed.). Latvian State University."},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/S0019-9958(75)90261-2","volume":"28","author":"L. Blum","year":"1975","unstructured":"BLUM, L. AND BLUM, M. (1975), Toward a mathematical theory of inductive inference. Inform. and Control 28, 122\u2013155.","journal-title":"Inform. and Control"},{"key":"25_CR6","first-page":"198","volume":"25","author":"J. Case","year":"1989","unstructured":"CASE, J., AND SMITH, C. H. (1989), Comparison of identification criteria for machine inductive inference. Theo. Comp. Sci. 25, 198\u2013220","journal-title":"Theo. Comp. Sci."},{"key":"25_CR7","first-page":"1","volume":"265","author":"R. Daley","year":"1986","unstructured":"DALEY, R. (1986), Towards the development of an analysis of learning algorithms, in Proc. Internat. Workshop of Analogical and Inductive Inference, Wendisch-Rietz, 1986, (K.P. Jantke, Ed.), Lect. Notes Comp. Sci. 265, pp. 1\u201318.","journal-title":"Lect. Notes Comp. Sci."},{"key":"25_CR8","doi-asserted-by":"crossref","first-page":"28","DOI":"10.2307\/2270580","volume":"30","author":"E. M. Gold","year":"1965","unstructured":"GOLD, E. M. (1965), Limiting recursion. J. Symbolic Logic 30, 28\u201348.","journal-title":"J. Symbolic Logic"},{"key":"25_CR9","first-page":"91","volume":"21","author":"E. B. Kinber","year":"1985","unstructured":"KINBER, E. B., AND ZEUGMANN, T. (1985), Inductive inference of almost everywhere correct programs by reliably working strategies. J. Inf. Processing and Cybernetics (EIK) 21, 91\u2013100.","journal-title":"J. Inf. Processing and Cybernetics"},{"key":"25_CR10","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0020-0255(80)80006-5","volume":"22","author":"R. Klette","year":"1980","unstructured":"KLETTE; R., AND WIEHAGEN, R. (1980). Research in the theory of inductive inference by GDR mathematicians \u2014 a survey. Inf. Sci. 22, 149\u2013169.","journal-title":"Inf. Sci."},{"key":"25_CR11","volume-title":"An Introduction to the General Theory of Algorithms","author":"M. Machtey","year":"1978","unstructured":"MACHTEY, M., AND YOUNG, P. (1978) \"An Introduction to the General Theory of Algorithms\", North-Holland, New York"},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0304-3975(76)90087-6","volume":"2","author":"E. Minicozzi","year":"1976","unstructured":"MINICOZZI, E. (1976), Some natural properties of strong-identification in inductive inference. Theo. Comp. Sci. 2, 345\u2013360.","journal-title":"Theo. Comp. Sci."},{"key":"25_CR13","volume-title":"Systems that Learn","author":"D. Osherson","year":"1986","unstructured":"OSHERSON, D., STOB, M., AND WEINSTEIN, S. (1986), \"Systems that Learn\" MIT Press, Cambridge."},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"PITT, L. B. (1984), A characterization of probabilistic inference. In Proc. 25th Annual Symp. Foundations of Comp. Sci., pp. 485\u2013494.","DOI":"10.1109\/SFCS.1984.715951"},{"key":"25_CR15","unstructured":"PITT, L. B. (1985), Probabilistic inductive inference. Yale University, YALEU\/DCS\/TR-400, Ph.D. Thesis."},{"key":"25_CR16","unstructured":"PODNIEKS, K.M. (1974), Comparing various concepts of function prediction and program synthesis I, in Theory of Algorithms and Programs, (Ya. M. Barzdin, Ed.), pp. 68\u201381, Latvian State University."},{"key":"25_CR17","unstructured":"PODNIEKS, K.M. (1975), Comparing various concepts of function prediction and program synthesis II, Theory of Algorithms and Programs, (Ya. M. Barzdin, Ed.), pp. 35\u201344 Latvian State University."},{"key":"25_CR18","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers Jr.","year":"1967","unstructured":"ROGERS, H. JR. (1967) \"Theory of Recursive Functions and Effective Computability\", Mc-Graw Hill, New York"},{"key":"25_CR19","doi-asserted-by":"publisher","first-page":"1144","DOI":"10.1145\/322344.322356","volume":"29","author":"C. H. Smith","year":"1982","unstructured":"SMITH, C. H. (1982), The power of pluralism for automatic program synthesis. Journal of the ACM 29, 1144\u20131165.","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51498-8_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:03:35Z","timestamp":1619571815000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51498-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540514985","9783540481805"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-51498-8_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}