{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T13:14:35Z","timestamp":1649078075548},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1996,9,1]],"date-time":"1996-09-01T00:00:00Z","timestamp":841536000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[1996,9]]},"DOI":"10.1007\/bf02127967","type":"journal-article","created":{"date-parts":[[2005,9,14]],"date-time":"2005-09-14T13:08:51Z","timestamp":1126703331000},"page":"177-187","source":"Crossref","is-referenced-by-count":1,"title":["Learning-theoretic perspectives of acceptable numberings"],"prefix":"10.1007","volume":"17","author":[{"given":"Ganesh R.","family":"Baliga","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anil M.","family":"Shende","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02127967_CR1","doi-asserted-by":"crossref","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 (1967) 322\u2013336.","journal-title":"Journal of the ACM"},{"key":"BF02127967_CR2","doi-asserted-by":"crossref","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 (1974) 15\u201332.","journal-title":"Mathematical Systems Theory"},{"key":"BF02127967_CR3","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1080\/09528139208953752","volume":"4","author":"J. Case","year":"1993","unstructured":"J. Case, Infinitary self-reference in learning theory,Journal of Experimental and Theoretical Artificial Intelligence 4 (1993) 281\u2013293. To appear in the special issue from AII 92.","journal-title":"Journal of Experimental and Theoretical Artificial Intelligence"},{"key":"BF02127967_CR4","doi-asserted-by":"crossref","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 (1983) 193\u2013220.","journal-title":"Theoretical Computer Science"},{"key":"BF02127967_CR5","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/malq.19840300904","volume":"30","author":"R. Freivalds","year":"1984","unstructured":"R. Freivalds, E.B. Kinber and R. Wichagen, Connections between identifying functionals, standardizing operations, and computable numberings,Zeitschr. Math. Logik und Grundlagen d. Math. 30 (1984) 145\u2013164.","journal-title":"Zeitschr. Math. Logik und Grundlagen d. Math."},{"key":"BF02127967_CR6","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 (1975) 219\u2013225.","journal-title":"Lecture Notes in Computer Science"},{"issue":"3","key":"BF02127967_CR7","doi-asserted-by":"crossref","first-page":"309","DOI":"10.2307\/2964290","volume":"23","author":"R.M. Friedberg","year":"1958","unstructured":"R.M. Friedberg, Three theorems on recursive enumeration,Journal of Symbolic Logic 23(3) (September, 1958) 309\u2013316.","journal-title":"Journal of Symbolic Logic"},{"key":"BF02127967_CR8","doi-asserted-by":"crossref","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 (1967) 447\u2013474.","journal-title":"Information and Control"},{"key":"BF02127967_CR9","unstructured":"S. Jain and A. Sharma, Connections between machine learning and standardizing operations, in:Proceedings of the First Annual Workshop on Computational Learning Theory, MIT, Cambridge, eds. D. Haussler and L. Pitt (Morgan Kaufmann Publishers, August, 1988) pp. 427\u2013428."},{"key":"BF02127967_CR10","unstructured":"S. Jain and A. Sharma, Characterizing language learning by standardizing operations, in:Advances in Computing and Information, Proceedings of the International Conference on Computing and Information, Niagara Falls, Canada, eds. S. Akl, F. Fiala and W.W. Koczkodaj (Canadian Scholars' Press, May, 1990) pp. 144\u2013148."},{"key":"BF02127967_CR11","unstructured":"E.B. Kinber, Private communication."},{"key":"BF02127967_CR12","first-page":"45","volume":"233","author":"E.B. Kinber","year":"1975","unstructured":"E.B. Kinber, On comparison of limit identification and limit standardization of general recursive functions,Uch. Zap. Latv. Univ. 233 (1975) 45\u201356.","journal-title":"Uch. Zap. Latv. Univ."},{"key":"BF02127967_CR13","unstructured":"M. Kummer, Private communication."},{"issue":"2","key":"BF02127967_CR14","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0304-3975(90)90141-4","volume":"74","author":"M. Kummer","year":"1990","unstructured":"M. Kummer, An easy priority-free proof of a theorem of Friedberg,Theoretical Computer Science 74(2) (1990) 249\u2013251.","journal-title":"Theoretical Computer Science"},{"key":"BF02127967_CR15","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)."},{"issue":"2","key":"BF02127967_CR16","first-page":"252","volume":"14","author":"M. Pour-El","year":"1964","unstructured":"M. Pour-El, G\u00f6del numberings versus Friedberg numberings,Proceedings of the American Mathematical Society 14(2) (April, 1964) 252\u2013256.","journal-title":"Proceedings of the American Mathematical Society"},{"key":"BF02127967_CR17","volume-title":"Conjectures and Refutations: the Growth of Scientific Knowledge","author":"K. Popper","year":"1962","unstructured":"K. Popper,Conjectures and Refutations: the Growth of Scientific Knowledge (Basic Books, New York, 1962)."},{"key":"BF02127967_CR18","volume-title":"The Logic of Scientific Discovery","author":"K. Popper","year":"1968","unstructured":"K. Popper,The Logic of Scientific Discovery (Harper Torch Books, New York, 2nd ed., 1968).","edition":"2nd ed."},{"key":"BF02127967_CR19","unstructured":"J. Royer and J. Case,Intensional Subrecursion and Complexity Theory (Research Notes in Theoretical Science, Pitman Press, 1992). Under preparation."},{"key":"BF02127967_CR20","unstructured":"G. Riccardi,The Independence of Control Structures in Abstract Programming Systems, Ph.D. Thesis, SUNY\/Buffalo (1980)."},{"key":"BF02127967_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 (1958) 331\u2013341.","journal-title":"Journal of Symbolic Logic"},{"key":"BF02127967_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":"BF02127967_CR23","doi-asserted-by":"crossref","unstructured":"J. Royer,A Connotational Theory of Program Structure, Lecture Notes in Computer Science, Vol. 273 (Springer-Verlag, 1987).","DOI":"10.1007\/3-540-18253-5"},{"key":"BF02127967_CR24","doi-asserted-by":"crossref","unstructured":"R. Soare,Recursively Enumerable Sets and Degrees (Springer-Verlag, 1987).","DOI":"10.1007\/978-3-662-02460-7"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02127967.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02127967\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02127967","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T21:45:40Z","timestamp":1557783940000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02127967"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,9]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,9]]}},"alternative-id":["BF02127967"],"URL":"https:\/\/doi.org\/10.1007\/bf02127967","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,9]]}}}