{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:47:45Z","timestamp":1725662865941},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540088608"},{"type":"electronic","value":"9783540358077"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1978]]},"DOI":"10.1007\/3-540-08860-1_37","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:35:31Z","timestamp":1330187731000},"page":"494-508","source":"Crossref","is-referenced-by-count":22,"title":["Characterization problems in the theory of inductive inference"],"prefix":"10.1007","author":[{"given":"Rolf","family":"Wiehagen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"37_CR1","unstructured":"Adleman, L., Blum, M., Inductive inference and unsolvability. Preprint."},{"key":"37_CR2","unstructured":"Barzdin, J.M. (1971), Complexity and frequency solution of some algorithmically unsolvable problems. Doct. Diss., Nowosibirsk (in Russian)"},{"key":"37_CR3","unstructured":"Barzdin, J.M. (1974, 1975, 1977, Ed.), Theory of algorithms and programs, vol. 1\u20133. Latvian State Univ., Riga (in Russian)"},{"key":"37_CR4","first-page":"1224","volume":"13","author":"J. M. Barzdin","year":"1972","unstructured":"Barzdin, J.M., Freivald, R.V. (1972), On the prediction of general recursive functions. Soviet Math. Dokl. 13, 1224\u20131228","journal-title":"Soviet Math. Dokl."},{"key":"37_CR5","unstructured":"Barzdin, J.M., Podnieks, K.M. (1973), On the theory of inductive inference. Proc. Symp. MFCS'73, High Tatras (in Russian)"},{"key":"37_CR6","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/321386.321395","volume":"14","author":"M. Blum","year":"1967","unstructured":"Blum, M. (1967), A machine-independent theory of complexity of recursive functions. J. ACM 14, 322\u2013336","journal-title":"J. ACM"},{"key":"37_CR7","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0019-9958(75)90261-2","volume":"28","author":"L. Blum","year":"1975","unstructured":"Blum, L., Blum, M. (1975), Toward a mathematical theory of inductive inference. Inf. and Control 28, 125\u2013155","journal-title":"Inf. and Control"},{"key":"37_CR8","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/3-540-07389-2_199","volume":"32","author":"R. V. Freivald","year":"1975","unstructured":"Freivald, R.V. (1975), Minimal G\u00f6del numbers and their identification in the limit. Lect. Notes in Comp. Sci. 32, 219\u2013225","journal-title":"Lect. Notes in Comp. Sci."},{"key":"37_CR9","unstructured":"Freivald, R.V. (1977), personal communication"},{"key":"37_CR10","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. Symb. Logic 30, 28\u201348","journal-title":"J. Symb. Logic"},{"key":"37_CR11","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E. M. Gold","year":"1967","unstructured":"Gold, E.M. (1967), Language identification in the limit. Inf. and Control 10, 447\u2013474","journal-title":"Inf. and Control"},{"key":"37_CR12","unstructured":"Grabowski, J. (1976), Starke Erkennbarkeit. Humboldt-Univ. Berlin (to be published)"},{"key":"37_CR13","unstructured":"Jantke, K.-P. (1978), Leistungsf\u00e4higkeit und Kompliziertheit universeller Verfahren zur Erkennung allgemein-rekursiver Funktionen. Diss. A, Humboldt-Univ. Berlin"},{"key":"37_CR14","unstructured":"Jung, H. (1977), Zur Untersuchung von abstrakten interaktiven Erkennungssytemen. Diss. A, Humboldt-Univ. Berlin"},{"key":"37_CR15","unstructured":"Lindner, R. (1972), Algorithmische Erkennung. Diss. B, Univ. Jena"},{"key":"37_CR16","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":"37_CR17","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. McGraw-Hill, New York"},{"key":"37_CR18","first-page":"11","volume":"3","author":"H. Thiele","year":"1973","unstructured":"Thiele, H. (1973), Lernverfahren zur Erkennung formaler Sprachen. Kybernetik-Forschung 3, 11\u201393","journal-title":"Kybernetik-Forschung"},{"key":"37_CR19","unstructured":"Thiele, H. (1975), Zur Charakterisierung von Erkennungssytemen mit einbettendem Konvergenzbegriff. Kompliziertheit von Lern-und Erkennungsprozessen 2, Univ. Jena, 188\u2013207"},{"key":"37_CR20","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. (1977), Identification of formal languages. Lect. Notes in Comp. Sci. 53, 571\u2013579","journal-title":"Lect. Notes in Comp. Sci."},{"key":"37_CR21","unstructured":"Wiehagen, R. (1978), Zur Theorie der algorithmischen Erkennung. Diss. B, Humboldt-Univ. Berlin"},{"key":"37_CR22","first-page":"385","volume":"13","author":"R. Wiehagen","year":"1977","unstructured":"Wiehagen, R., Jung, H. (1977), Rekursionstheoretische Charakterisierung von erkennbaren Klassen rekursiver Funktionen. Elektr. Informationsverarbeitung und Kybernetik 13, 385\u2013397","journal-title":"Informationsverarbeitung und Kybernetik"},{"key":"37_CR23","first-page":"421","volume":"12","author":"R. Wiehagen","year":"1976","unstructured":"Wiehagen, R., Liepe, W. (1976), Charakteristische Eigenschaften von erkennbaren Klassen rekursiver Funktionen. Elektr. Informationsverarbeitung und Kybernetik 12, 421\u2013438","journal-title":"Elektr. Informationsverarbeitung und Kybernetik"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-08860-1_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:54:56Z","timestamp":1619556896000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-08860-1_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978]]},"ISBN":["9783540088608","9783540358077"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-08860-1_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1978]]}}}