{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:19:12Z","timestamp":1725455952956},"publisher-location":"Berlin\/Heidelberg","reference-count":17,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540541314"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0019357","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T00:26:33Z","timestamp":1132619193000},"page":"77-110","source":"Crossref","is-referenced-by-count":23,"title":["Inductive inference of recursive functions: Qualitative theory"],"prefix":"10.1007","author":[{"given":"R\u016bsi\u0146\u0161","family":"Freivalds","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","first-page":"81","volume-title":"Prognostication of automata and functions","author":"J.M. Barzdin","year":"1972","unstructured":"J.M. Barzdin. Prognostication of automata and functions,81\u201384, Elsevier North Holland, 1972."},{"key":"5_CR2","series-title":"Theory of algorithms and programs","first-page":"82","volume-title":"Two theorems on limiting synthesis of functions","author":"J.M. Barzdin","year":"1974","unstructured":"J.M. Barzdin. Two theorems on limiting synthesis of functions. Theory of algorithms and programs, No. 1, 82\u201388, Riga, University of Latvia, 1974 (Russian)."},{"key":"5_CR3","unstructured":"Yu.L.E. Ershov. Theory of Numberings. Nauka, 1977 (Russian)."},{"key":"5_CR4","first-page":"812","volume":"219","author":"R. Freivalds","year":"1974","unstructured":"R. Freivalds. On limiting synthesis of indices of total recursive functions in various computable numberings. Doklady AN SSSR, 219: 812, 1974 (Russian).","journal-title":"Doklady AN SSSR"},{"key":"5_CR5","unstructured":"R.Freivalds. Possibility to identify in the limit the indices of total recursive functions in various computable numberings. Theory of algorithms and programs, No.2, 3\u201325 (Russian)."},{"key":"5_CR6","doi-asserted-by":"crossref","first-page":"309","DOI":"10.2307\/2964290","volume":"23","author":"R.M. Friedberg","year":"1958","unstructured":"R.M. Friedberg. Three theorems on recursive functions: I Decomposition. II Maximal sets. III Enumeration without dublication. Symbolic Logic, 23:309\u2013316, 1958.","journal-title":"Symbolic Logic"},{"key":"5_CR7","unstructured":"R.Frevialds, E.B.Kinber. Limiting identification of the minimal Goedel numbers, Theory of algorithms and programms, No.3, 3\u201334 (Russian)."},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E.M. Gold","year":"1967","unstructured":"E.M. Gold. Language identification in the limit. Information and Control, 10:447\u2013474, 1967.","journal-title":"Information and Control"},{"key":"5_CR9","unstructured":"E,B.Kinber. On limiting identification of minimal numbers for functions from effectively enumerable classes. Theory of algorithms and programs, No.3, 35\u201356 (Russian)."},{"key":"5_CR10","first-page":"459","volume":"19","author":"E.B. Kinber","year":"1983","unstructured":"E.B. Kinber. A note on limit identification of c-minimal indices. Elektronische Informationsverarbeiterung und Kybernetik, 19: 459\u2013463, 1983.","journal-title":"Elektronische Informationsverarbeiterung und Kybernetik"},{"key":"5_CR11","first-page":"68","volume":"1","author":"K.M. Podnieks","year":"1974","unstructured":"K.M. Podnieks. Comparing varions concepts of function prediction, part 1. Theory of algorithms and programs, 1:68\u201381, 1974 (Russian).","journal-title":"Theory of algorithms and programs"},{"key":"5_CR12","first-page":"33","volume":"2","author":"K.M. Podnieks","year":"1975","unstructured":"K.M. Podnieks. Comparing varions concepts of function prediction, part 2. Theory of algorithms and programs, 2:33\u201344, 1975 (Russian).","journal-title":"Theory of algorithms and programs"},{"key":"5_CR13","doi-asserted-by":"crossref","first-page":"331","DOI":"10.2307\/2964292","volume":"23","author":"H. Rogers","year":"1958","unstructured":"H. Rogers. Goedel numberings of the partial recursive functions. J.Symbolic Logic, 23: 331\u2013341, 1958.","journal-title":"J.Symbolic Logic"},{"key":"5_CR14","unstructured":"H.Rogers. Theory of Recursive Functions and Effective Computability. Mc Graw-Hill, 1967. Reprinted. MIT Press. 1987."},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"1144","DOI":"10.1145\/322344.322356","volume":"29","author":"C.H. Smith","year":"1982","unstructured":"C.H. Smith. The power of pluralism for automatic program synthesis. Journal of the ACM, 29:1144\u20131165, 1982.","journal-title":"Journal of the ACM"},{"key":"5_CR16","first-page":"5","volume":"4","author":"B.A. Trakhtenbrot","year":"1965","unstructured":"B.A. Trakhtenbrot. Optimal computations and the frequential phenomenon by Yablonski. Algebra i Logika. 4:5, 1965 (Russian).","journal-title":"Algebra i Logika"},{"key":"5_CR17","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1007\/3-540-08353-7_182","volume":"53","author":"R. Wiehagen","year":"1977","unstructured":"R. Wiehagen. Identification of formal languages. Lecture Notes in Computer Science, 53:571\u2013579, 1977.","journal-title":"Lecture Notes in Computer Science"}],"container-title":["Lecture Notes in Computer Science","Baltic Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0019357.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T16:42:14Z","timestamp":1607532134000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0019357"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540541314"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/bfb0019357","relation":{},"subject":[]}}