{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T21:18:10Z","timestamp":1649193490905},"publisher-location":"Berlin\/Heidelberg","reference-count":20,"publisher":"Springer-Verlag","isbn-type":[{"value":"3540541314","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0019358","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T05:26:33Z","timestamp":1132637193000},"page":"111-155","source":"Crossref","is-referenced-by-count":8,"title":["Inductive inference of recursive functions: Complexity bounds"],"prefix":"10.1007","author":[{"given":"R\u016bsi\u0146\u0161","family":"Freivalds","sequence":"first","affiliation":[]},{"given":"J\u0101nis","family":"B\u0101rzdi\u0146\u0161","sequence":"additional","affiliation":[]},{"given":"K\u0101rlis","family":"Podnieks","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"J.Barzdin. Limiting synthesis of \u03c4-indices. Theory of Algorithms and Programs, vol.1, Latvia State University, 1974, pp.112\u2013116 (in Russian)"},{"key":"6_CR2","first-page":"129","volume":"1","author":"J. Barzdin","year":"1974","unstructured":"J. Barzdin. Prediction and limiting synthesis of finite automata. Theory of Algorithms and Programs, vol.1, Latvia State University, 1974, pp.129\u2013144 (in Russian)","journal-title":"Theory of Algorithms and Programs"},{"key":"6_CR3","first-page":"145","volume":"1","author":"J. Barzdin","year":"1974","unstructured":"J. Barzdin. A note on program synthesis from computational histories. Theory of Algorithms and Programs, vol.1, Latvia State University, 1974, pp.145\u2013151 (in Russian)","journal-title":"Theory of Algorithms and Programs"},{"key":"6_CR4","first-page":"1224","volume":"13","author":"J. Barzdin","year":"1972","unstructured":"J. Barzdin, R. Freivald. On the prediction of general recursive functions. Soviet Math. Dokl. 13, 1972, pp.1224\u20131228","journal-title":"Soviet Math. Dokl."},{"key":"6_CR5","first-page":"101","volume":"1","author":"J. Barzdin","year":"1974","unstructured":"J. Barzdin, R. Freivald. Prediction and limiting synthesis of effectively enumerable classes of functions. Theory of Algorithms and Programs, vol.1, Latvia State University, 1974, pp.101\u2013111 (in Russian)","journal-title":"Theory of Algorithms and Programs"},{"key":"6_CR6","first-page":"117","volume":"1","author":"J. Barzdin","year":"1974","unstructured":"J. Barzdin, E. Kinber, K. Podnieks. Speeding up prediction and limiting synthesis of functions. Theory of Algorithms and Programs, vol.1, Latvia State University, 1974, pp.117\u2013128 (in Russian)","journal-title":"Theory of Algorithms and Programs"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"A.W.Biermann. On the inference of Turing machines from sample computations. Artificial Intelligence, 1972","DOI":"10.1016\/0004-3702(72)90048-3"},{"key":"6_CR8","first-page":"144","volume":"1","author":"A.P. Ershov","year":"1971","unstructured":"A.P. Ershov. Theory of program schemata. IFIP Congress 71, Ljubljana, 1971, 1, pp.144\u2013163","journal-title":"IFIP Congress 71, Ljubljana"},{"issue":"5","key":"6_CR9","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:5, 1967, pp.447\u2013474","journal-title":"Information and Control"},{"key":"6_CR10","first-page":"1","volume":"1","author":"A.N.Kolmogorov. Three approaches to the definition of the notion \"quantity of information\"","year":"1965","unstructured":"A.N.Kolmogorov. Three approaches to the definition of the notion \"quantity of information\". Problemy peredachi informacii, 1:1, 1965 (in Russian)","journal-title":"Problemy peredachi informacii"},{"key":"6_CR11","unstructured":"A.D.Korshunov. On asymptotic estimates of the number of finite automata. Kibernetika, 2, 1967 (in Russian)"},{"key":"6_CR12","first-page":"183","volume-title":"Computability by probabilistic machines","author":"K. Leeuw de","year":"1956","unstructured":"K. de Leeuw, E.F. Moore et al, Computability by probabilistic machines. Automata Studies (Ann. of Math. Studies, No.34), Princeton Univ. Press, Princeton, N.J., 1956, pp.183\u2013212"},{"key":"6_CR13","first-page":"1","volume":"2","author":"P.Martin-L\u00f6f","year":"1966","unstructured":"P.Martin-L\u00f6f. On the notion of random sequence. Teoriya veroyatnosti i ee primeneniya, 2:1, 1966 (in Russian)","journal-title":"Teoriya veroyatnosti i ee primeneniya"},{"key":"6_CR14","first-page":"129","volume-title":"Gedanken-experiments on sequential machines","author":"E.F. Moore","year":"1956","unstructured":"E.F. Moore. Gedanken-experiments on sequential machines. Automata Studies (Ann. of Math. Studies, No.34), Princeton Univ. Press, Princeton, N.J., 1956, pp.129\u2013153"},{"key":"6_CR15","first-page":"1042","volume":"16","author":"K.M. Podnieks","year":"1975","unstructured":"K.M. Podnieks. Probabilistic synthesis of enumerated classes of functions. Soviet Math. Dokl. 16, 1975, pp.1042\u20131045","journal-title":"Soviet Math. Dokl."},{"key":"6_CR16","first-page":"89","volume":"3","author":"K.M. Podnieks","year":"1977","unstructured":"K.M. Podnieks. Computational complexity of prediction strategies. Theory of Algorithms and Programs, vol.3, Latvia State University, 1977, pp.89\u2013102 (in Russian)","journal-title":"Theory of Algorithms and Programs"},{"key":"6_CR17","first-page":"57","volume":"3","author":"K.M. Podnieks","year":"1977","unstructured":"K.M. Podnieks. Probabilistic program synthesis. Theory of Algorithms and Programs, vol.3, Latvia State University, 1977, pp.57\u201388 (in Russian)","journal-title":"Theory of Algorithms and Programs"},{"key":"6_CR18","volume-title":"Theory of recursive functions and effective computability","author":"H. Rogers Jr.","year":"1967","unstructured":"H. Rogers, Jr. Theory of recursive functions and effective computability. McGraw-Hill, New York, 1967"},{"key":"6_CR19","volume-title":"Finite Automata (Behaviour and Synthesis)","author":"B.A. Trakhtenbrot","year":"1972","unstructured":"B.A. Trakhtenbrot, J.M. Barzdin. Finite Automata (Behaviour and Synthesis). North-Holland, Amsterdam, 1972"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"A.K.Zvonkin, L.A.Levin. Complexity of finite objects and foundations of the information and randomness notions by the theory of algorithms. Uspekhi matematicheskikh nauk, 25:6, 1970 (in Russian)","DOI":"10.1070\/RM1970v025n06ABEH001269"}],"container-title":["Baltic Computer Science","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0019358.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:42:14Z","timestamp":1607550134000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0019358"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540541314"],"references-count":20,"URL":"http:\/\/dx.doi.org\/10.1007\/bfb0019358","relation":{}}}