{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:14:21Z","timestamp":1725664461880},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540609223"},{"type":"electronic","value":"9783540497233"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-60922-9_21","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:04:05Z","timestamp":1330272245000},"page":"243-253","source":"Crossref","is-referenced-by-count":3,"title":["General inductive inference types based on linearly-ordered sets"],"prefix":"10.1007","author":[{"given":"Andris","family":"Ambainis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R\u016bsi\u0146\u0161","family":"Freivalds","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carl H.","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"A. Ambainis. The power of procrastination in inductive inference: how it depends on used ordinal notations, volume 904. Springer-Verlag, 1995. P. Vit\u00e1nyi, editor.","DOI":"10.1007\/3-540-59119-2_171"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1145\/356914.356918","volume":"15","author":"D. Angluin","year":"1983","unstructured":"D. Angluin and C. H. Smith. Inductive inference: Theory and methods. Computing Surveys, 15:237\u2013269, 1983.","journal-title":"Computing Surveys"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"K. Aps\u012btis. S. Atikawa and K. Jantke, editors. Derived sets and inductive inference, volume 872. Springer-Verlag, 1994.","DOI":"10.1007\/3-540-58520-6_51"},{"key":"21_CR4","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1090\/S0002-9904-1938-06720-1","volume":"44","author":"A. Church","year":"1938","unstructured":"A. Church. The constructive second number class. Bulliten of the AMS, 44:224\u2013232, 1938.","journal-title":"Bulliten of the AMS"},{"key":"21_CR5","volume-title":"Preliminary version presented","author":"J. Case","year":"1993","unstructured":"J. Case, S. Jain, and M. Suraj, Not-so-nearly-minimal-size program inference. In K. Jantke, editor, Proceedings of the GOSLER Workshop on Algorithmic Learning for Knowledge Processing, to appear 1995. Preliminary version presented November 1993, Dagstuhl Castle, Germany."},{"key":"21_CR6","doi-asserted-by":"crossref","first-page":"11","DOI":"10.4064\/fm-28-1-11-21","volume":"28","author":"A. Church","year":"1937","unstructured":"A. Church and S. Kleene. Formal definitions in the theory of ordinal numbers. Fundamenta Mathematicae, 28:11\u201321, 1937.","journal-title":"Fundamenta Mathematicae"},{"issue":"2","key":"21_CR7","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(2):193\u2013220, 1983.","journal-title":"Theoretical Computer Science"},{"key":"21_CR8","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1006\/inco.1993.1068","volume":"107","author":"R. Freivalds","year":"1993","unstructured":"R. Freivalds and C. Smith. On the power of procrastination for machine learning. Information and Computation, 107:237\u2013271, 1993.","journal-title":"Information and Computation"},{"key":"21_CR9","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"},{"key":"21_CR10","doi-asserted-by":"crossref","first-page":"150","DOI":"10.2307\/2267778","volume":"3","author":"S. Kleene","year":"1938","unstructured":"S. Kleene. On notation for ordinal numbers. Journal of Symbolic Logic, 3:150\u2013155, 1938.","journal-title":"Journal of Symbolic Logic"},{"key":"21_CR11","doi-asserted-by":"crossref","first-page":"643","DOI":"10.2307\/1969101","volume":"44","author":"P. Erdos","year":"1943","unstructured":"P.Erdos. Some remarks on set theory, Annals of Mathematics(2), vol.44(1943), pp.643\u2013646","journal-title":"Annals of Mathematics(2)"},{"key":"21_CR12","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1007\/3-540-60084-1_105","volume":"944","author":"L. Fortnow","year":"1995","unstructured":"L. Fortnow, R.Freivalds, W.I.Gasarch, M. Kummer, S.A. Kurtz, C. Smith, F. Stephan. Measure, category and learnng theory. Lecture Notes in Computer Science, vol. 944(1995), pp. 558\u2013569","journal-title":"Lecture Notes in Computer Science"},{"key":"21_CR13","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BFb0019357","volume":"502","author":"R. Freivalds","year":"1991","unstructured":"R. Freivalds. Inductive inference of recursive functions: qualitative theory. Lecture Notes in Computer Science, Springer, vol. 502(1991), pp. 77\u2013100","journal-title":"Lecture Notes in Computer Science, Springer"},{"key":"21_CR14","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1070\/SM1981v038n02ABEH001229","volume":"38","author":"L. Lisagor","year":"1981","unstructured":"L.Lisagor. The Banach-Mazur game. Translated vaersion of Matematiceskij Sbornik, vol. 38(1981), pp. 201\u2013206","journal-title":"Matematiceskij Sbornik"},{"key":"21_CR15","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/0022-0000(92)90020-J","volume":"44","author":"J. Lutz","year":"1992","unstructured":"J. Lutz. Almost everywhere high nonuniform complexity. Journal of Computer and System Sciences, vol.44(1992), pp. 226\u2013258","journal-title":"Journal of Computer and System Sciences"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"K. Mehlhorn. On the size of sets of computable functions. proceedings of the 14th Annual Symposium on Switching and Automata Theory, 1973, IEEE Computer Society, pp. 190\u2013196","DOI":"10.1109\/SWAT.1973.23"},{"key":"21_CR17","unstructured":"H. Rogers. Theory of Recursive Functions and Effective Computability, McGraw-Hill, 1967"},{"key":"21_CR18","doi-asserted-by":"crossref","first-page":"276","DOI":"10.4064\/fm-22-1-276-280","volume":"22","author":"W. Sierpinski","year":"1934","unstructured":"W. Sierpinski. Sur la dualite entre ka premiere categorie et la mesue nulle, Fundamenta Mathemaicae, vol.22(1934), pp.276\u2013280","journal-title":"Fundamenta Mathemaicae"}],"container-title":["Lecture Notes in Computer Science","STACS 96"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60922-9_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T05:09:30Z","timestamp":1640927370000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60922-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540609223","9783540497233"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-60922-9_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}