{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T14:51:00Z","timestamp":1770475860165,"version":"3.49.0"},"reference-count":24,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1972,1,1]],"date-time":"1972-01-01T00:00:00Z","timestamp":63072000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1972,1]]},"DOI":"10.1016\/0004-3702(72)90048-3","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T09:45:39Z","timestamp":1048585539000},"page":"181-198","source":"Crossref","is-referenced-by-count":49,"special_numbering":"C","title":["On the inference of Turing machines from sample computations"],"prefix":"10.1016","volume":"3","author":[{"given":"A.W","family":"Biermann","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(72)90048-3_BIB1","series-title":"Self Organizing Systems\u20141962","article-title":"On the automatic formation of a computer program which represents a theory","author":"Amarel","year":"1962"},{"key":"10.1016\/0004-3702(72)90048-3_BIB2","article-title":"Representations and modelling in problems of program formation","volume":"6","author":"Amarel","year":"1971"},{"issue":"No. 6","key":"10.1016\/0004-3702(72)90048-3_BIB3","article-title":"On the synthesis of finite-state machines from samples of their behavior","volume":"C-21","author":"Biermann","year":"1972","journal-title":"IEEE Trans. Electron. Computers"},{"key":"10.1016\/0004-3702(72)90048-3_BIB4","series-title":"Frontiers in Pattern Recognitions","article-title":"A survey of results in grammatical inference","author":"Biermann","year":"1972"},{"key":"10.1016\/0004-3702(72)90048-3_BIB5","series-title":"Computability and Unsolvability","author":"Davis","year":"1958"},{"key":"10.1016\/0004-3702(72)90048-3_BIB6","series-title":"A.I. Memo No. 55","article-title":"First thoughts on grammatical inference","author":"Feldman","year":"1967"},{"key":"10.1016\/0004-3702(72)90048-3_BIB7","doi-asserted-by":"crossref","DOI":"10.1016\/S0019-9958(72)90424-X","article-title":"Some decidability results on grammatical inference and complexity","author":"Feldman","year":"1972","journal-title":"Information and Control"},{"key":"10.1016\/0004-3702(72)90048-3_BIB8","doi-asserted-by":"crossref","DOI":"10.21236\/AD0692390","article-title":"Grammatical Complexity and Inference","author":"Feldman","year":"1969"},{"key":"10.1016\/0004-3702(72)90048-3_BIB9","series-title":"A.I. Memo No. AIM-159","article-title":"Total complexity and the inference of best programs","author":"Feldman","year":"1972"},{"issue":"No. 1","key":"10.1016\/0004-3702(72)90048-3_BIB10","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1145\/321312.321316","article-title":"Realization of input-output relations by sequential machines","volume":"13","author":"Gill","year":"1966","journal-title":"J. ACM"},{"key":"10.1016\/0004-3702(72)90048-3_BIB11","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1109\/TEC.1959.5222056","article-title":"Synthesis of minimal-state machines","volume":"EC8","author":"Ginsburg","year":"1959","journal-title":"IRE Trans. Electron. Computers"},{"key":"10.1016\/0004-3702(72)90048-3_BIB12","series-title":"An Introduction to Mathematical Machine Theory","author":"Ginsburg","year":"1962"},{"key":"10.1016\/0004-3702(72)90048-3_BIB13","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\/0004-3702(72)90048-3_BIB14","article-title":"A study of grammatical inference","author":"Horning","year":"1969"},{"issue":"No. 3","key":"10.1016\/0004-3702(72)90048-3_BIB15","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1145\/362566.362568","article-title":"Toward automatic program synthesis","volume":"14","author":"Manna","year":"1971","journal-title":"Comm. Ass. Computing Machinery"},{"key":"10.1016\/0004-3702(72)90048-3_BIB16","unstructured":"Mendel, J. M. and Fu, K. S. Adaptive, Learning, and Pattern Recognition Systems. Academic Press, New York, 197."},{"key":"10.1016\/0004-3702(72)90048-3_BIB17","series-title":"Computation: Finite and Infinite Machines","author":"Minsky","year":"1967"},{"key":"10.1016\/0004-3702(72)90048-3_BIB18","series-title":"Perceptrons: An Introduction to Computational Geometry","author":"Minsky","year":"1969"},{"key":"10.1016\/0004-3702(72)90048-3_BIB19","series-title":"Learning Machines","author":"Nilsson","year":"1965"},{"issue":"No. 6","key":"10.1016\/0004-3702(72)90048-3_BIB20","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1147\/rd.116.0601","article-title":"Some studies in machine learning using the game of checkers, II\u2014recent progress","volume":"11","author":"Samuel","year":"1967","journal-title":"IBM J. of Res. and Develop."},{"issue":"No. 12","key":"10.1016\/0004-3702(72)90048-3_BIB21","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1145\/365691.365960","article-title":"Experiments with a deductive question-answering program","volume":"8","author":"Slagle","year":"1965","journal-title":"Comm. Ass. Computing Machinery"},{"key":"10.1016\/0004-3702(72)90048-3_BIB22_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(64)90223-2","article-title":"A formal theory of inductive inference","volume":"7","author":"Solomonoff","year":"1964","journal-title":"Information and Control"},{"key":"10.1016\/0004-3702(72)90048-3_BIB22_2","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/S0019-9958(64)90131-7","article-title":"A formal theory of inductive inference","volume":"7","author":"Solomonoff","year":"1964","journal-title":"Information and Control"},{"key":"10.1016\/0004-3702(72)90048-3_BIB23","series-title":"Proceedings of the International Joint Conference on Artificial Intelligence","article-title":"PROW: A Step Toward Automatic Program Writing","author":"Waldinger","year":"1969"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370272900483?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370272900483?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T14:51:00Z","timestamp":1553439060000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0004370272900483"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1972,1]]},"references-count":24,"alternative-id":["0004370272900483"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(72)90048-3","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1972,1]]}}}