乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T15:23:42Z","timestamp":1648653822713},"reference-count":21,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4307,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,10]]},"DOI":"10.1016\/s0304-3975(00)00276-0","type":"journal-article","created":{"date-parts":[[2002,10,15]],"date-time":"2002-10-15T13:27:27Z","timestamp":1034688447000},"page":"367-393","source":"Crossref","is-referenced-by-count":2,"title":["Closedness properties in ex-identification"],"prefix":"10.1016","volume":"268","author":[{"given":"Kalvis","family":"Aps\u0131\u0304tis","sequence":"first","affiliation":[]},{"given":"R\u016bsi\u0146\u0161","family":"Freivalds","sequence":"additional","affiliation":[]},{"given":"Raimonds","family":"Simanovskis","sequence":"additional","affiliation":[]},{"given":"Juris","family":"Smotrovs","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00276-0_BIB1","first-page":"2","article-title":"Team learning as a game","volume":"vol. 1316","author":"Ambainis","year":"1997"},{"key":"10.1016\/S0304-3975(00)00276-0_BIB2","first-page":"99","article-title":"Unions of identifiable classes of total recursive functions","volume":"vol. 642","author":"Aps\u0131\u0304tis","year":"1992"},{"key":"10.1016\/S0304-3975(00)00276-0_BIB3","unstructured":"J. B\u0101rzdi\u0146\u0161, Two theorems on the limiting synthesis of functions, in: J. B\u0101rzdi\u0146\u0161 (Ed.), Theory of Algorithms and Programs, vol. 1, Latvian State University, R\u0131\u0304ga, 1974, pp. 82\u201388 (in Russian.)"},{"key":"10.1016\/S0304-3975(00)00276-0_BIB4","first-page":"1224","article-title":"On the prediction of general recursive functions","volume":"13","author":"B\u0101rzdi\u0146\u0161","year":"1972","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/S0304-3975(00)00276-0_BIB5","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":"Inform. and Control"},{"key":"10.1016\/S0304-3975(00)00276-0_BIB6","first-page":"107","article-title":"Machine inductive inference and language identification","volume":"vol. 140","author":"Case","year":"1982"},{"issue":"2","key":"10.1016\/S0304-3975(00)00276-0_BIB7","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0304-3975(83)90061-0","article-title":"Comparison of identification criteria for machine inductive inference","volume":"25","author":"Case","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00276-0_BIB8","first-page":"77","volume":"vol. 28","author":"Freivalds","year":"1975"},{"key":"10.1016\/S0304-3975(00)00276-0_BIB9","first-page":"219","volume":"vol. 32","author":"Freivalds","year":"1975"},{"key":"10.1016\/S0304-3975(00)00276-0_BIB10","series-title":"Co-learning of total recursive functions, Proceedings of the 7th Annual ACM Workshop on Computational Learning Theory","first-page":"190","author":"Freivalds","year":"1994"},{"issue":"4","key":"10.1016\/S0304-3975(00)00276-0_BIB11","first-page":"179","article-title":"Inductive inference with additional information","volume":"15","author":"Freivalds","year":"1979","journal-title":"Elektron. Inform. Kybernet."},{"key":"10.1016\/S0304-3975(00)00276-0_BIB12","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":"Inform. and Control"},{"key":"10.1016\/S0304-3975(00)00276-0_BIB13","first-page":"108","article-title":"On identification by teams and probabilistic machines","volume":"vol. 961","author":"Jain","year":"1995"},{"key":"10.1016\/S0304-3975(00)00276-0_BIB14","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0019-9958(86)80025-0","article-title":"Aggregating inductive expertise","volume":"70","author":"Osherson","year":"1986","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(00)00276-0_BIB15","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0019-9958(82)80025-9","article-title":"Criteria of language learning","volume":"52","author":"Osherson","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(00)00276-0_BIB16","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0890-5401(88)90046-6","article-title":"Probability and plurality for aggregations of learning machines","volume":"77","author":"Pitt","year":"1988","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(00)00276-0_BIB17","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"issue":"4","key":"10.1016\/S0304-3975(00)00276-0_BIB18","doi-asserted-by":"crossref","first-page":"1144","DOI":"10.1145\/322344.322356","article-title":"The power of pluralism for automatic program synthesis","volume":"29","author":"Smith","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(00)00276-0_BIB19","first-page":"79","article-title":"Closedness properties in team learning of recursive functions","volume":"vol. 1208","author":"Smotrovs","year":"1997"},{"key":"10.1016\/S0304-3975(00)00276-0_BIB20","volume":"vol. 47","author":"Smullyan","year":"1961"},{"key":"10.1016\/S0304-3975(00)00276-0_BIB21","first-page":"93","article-title":"Limes-Erkennung rekursiver Funktionen durch spezielle Strategien","volume":"12","author":"Wiehagen","year":"1976","journal-title":"J. Inform. Process. Cybernet."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002760?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002760?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T09:50:23Z","timestamp":1556185823000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500002760"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["S0304397500002760"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00276-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,10]]}}}