{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:16:29Z","timestamp":1725664589616},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540604549"},{"type":"electronic","value":"9783540474708"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60454-5_36","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:30:22Z","timestamp":1330281022000},"page":"153-168","source":"Crossref","is-referenced-by-count":0,"title":["Machine induction without revolutionary paradigm shifts"],"prefix":"10.1007","author":[{"given":"John","family":"Case","sequence":"first","affiliation":[]},{"given":"Sanjay","family":"Jain","sequence":"additional","affiliation":[]},{"given":"Arun","family":"Sharma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"issue":"3","key":"12_CR1","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0304-3975(89)90153-9","volume":"66","author":"D. Angluin","year":"1989","unstructured":"D. Angluin, W. Gasarch, and C. Smith. Training sequences. Theoretical Computer Science, 66(3):255\u2013272, 1989.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"12_CR2","doi-asserted-by":"crossref","first-page":"486","DOI":"10.2307\/2275402","volume":"59","author":"G. Baliga","year":"1994","unstructured":"G. Baliga, J. Case, S. Jain, and M. Suraj. Machine learning of higher order programs. Journal of Symbolic Logic, 59(2):486\u2013500, 1994.","journal-title":"Journal of Symbolic Logic"},{"key":"12_CR3","unstructured":"J. M. Barzdin and K. Podnieks. The theory of inductive inference. In Mathematical Foundations of Computer Science, High Tatras, Czechoslovakia, pages 9\u201315, 1973."},{"key":"12_CR4","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":"12_CR5","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":"12_CR6","unstructured":"J. Case. The power of vacillation in language learning. Technical Report 93-08, University of Delaware, 1992. Expands on the article in Proceedings of the Workshop on Computational Learning Theory, Morgan Kauffman, 1988; journal article under revision."},{"key":"12_CR7","first-page":"23","volume":"30","author":"J. Case","year":"1994","unstructured":"J. Case, S. Jain, and S. Ngo Manguelle. Refinements of inductive inference by Popperian and reliable machines. Kybernetika, 30:23\u201352, 1994.","journal-title":"Kybernetika"},{"issue":"1","key":"12_CR8","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1142\/S0129054192000097","volume":"3","author":"J. Case","year":"1992","unstructured":"J. Case, S. Jain, and A. Sharma. On learning limiting programs. International Journal of Foundations of Computer Science, 3(1):93\u2013115, 1992.","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"2","key":"12_CR9","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0022-0000(05)80046-7","volume":"49","author":"J. Case","year":"1994","unstructured":"J. Case, S. Jain, and A. Sharma. Vacillatory learning of nearly minimal size grammers. Journal of Computer and System Sciences, 49(2):189\u2013207, October 1994.","journal-title":"Journal of Computer and System Sciences"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"J. Case, S. Jain, and M. Suraj. Not-so-nearly-minimal-size program inference. In Klaus P. Jantke and Steffen Lange, editors, Algorithmic Learning for Knowledge-Based Systems, volume 961 of Lecture Notes in Artificial Intelligence, pages 77\u201396. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-60217-8_5"},{"key":"12_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":"12_CR12","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":"12_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"},{"issue":"2","key":"12_CR14","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1006\/inco.1994.1084","volume":"114","author":"M. A. Fulk","year":"1994","unstructured":"M. A. Fulk and S. Jain. Approximate inference and scientific method. Information and Computation, 114(2):179\u2013191, November 1994.","journal-title":"Information and Computation"},{"key":"12_CR15","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"},{"issue":"1","key":"12_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(94)00172-U","volume":"53","author":"S. Jain","year":"1995","unstructured":"S. Jain. On a question about learning nearly minimal programs. Information Processing Letters, 53(1):1\u20134, January 1995.","journal-title":"Information Processing Letters"},{"key":"12_CR17","series-title":"Document D91-09","first-page":"87","volume-title":"Proceedings MLNLO '91, Machine Learning of Natural Language and Ontology","author":"S. Jain","year":"1991","unstructured":"S. Jain and A. Sharma. Restrictions on grammar size in language identification. In David Powers and Larry Reeker, editors, Proceedings MLNLO '91, Machine Learning of Natural Language and Ontology, Stanford University, California. Document D91-09, DFKI: Kaiserslautern FRG, 1991., pages 87\u201392, March 1991."},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"S. Jain and A. Sharma. Prudence in vacillatory language identification. Mathematical Systems Theory, 1994. To Appear.","DOI":"10.1007\/3-540-57369-0_36"},{"key":"12_CR19","volume-title":"The Structure of Scientific Revolutions","author":"T. Kuhn","year":"1970","unstructured":"Thomas Kuhn. The Structure of Scientific Revolutions. University of Chicago Press, Chicago, 1970."},{"key":"12_CR20","series-title":"volume 872 of Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1007\/3-540-58520-6_82","volume-title":"Algorithmic Learning Theory","author":"S. Lange","year":"1994","unstructured":"S. Lange and P. Watson. Machine discovery in the presence of incomplete or ambiguous data. In K. Jantke and S. Arikawa, editors, Algorithmic Learning Theory, volume 872 of Lecture Notes in Artificial Intelligence, pages 438\u2013452. Springer-Verlag, Berlin, Reinhardsbrunn Castle, Germany, October 1994."},{"key":"12_CR21","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":"12_CR22","unstructured":"H. Putnam. Probability and confirmation. In Mathematics, Matter, and Method. Cambridge University Press, 1975."},{"key":"12_CR23","volume-title":"PhD thesis","author":"G. Riccardi","year":"1980","unstructured":"G. Riccardi. The Independence of Control Structures in Abstract Programming Systems. PhD thesis, SUNY\/ Buffalo, 1980."},{"key":"12_CR24","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0022-0000(81)90024-6","volume":"22","author":"G. Riccardi","year":"1981","unstructured":"G. Riccardi. The independence of control structures in abstract programming systems. Journal of Computer and System Sciences, 22:107\u2013143, 1981.","journal-title":"Journal of Computer and System Sciences"},{"key":"12_CR25","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":"12_CR26","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":"12_CR27","doi-asserted-by":"crossref","unstructured":"J. Royer. A Connotational Theory of Program Structure. Lecture Notes in Computer Science 273. Springer Verlag, 1987.","DOI":"10.1007\/3-540-18253-5"},{"key":"12_CR28","doi-asserted-by":"crossref","first-page":"342","DOI":"10.2307\/2270310","volume":"36","author":"N. Shapiro","year":"1971","unstructured":"N. Shapiro. Review of \u201cLimiting recursion\u201d by E.M. Gold and \u201cTrial and error predicates and the solution to a problem of Mostowski\u201d by H. Putnam. Journal of Symbolic Logic, 36:342, 1971.","journal-title":"Journal of Symbolic Logic"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60454-5_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:59:22Z","timestamp":1605646762000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60454-5_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540604549","9783540474708"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-60454-5_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}