{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T03:56:57Z","timestamp":1768708617372,"version":"3.49.0"},"reference-count":39,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1983,3,1]],"date-time":"1983-03-01T00:00:00Z","timestamp":415324800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1983,3,1]],"date-time":"1983-03-01T00:00:00Z","timestamp":415324800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":11096,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["7903912"],"award-info":[{"award-number":["7903912"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["MCS-77"],"award-info":[{"award-number":["MCS-77"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["MCS-801072-8"],"award-info":[{"award-number":["MCS-801072-8"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1983,3]]},"DOI":"10.1016\/0304-3975(83)90061-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"193-220","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":328,"title":["Comparison of identification criteria for machine inductive inference"],"prefix":"10.1016","volume":"25","author":[{"given":"John","family":"Case","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carl","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(83)90061-0_BIB1","unstructured":"D. Angluin and C. Smith, A brief survey of inductive inference, preprint."},{"key":"10.1016\/0304-3975(83)90061-0_BIB2","first-page":"81","article-title":"Prognostication of automata and functions","volume":"Vol. 1","author":"Barzdin","year":"1972"},{"key":"10.1016\/0304-3975(83)90061-0_BIB3","first-page":"82","article-title":"Two theorems on the limiting synthesis of functions","volume":"210","author":"Barzdin","year":"1974","journal-title":"Latv. Gos. Univ. U\u0107e. Zap."},{"key":"10.1016\/0304-3975(83)90061-0_BIB4","first-page":"1224","article-title":"On the prediction of general recursive functions","volume":"13","author":"Barzdin","year":"1972","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0304-3975(83)90061-0_BIB5","first-page":"112","article-title":"Prediction and limiting synthesis of recursively enumerable classes of functions","volume":"Vol. 1","author":"Barzdin","year":"1974"},{"key":"10.1016\/0304-3975(83)90061-0_BIB6","first-page":"9","article-title":"The theory of inductive inference","author":"Barzdin","year":"1973"},{"key":"10.1016\/0304-3975(83)90061-0_BIB7","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0019-9958(75)90261-2","article-title":"Toward a mathematical theory of inductive inference","volume":"28","author":"Blum","year":"1975","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(83)90061-0_BIB8","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/321386.321395","article-title":"A machine-independent theory of the complexity of recursive functions","volume":"14","author":"Blum","year":"1967","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(83)90061-0_BIB9","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S0019-9958(67)90546-3","article-title":"On the size of machine","volume":"11","author":"Blum","year":"1967","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(83)90061-0_BIB10","author":"Brainerd","year":"1974"},{"key":"10.1016\/0304-3975(83)90061-0_BIB11","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF01761704","article-title":"Periodicity in generations of automata","volume":"8","author":"Case","year":"1974","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(83)90061-0_BIB12","first-page":"107","article-title":"Machine inductive inference and language identification (Preliminary Report)","volume":"140","author":"Case","year":"1982"},{"key":"10.1016\/0304-3975(83)90061-0_BIB13","unstructured":"J. Case and S. Ngo Manguelle, Refinements of inductive inference by Popperian machines I, II, Kyberbetika, to appear."},{"key":"10.1016\/0304-3975(83)90061-0_BIB14","first-page":"314","article-title":"Anomaly hierarchies of mechanized inductive inference","author":"Case","year":"1978","journal-title":"Proc. 10th Symposium on the Theory of Computing"},{"key":"10.1016\/0304-3975(83)90061-0_BIB15","series-title":"Ph.D. Thesis","article-title":"Tradeoffs in machine inductive inference","author":"Chen","year":"1981"},{"key":"10.1016\/0304-3975(83)90061-0_BIB16","article-title":"Tradeoffs in the inductive inference of nearly minimal size programs","author":"Chen","year":"1981"},{"key":"10.1016\/0304-3975(83)90061-0_BIB17","unstructured":"R. Daley, On the error correcting power of pluralism, preprint."},{"key":"10.1016\/0304-3975(83)90061-0_BIB18","doi-asserted-by":"crossref","first-page":"309","DOI":"10.2307\/2964290","article-title":"Three theorems on recursive enumeration","volume":"23","author":"Friedberg","year":"1958","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(83)90061-0_BIB19","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/S0019-9958(72)90424-X","article-title":"Some decidability results on grammatical inference and complexity","volume":"20","author":"Feldman","year":"1972","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(83)90061-0_BIB20","first-page":"219","article-title":"Minimal G\u00f6del numbers and their identification in the limit","volume":"32","author":"Freivald","year":"1975"},{"key":"10.1016\/0304-3975(83)90061-0_BIB21","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","article-title":"Language identification in the limit","volume":"10","author":"Gold","year":"1967","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(83)90061-0_BIB22","first-page":"435","article-title":"On a theory of inductive inference","volume":"56","author":"Kinber","year":"1977"},{"key":"10.1016\/0304-3975(83)90061-0_BIB23","volume":"Vol. 1","author":"Knuth","year":"1968"},{"key":"10.1016\/0304-3975(83)90061-0_BIB24","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0020-0255(80)80006-5","article-title":"Research in the theory of inductive inference by GDR mathematicians\u2014a survey","volume":"22","author":"Klette","year":"1980","journal-title":"Information Sci."},{"key":"10.1016\/0304-3975(83)90061-0_BIB25","author":"Laudan","year":"1977"},{"key":"10.1016\/0304-3975(83)90061-0_BIB26","first-page":"79","article-title":"Classes of computable functions defined by bounds on computation","author":"McCreight","year":"1969","journal-title":"Proc. ACM Symposium on Theory of Computing"},{"key":"10.1016\/0304-3975(83)90061-0_BIB27","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0304-3975(76)90087-6","article-title":"Some natural properties of strong-identification in inductive inference","volume":"2","author":"Minicozzi","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(83)90061-0_BIB28","author":"Machtey","year":"1978"},{"key":"10.1016\/0304-3975(83)90061-0_BIB29","series-title":"Mathematical Principles of Natural Philosophy","author":"Newton","year":"1946"},{"key":"10.1016\/0304-3975(83)90061-0_BIB30","first-page":"68","article-title":"Comparing various concepts of functions prediction, Part I","volume":"210","author":"Podnieks","year":"1974","journal-title":"Latv. Gos. Univ. U\u0107en. Zap."},{"key":"10.1016\/0304-3975(83)90061-0_BIB31","series-title":"The Logic of Scientific Discovery","author":"Popper","year":"1968"},{"key":"10.1016\/0304-3975(83)90061-0_BIB32","article-title":"Probability and Conformation","volume":"10","author":"Putnam","year":"1963"},{"key":"10.1016\/0304-3975(83)90061-0_BIB33","doi-asserted-by":"crossref","first-page":"331","DOI":"10.2307\/2964292","article-title":"G\u00f6del numberings of partial recursive functions","volume":"23","author":"Rogers","year":"1958","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(83)90061-0_BIB34","author":"Rogers","year":"1967"},{"key":"10.1016\/0304-3975(83)90061-0_BIB35","author":"Shoenfield","year":"1971"},{"key":"10.1016\/0304-3975(83)90061-0_BIB36","unstructured":"C. H. Smith, The power of pluralism for automatic program synthesis, J. ACM, to appear."},{"key":"10.1016\/0304-3975(83)90061-0_BIB37","author":"Webb","year":"1980"},{"key":"10.1016\/0304-3975(83)90061-0_BIB38","first-page":"494","article-title":"Characterization problems in the theory of inductive inference","volume":"62","author":"Wiehagen","year":"1978"},{"key":"10.1016\/0304-3975(83)90061-0_BIB39","first-page":"421","article-title":"Characteristic properties of recognizable classes of recursive function","volume":"12","author":"Wiehagen","year":"1974","journal-title":"Electron. Informationsverab. Kyberinet."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583900610?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583900610?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T04:18:12Z","timestamp":1757477892000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397583900610"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,3]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1983,3]]}},"alternative-id":["0304397583900610"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(83)90061-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1983,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Comparison of identification criteria for machine inductive inference","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0304-3975(83)90061-0","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1983 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}