{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:14:40Z","timestamp":1725455680662},"publisher-location":"Berlin\/Heidelberg","reference-count":13,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540545646"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0023325","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T05:53:34Z","timestamp":1132379614000},"page":"208-222","source":"Crossref","is-referenced-by-count":1,"title":["Inductive inference of optimal programs a survey and open problems"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Zeugmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1016\/S0022-0000(76)80008-6","volume":"12","author":"D. A. Alton","year":"1976","unstructured":"Alton, D. A. (1976), Non-existence of program optimizers in several abstract settings. J. Computer System Sciences 12, 368\u2013393.","journal-title":"J. Computer System Sciences"},{"key":"12_CR2","unstructured":"Angluin, D. and C. H. Smith (1987), Formal inductive inference, in Encyclopedia of Artificial Intelligence, (S. Shapiro, Ed.), John Wiley and Sons Inc."},{"key":"12_CR3","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/321386.321395","volume":"14","author":"M. Blum","year":"1967","unstructured":"Blum, M. (1967), Machine independent theory of complexity of recursive functions. J. ACM 14, 322\u2013336.","journal-title":"J. ACM"},{"key":"12_CR4","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/S0019-9958(75)90261-2","volume":"28","author":"L. Blum","year":"1975","unstructured":"Blum, L. and M. Blum (1975), Toward a mathematical theory of inductive inference, Information and Control 28, 122\u2013155","journal-title":"Information and Control"},{"key":"12_CR5","first-page":"3","volume-title":"Inductive inference of minimal programs","author":"R. Freivalds","year":"1990","unstructured":"Freivalds, R. (1990), Inductive inference of minimal programs, in Proc. 3rd Workshop on Computational Learning Theory, Rochester, (M. A. Fulk and J. Case, Eds.), Morgan Kaufmann Publishers Inc., 3\u201320."},{"key":"12_CR6","unstructured":"Gasarch, W. I. and C. H. Smith (1991), Learning via queries, J. ACM, to appear, extended abstract in Proc. 29th Annual IEEE Symp. on Foundations of Computer Science, White Plains, 1988."},{"key":"12_CR7","first-page":"327","volume-title":"Learning via queries with teams and anomalies","author":"E. Kinber","year":"1990","unstructured":"Kinber, E., Gasarch, W. I., T. Zeugmann, M. G. Pleszkoch and C. H. Smith (1990), Learning via queries with teams and anomalies, Proc. 3rd Workshop on Computational Learning Theory, Rochester, (M. A. Fulk and J. Case, Eds.), Morgan Kaufmann Publishers Inc., 327\u2013337."},{"key":"12_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":"12_CR9","volume-title":"An introduction to the general theory of algorithms","author":"M. Machtey","year":"1978","unstructured":"Machtey, M. and P. Young (1978), An introduction to the general theory of algorithms, North-Holland, New York."},{"key":"12_CR10","volume-title":"Theory of recursive functions and effective com putability","author":"H. Rogers Jr.","year":"1967","unstructured":"Rogers, H. Jr. (1967), Theory of recursive functions and effective com putability, Mc Graw-Hill, New York."},{"key":"12_CR11","first-page":"559","volume":"19","author":"T. Zeugmann","year":"1983","unstructured":"Zeugmann, T. (1983a), A-posteriori characterizations in inductive inference of recursive functions, J. Information Processing and Cybernetics (EIK) 19, 559\u2013594.","journal-title":"J. Information Processing and Cybernetics (EIK)"},{"key":"12_CR12","first-page":"625","volume":"19","author":"T. Zeugmann","year":"1983","unstructured":"Zeugmann, T. (1983b), On the synthesis of fastest programs in inductive inference, J. Information Processing and Cybernetics (EIK) 19, 625\u2013642.","journal-title":"J. Information Processing and Cybernetics (EIK)"},{"key":"12_CR13","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0304-3975(88)90071-0","volume":"62","author":"T. Zeugmann","year":"1988","unstructured":"Zeugmann, T. (1988), On the power of recursive optimizers, Theoretical Computer Science 62, 1988, 289\u2013310.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Nonmonotonic and Inductive Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0023325.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:50:01Z","timestamp":1607550601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023325"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540545646"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0023325","relation":{},"subject":[]}}