{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:14:14Z","timestamp":1725459254480},"publisher-location":"Berlin\/Heidelberg","reference-count":23,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540133720"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0030306","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T10:19:29Z","timestamp":1138184369000},"page":"255-264","source":"Crossref","is-referenced-by-count":0,"title":["On the complexity of inductive inference"],"prefix":"10.1007","author":[{"given":"Robert P.","family":"Daley","sequence":"first","affiliation":[]},{"given":"Carl H.","family":"Smith","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/S0019-9958(78)90683-6","volume":"39","author":"D. Angluin","year":"1978","unstructured":"Angluin, D., On the complexity of minimum inference of regular sets, Information and Control 39 (1978), 337\u2013350.","journal-title":"Information and Control"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Angluin, D. and Smith, C., Inductive inference: theory and methods, Computing Surveys, to appear.","DOI":"10.1145\/356914.356918"},{"key":"21_CR3","first-page":"82","volume-title":"Two theorems on the limiting synthesis of functions, Theory of Algorithms and Programs I","author":"J. Barzdin","year":"1974","unstructured":"Barzdin, J., Two theorems on the limiting synthesis of functions, Theory of Algorithms and Programs I, Latvian State University, Riga, U.S.S.R. (1974), 82\u201388."},{"key":"21_CR4","first-page":"1224","volume":"13","author":"J. Barzdin","year":"1972","unstructured":"Barzdin, J. and FreIvald, R., On the prediction of general recursive functions, Soviet Math. Doklady 13 (1972), 1224\u20131228.","journal-title":"Soviet Math. Doklady"},{"key":"21_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. and Blum, M., Toward a mathematical theory of inductive inference, Information and Control 28 (1975), 125\u2013155.","journal-title":"Information and Control"},{"key":"21_CR6","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/321386.321395","volume":"14","author":"M. Blum","year":"1967","unstructured":"Blum, M., A machine-independent theory of the complexity of recursive functions, Journal Assoc. Comput. Mach. 14 (1967), 322\u2013326.","journal-title":"Journal Assoc. Comput. Mach."},{"key":"21_CR7","unstructured":"Case, J. and Ngo-Manguelle, S., Refinements of inductive inference by Popperian machines, Technical Report, SUNY Buffalo, Department of Computer Science (1979)."},{"key":"21_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. and Smith, C., Comparison of identification criteria fon machine inductive inference, Theoretical Computer Science 25 (1983), 193\u2013220.","journal-title":"Theoretical Computer Science"},{"key":"21_CR9","first-page":"155","volume-title":"On the complexity and optimality of computation in the limit, Theory of Algorithms and Programs II","author":"R. Freivald","year":"1975","unstructured":"Freivald, R., On the complexity and optimality of computation in the limit, Theory of Algorithms and Programs II. Lativan State University, Riga, U.S.S.R. (1975), 155\u2013173."},{"key":"21_CR10","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E. Gold","year":"1967","unstructured":"Gold, E., Language identification in the limit, Information and Control 10 (1967), 447\u2013474.","journal-title":"Information and Control"},{"key":"21_CR11","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/S0019-9958(78)90562-4","volume":"37","author":"E. Gold","year":"1978","unstructured":"Gold, E., Complexity of automaton identification from given data, Information and Control 37 (1978), 302\u2013320.","journal-title":"Information and Control"},{"key":"21_CR12","volume-title":"Aspects of Scientific Explanation","author":"C. Hempel","year":"1965","unstructured":"Hempel, C., Aspects of Scientific Explanation, The Free Press (1965), New York."},{"key":"21_CR13","volume-title":"On the complexity of computation on Turing machines with oracles","author":"J. Khodzhayev","year":"1970","unstructured":"Khodzhayev, J., On the complexity of computation on Turing machines with oracles, Ph.D. Dissertation, Tashkent (1970)."},{"key":"21_CR14","first-page":"369","volume":"13","author":"E. Kinber","year":"1977","unstructured":"Kinber, E., On speeding up the limiting identification of recursive functions by changing the sequence of questions, Elektronische Informationsverarbeitung und Kybernetik 13 (1977), 369\u2013383.","journal-title":"Elektronische Informationsverarbeitung und Kybernetik"},{"key":"21_CR15","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. and 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":"21_CR16","unstructured":"Machtey, M. and Young, P., An Introduction to the General Theory of Algorithms, North-Holland (1978), New York."},{"key":"21_CR17","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1007\/3-540-07389-2_221","volume":"32","author":"P. Pudlak","year":"1975","unstructured":"Pudlak, P., Polynomially complete problems in the logic of automated discovery, Lecture Notes in Computer Science 32 (1975), 358\u2013361.","journal-title":"Lecture Notes in Computer Science"},{"key":"21_CR18","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0304-3975(79)90045-8","volume":"8","author":"P. Pudlak","year":"1979","unstructured":"Pudlak, P. and Springsteel, F., Complexity in mechanized hypothesis formation, Theorectical Computer Science 8 (1979), 203\u2013225.","journal-title":"Theorectical Computer Science"},{"key":"21_CR19","unstructured":"Putnam, H., Probability and confirmation, Mathematics, Matter, and Method, Cambridge University Press (1975). Originally appeared in 1963 as a Voice of America Lecture."},{"key":"21_CR20","doi-asserted-by":"crossref","first-page":"331","DOI":"10.2307\/2964292","volume":"23","author":"H. Rogers","year":"1958","unstructured":"Rogers, H., G\u00f6del numberings of partial recursive functions, Journal of Symbolic Logic 23 (1958), 331\u2013341.","journal-title":"Journal of Symbolic Logic"},{"key":"21_CR21","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers","year":"1967","unstructured":"Rogers, H., Theory of Recursive Functions and Effective Computability, McGraw Hill (1967), New York."},{"key":"21_CR22","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1137\/0207035","volume":"7","author":"A. Selman","year":"1978","unstructured":"Selman, A., Polynomial time enumeiation reducibility, SIAM Journal on Computing 7 (1978), 440\u2013457.","journal-title":"SIAM Journal on Computing"},{"key":"21_CR23","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/BF01702871","volume":"5","author":"P. Young","year":"1971","unstructured":"Young, P., Speed-ups by changing the order in which sets are enumerated, Math. Systems Theory 5 (1971), 148\u2013152.","journal-title":"Math. Systems Theory"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1984"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0030306.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T17:01:00Z","timestamp":1607533260000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0030306"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540133720"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/bfb0030306","relation":{},"subject":[]}}