{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T19:42:52Z","timestamp":1769974972322,"version":"3.49.0"},"publisher-location":"Berlin\/Heidelberg","reference-count":33,"publisher":"Springer-Verlag","isbn-type":[{"value":"3540545646","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0023324","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T05:53:34Z","timestamp":1132379614000},"page":"184-207","source":"Crossref","is-referenced-by-count":27,"title":["A thesis in inductive inference"],"prefix":"10.1007","author":[{"given":"Rolf","family":"Wiehagen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0019-9958(80)90285-5","volume":"45","author":"D. Angluin","year":"1980","unstructured":"Angluin, D., Inductive inference of formal languages from positive data. Information and Control 45(1980) 117\u2013135.","journal-title":"Information and Control"},{"key":"11_CR2","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1145\/356914.356918","volume":"15","author":"D. Angluin","year":"1983","unstructured":"Angluin, D., Smith, C.H., Inductive inference: theory and methods. Computing surveys 15(1983) 237\u2013269.","journal-title":"Computing surveys"},{"key":"11_CR3","unstructured":"Barzdin, J.M., Complexity and frequency solution of some algorithmically unsolvable problems. Doctoral dissertation, Novosibirsk State University, 1971 (in Russian)."},{"key":"11_CR4","volume-title":"Dissertation A","author":"H.-R. Beick","year":"1984","unstructured":"Beick, H.-R., Induktive Inferenz mit h\u00f6chster Konvergenzgeschwindigkeit. Dissertation A, Humboldt-Universit\u00e4t Berlin, 1984."},{"key":"11_CR5","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0019-9958(75)90261-2","volume":"28","author":"L. Blum","year":"1975","unstructured":"Blum, L., Blum, M., Toward a mathematical theory of inductive inference. Information and Control 28(1975) 125\u2013155.","journal-title":"Information and Control"},{"key":"11_CR6","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0020-0190(87)90114-1","volume":"24","author":"A. Blumer","year":"1987","unstructured":"Blumer, A., Ehrenfeucht, A., Haussler, D., Warmuth, M., Occam's razor. Information Processing Letters 24(1987) 377\u2013380.","journal-title":"Information Processing Letters"},{"key":"11_CR7","unstructured":"Board, R., Pitt, L., On the necessity of Occam algorithms. University of Illinois, 'Techn. Report UIUCDCS-R-89-1544, 1989."},{"key":"11_CR8","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0304-3975(83)90061-0","volume":"25","author":"J. Case","year":"1983","unstructured":"Case, J., Smith, C., Comparison of identification criteria for machine inductive inference. Theoretical Computer Science 25(1983) 193\u2013220.","journal-title":"Theoretical Computer Science"},{"key":"11_CR9","first-page":"1681","volume":"15","author":"R. Freivalds","year":"1974","unstructured":"Freivalds, R., On the limit synthesis of numbers of general recursive functions in various computable numberings. Sov. Math. Dokl. 15(1974) 1681\u20131683.","journal-title":"Sov. Math. Dokl."},{"key":"11_CR10","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1002\/malq.19820282708","volume":"28","author":"R. Freivalds","year":"1982","unstructured":"Freivalds, R., Kinber, E.B., Wiehagen, R., Inductive inference and computable one-one numberings. Zeitschrift f\u00fcr Math. Logik und Grundlagen der Mathematik 28(1982) 463\u2013479.","journal-title":"Zeitschrift f\u00fcr Math. Logik und Grundlagen der Mathematik"},{"key":"11_CR11","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/malq.19840300904","volume":"30","author":"R. Freivalds","year":"1984","unstructured":"Freivalds, R., Kinber, E.B., Wiehagen, R., Connections between identifying functionals, standardizing operations, and computable numberings. Zeitschrift f\u00fcr Math. Logik und Grundlagen der Mathematik 30(1984) 145\u2013164.","journal-title":"Zeitschrift f\u00fcr Math. Logik und Grundlagen der Mathematik"},{"key":"11_CR12","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1002\/malq.19880340605","volume":"34","author":"R. Freivalds","year":"1988","unstructured":"Freivalds, R., Kinber, E.B., Wiehagen, R., Probabilistic versus deterministic inductive inference in nonstandard numberings. Zeitschrift f\u00fcr Math. Logik und Grundlagen der Mathematik 34(1988) 531\u2013539.","journal-title":"Zeitschrift f\u00fcr Math. Logik und Grundlagen der Mathematik"},{"key":"11_CR13","first-page":"1","volume":"397","author":"R. Freivalds","year":"1989","unstructured":"Freivalds, R., Kinber, E.B., Wiehagen, R., Inductive inference from good examples. Lecture Notes in Artificial Intelligence 397(1989) 1\u201317.","journal-title":"Lecture Notes in Artificial Intelligence"},{"key":"11_CR14","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E.M. Gold","year":"1967","unstructured":"Gold, E.M., Language, identification in the limit. Information and Control 10(1967) 447\u2013474.","journal-title":"Information and Control"},{"key":"11_CR15","unstructured":"Jain, S., Sharma, A., Recursion theoretic characterizations of language learning. University of Rochester, Department of Computer Science, Techn. Report 281, 1989."},{"key":"11_CR16","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF03037092","volume":"8","author":"K.P. Jantke","year":"1991","unstructured":"Jantke, K.P., Monotonic and non-monotonic inductive inference. New Generation Computing 8(1991) 349\u2013360.","journal-title":"New Generation Computing"},{"key":"11_CR17","first-page":"465","volume":"17","author":"K.P. Jantke","year":"1981","unstructured":"Jantke, K.P., Beick, H.-R., Combining postulates of naturalness in inductive inference. Elektronische Informationsverarbeitung und Kybernetik 17(1981) 465\u2013484.","journal-title":"Elektronische Informationsverarbeitung und Kybernetik"},{"key":"11_CR18","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., Wiehagen, R., Research in the theory of inductive inference by GDR mathematicians \u2014 a survey. Information Sciences 22(1980) 149\u2013169.","journal-title":"Information Sciences"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Kurtz, S.A., Smith, C.H., On the role of search for learning. Proc. Workshop on Computational Learning Theory (R. Rivest, D. Haussler, M. Warmuth, Eds.), 1989, 303\u2013311.","DOI":"10.1016\/B978-0-08-094829-4.50024-6"},{"key":"11_CR20","unstructured":"Podnieks, K.M., Comparing various concepts of function prediction, Part I in: [24], Vol. 1, 68\u201381; Part II in [24], Vol. 2, 33\u201344 (in Russian)."},{"key":"11_CR21","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, 1967."},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Royer, J.S., A connotational theory of program structure. Lecture Notes in Computer Science 273(1987), 186 pp.","DOI":"10.1007\/3-540-18253-5"},{"key":"11_CR23","unstructured":"Strukturerkennung diskreter kybernetischer Systeme I, II. (R. Lindner, H. Thiele, Eds.), Seminarberichte der Sekt. Mathematik der Humboldt-Universit\u00e4t Berlin 82(1986), 452 S."},{"key":"11_CR24","unstructured":"Theory of algorithms and programs. Vol. 1, 2, 3 (J.M. Barzdin, Ed.), Latvian State University Riga, 1974, 1975, 1977 (in Russian)."},{"key":"11_CR25","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1007\/3-540-08353-7_182","volume":"53","author":"R. Wiehagen","year":"1977","unstructured":"Wiehagen, R., Identification of formal languages. Lecture Notes in Computer Science 53(1977) 571\u2013579.","journal-title":"Lecture Notes in Computer Science"},{"key":"11_CR26","volume-title":"Dissertation B","author":"R. Wiehagen","year":"1978","unstructured":"Wiehagen, R., Zur Theorie der algorithmischen Erkennung. Dissertation B, Humboldt-Universit\u00e4t Berlin, 1978."},{"key":"11_CR27","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1007\/3-540-08860-1_37","volume":"62","author":"R. Wiehagen","year":"1978","unstructured":"Wiehagen, R., Characterization problems in the theory of inductive inference. Lecture Notes in Computer Science 62(1978) 494\u2013508.","journal-title":"Lecture Notes in Computer Science"},{"key":"11_CR28","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/3-540-16444-8_22","volume":"215","author":"R. Wiehagen","year":"1986","unstructured":"Wiehagen, R., How fast is program synthesis from examples. Lecture Notes in Computer Science 215(1986) 231\u2013239.","journal-title":"Lecture Notes in Computer Science"},{"key":"11_CR29","first-page":"305","volume":"22","author":"R. Wiehagen","year":"1986","unstructured":"Wiehagen, R., On the complexity of program synthesis from examples, Journal of Information Processing and Cybernetics 22(1986) 305\u2013323.","journal-title":"Journal of Information Processing and Cybernetics"},{"key":"11_CR30","first-page":"385","volume":"13","author":"R. Wiehagen","year":"1977","unstructured":"Wiehagen, R., Jung, H., Rekursionstheoretische Charakterisierung von erkennbaren Klassen rekursiver Funktionen. Elektronische Informationsverarbeitung und Kybernetik (EIK) 13(1977) 385\u2013397.","journal-title":"Elektronische Informationsverarbeitung und Kybernetik (EIK)"},{"key":"11_CR31","first-page":"421","volume":"12","author":"R. Wiehagen","year":"1976","unstructured":"Wiehagen, R., Liepe, W., Charakteristische Eigenschaften von erkennbaren Klassen rekursiver Funktionen. Elektronische Informationsverarbeitung und Kybernetik 12(1976) 421\u2013438.","journal-title":"Elektronische Informationsverarbeitung und Kybernetik"},{"key":"11_CR32","first-page":"559","volume":"19","author":"T. Zeugmann","year":"1983","unstructured":"Zeugmann, T., A posteriori characterizations in inductive inference of recursive functions. Journal of Information Processing and Cybernetics 19(1983) 559\u2013594.","journal-title":"Journal of Information Processing and Cybernetics"},{"key":"11_CR33","first-page":"627","volume":"19","author":"T. Zeugmann","year":"1983","unstructured":"Zeugmann, T., On the synthesis of fastest programs in inductive inference. Journal of Information Processing and Cybernetics 19(1983) 627\u2013642.","journal-title":"Journal of Information Processing and Cybernetics"}],"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\/BFb0023324.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\/BFb0023324"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540545646"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/bfb0023324","relation":{},"subject":[]}}