{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:57:29Z","timestamp":1725663449608},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540549673"},{"type":"electronic","value":"9783540466123"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54967-6_65","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T23:22:15Z","timestamp":1330212135000},"page":"121-140","source":"Crossref","is-referenced-by-count":2,"title":["Complexity issues for vacillatory function identification"],"prefix":"10.1007","author":[{"given":"John","family":"Case","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjay","family":"Jain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arun","family":"Sharma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","volume":"21","author":"D. Angluin","year":"1980","unstructured":"D. Angluin. Finding patterns common to a set of strings. Journal of Computer and System Sciences, 21:46\u201362, 1980.","journal-title":"Journal of Computer and System Sciences"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0019-9958(75)90261-2","volume":"28","author":"L. Blum","year":"1975","unstructured":"L. Blum and M. Blum. Toward a mathematical theory of inductive inference. Information and Control, 28:125\u2013155, 1975.","journal-title":"Information and Control"},{"key":"9_CR3","first-page":"101","volume":"210","author":"J. A. Barzdin","year":"1974","unstructured":"J. A. Barzdin and R. Freivalds. Prediction and limiting synthesis of recursively enumerable classes of functions. Latvijas Valsts Univ. Zimatm. Raksti, 210:101\u2013111, 1974.","journal-title":"Latvijas Valsts Univ. Zimatm. Raksti"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/321386.321395","volume":"14","author":"M. Blum","year":"1967","unstructured":"M. Blum. A machine independent theory of the complexity of recursive functions. Journal of the ACM, 14:322\u2013336, 1967.","journal-title":"Journal of the ACM"},{"key":"9_CR5","unstructured":"J. A. Barzdin and K. Podnieks. The theory of inductive inference. In Mathematical Foundations of Computer Science, 1973."},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF01761704","volume":"8","author":"J. Case","year":"1974","unstructured":"J. Case. Periodicity in generations of automata. Mathematical Systems Theory, 8:15\u201332, 1974.","journal-title":"Mathematical Systems Theory"},{"key":"9_CR7","unstructured":"J. Case. The power of vacillation. In D. Haussler and L. Pitt, editors, Proceedings of the Workshop on Computational Learning Theory, pages 133\u2013142. Morgan Kaufmann Publishers, Inc., 1988."},{"key":"9_CR8","volume-title":"PhD thesis","author":"K. Chen","year":"1981","unstructured":"K. Chen. Tradeoffs in Machine Inductive Inference. PhD thesis, SUNY at Buffalo, 1981."},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/S0019-9958(82)80086-7","volume":"52","author":"K. Chen","year":"1982","unstructured":"K. Chen. Tradeoffs in inductive inference of nearly minimal sized programs. Information and Control, 52:68\u201386, 1982.","journal-title":"Information and Control"},{"key":"9_CR10","first-page":"189","volume-title":"Convergence to nearly minimal size grammars by vacillating learning machines","author":"J. Case","year":"1989","unstructured":"J. Case, S. Jain, and A. Sharma. Convergence to nearly minimal size grammars by vacillating learning machines. In R. Rivest, D. Haussler, and M.K. Warmuth, editors, Proceedings of the Second Annual Workshop on Computational Learning Theory, Santa Cruz, California, pages 189\u2013199. Morgan Kaufmann Publishers, Inc., August 1989."},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0304-3975(83)90061-0","volume":"25","author":"J. Case","year":"1983","unstructured":"J. Case and C. Smith. Comparison of identification criteria for machine inductive inference. Theoretical Computer Science, 25:193\u2013220, 1983.","journal-title":"Theoretical Computer Science"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/S0019-9958(86)80042-0","volume":"69","author":"R. Daley","year":"1986","unstructured":"R. Daley and C. Smith. On the complexity of inductive inference. Information and Control, 69:12\u201340, 1986.","journal-title":"Information and Control"},{"key":"9_CR13","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/3-540-07389-2_199","volume":"32","author":"R. Freivalds","year":"1975","unstructured":"R. Freivalds. Minimal G\u00f6del numbers and their identification in the limit. Lecture Notes in Computer Science, 32:219\u2013225, 1975.","journal-title":"Lecture Notes in Computer Science"},{"key":"9_CR14","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":"9_CR15","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/S0019-9958(78)90562-4","volume":"37","author":"E. M. Gold","year":"1978","unstructured":"E. M. Gold. Complexity of automaton identification from given data. Information and Control, 37:302\u2013320, 1978.","journal-title":"Information and Control"},{"key":"9_CR16","volume-title":"Technical Report 90-06","author":"S. Jain","year":"1990","unstructured":"S. Jain and A. Sharma. Program size restrictions in inductive learning. Technical Report 90-06, University of Delaware, Newark, Delaware, 1990."},{"key":"9_CR17","first-page":"221","volume-title":"Theory Of Algorithms and Programs","author":"E.B. Kinber","year":"1974","unstructured":"E.B. Kinber. On the synthesis in the limit of almost minimal G\u00f6del numbers. Theory Of Algorithms and Programs, LSU, Riga, U.S.S.R., 1:221\u2013223, 1974."},{"key":"9_CR18","unstructured":"E.B. Kinber. On limit identification of minimal G\u00f6del numbers for functions from enumerable classes. Theory of Algorithms and Programs 3;Riga 1977, pages 35\u201356, 1977."},{"key":"9_CR19","volume-title":"An Introduction to the General Theory of Algorithms","author":"M. Machtey","year":"1978","unstructured":"M. Machtey and P. Young. An Introduction to the General Theory of Algorithms. North Holland, New York, 1978."},{"key":"9_CR20","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0019-9958(82)80025-9","volume":"52","author":"D. Osherson","year":"1982","unstructured":"D. Osherson and S. Weinstein. Criteria of language learning. Information and Control, 52:123\u2013138, 1982.","journal-title":"Information and Control"},{"key":"9_CR21","doi-asserted-by":"crossref","first-page":"331","DOI":"10.2307\/2964292","volume":"23","author":"H. Rogers","year":"1958","unstructured":"H. Rogers. G\u00f6del numberings of partial recursive functions. Journal of Symbolic Logic, 23:331\u2013341, 1958.","journal-title":"Journal of Symbolic Logic"},{"key":"9_CR22","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers","year":"1967","unstructured":"H. Rogers. Theory of Recursive Functions and Effective Computability. McGraw Hill, New York, 1967. Reprinted. MIT Press. 1987."},{"key":"9_CR23","first-page":"305","volume":"22","author":"R. Wiehagen","year":"1986","unstructured":"R. Wiehagen. On the complexity of program synthesis from examples. Electronische Informationverarbeitung und Kybernetik, 22:305\u2013323, 1986.","journal-title":"Electronische Informationverarbeitung und Kybernetik"},{"key":"9_CR24","first-page":"625","volume":"19","author":"T. Zeugmann","year":"1983","unstructured":"T. Zeugmann. On the synthesis of fastest programs in inductive inference. Electronische Informationverarbeitung und Kybernetik, 19:625\u2013642, 1983.","journal-title":"Electronische Informationverarbeitung und Kybernetik"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54967-6_65.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:27:14Z","timestamp":1619573234000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54967-6_65"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540549673","9783540466123"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-54967-6_65","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}