{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:12:09Z","timestamp":1725664329958},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540585206"},{"type":"electronic","value":"9783540490302"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58520-6_54","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:35:15Z","timestamp":1330256115000},"page":"64-75","source":"Crossref","is-referenced-by-count":6,"title":["Learning with higher order additional information"],"prefix":"10.1007","author":[{"given":"Ganesh","family":"Baliga","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Case","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"issue":"3","key":"9_CR1","doi-asserted-by":"crossref","first-page":"891","DOI":"10.2307\/2275058","volume":"56","author":"L. Adleman","year":"1991","unstructured":"L. Adleman and M. Blum. Inductive inference and unsolvability. Journal of Symbolic Logic, 56(3):891\u2013900, 1991.","journal-title":"Journal of Symbolic Logic"},{"key":"9_CR2","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1145\/356914.356918","volume":"15","author":"D. Angluin","year":"1983","unstructured":"D. Angluin and C. Smith. A survey of inductive inference: Theory and methods. Computing Surveys, 15:237\u2013289, 1983.","journal-title":"Computing Surveys"},{"key":"9_CR3","first-page":"82","volume-title":"Theory of Algorithms and Programs","author":"J. Barzdin","year":"1974","unstructured":"J. Barzdin. Two theorems on the limiting synthesis of functions. In Theory of Algorithms and Programs, Latvian State University, Riga, 210:82\u201388, 1974."},{"key":"9_CR4","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0019-9958(75)90261-2","volume":"28","author":"L. Blum","year":"1975","unstructured":"L. Blum and M. Blum. Toward a mathematical theory of inductive inference. Information and Control, 28:125\u2013155, 1975.","journal-title":"Information and Control"},{"key":"9_CR5","first-page":"672","volume-title":"volume 665 of Lecture Notes in Computer Science","author":"G. Baliga","year":"1993","unstructured":"G. Baliga, J. Case, and S. Jain. Language learning with some negative information. In K.W. Wagner P. Enjalbert, A. Finkel, editor, Proceedings of the 10th Symposium on Theoretical Aspects of Computer Science, volume 665 of Lecture Notes in Computer Science, pages 672\u2013681. Springer-Verlag, Berlin, W\u00fcrzburg, Germany, February 1993. Journal version to appear in Journal of Computer and System Sciences."},{"issue":"2","key":"9_CR6","doi-asserted-by":"crossref","first-page":"486","DOI":"10.2307\/2275402","volume":"59","author":"G. Baliga","year":"1994","unstructured":"G. Baliga, J. Case, S. Jain, and M. Suraj. Machine learning of higher order programs. Journal of Symbolic Logic, 59(2):486\u2013500, 1994.","journal-title":"Journal of Symbolic Logic"},{"key":"9_CR7","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:322\u2013336, 1967.","journal-title":"Journal of the ACM"},{"key":"9_CR8","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:15\u201332, 1974.","journal-title":"Mathematical Systems Theory"},{"key":"9_CR9","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1080\/09528139408953778","volume":"6","author":"J. Case","year":"1994","unstructured":"J. Case. Infinitary self-reference in learning theory. Journal of Experimental and Theoretical Artificial Intelligence, 6:3\u201316, 1994.","journal-title":"Journal of Experimental and Theoretical Artificial Intelligence"},{"key":"9_CR10","first-page":"180","volume-title":"Degrees of inferability","author":"P. Cholak","year":"1992","unstructured":"P. Cholak, R. Downey, L. Fortnow, W. Gasarch, E. Kinber, M. Kummer, S. Kurtz, and T. Slaman. Degrees of inferability. In Proceedings of the Fifth Annual Workshop on Computational Learning Theory, Pittsburgh, PA, pages 180\u2013192. ACM Press, July 1992."},{"key":"9_CR11","first-page":"23","volume":"30","author":"J. Case","year":"1994","unstructured":"J. Case, S. Jain, and S. Ngo Manguelle. Refinements of inductive inference by Popperian and reliable machines. Kybernetika, 30:23\u201352, 1994.","journal-title":"Kybernetika"},{"issue":"1","key":"9_CR12","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1142\/S0129054192000097","volume":"3","author":"J. Case","year":"1992","unstructured":"J. Case, S. Jain, and A. Sharma. On learning limiting programs. International Journal of Foundations of Computer Science, 3(1):93\u2013115, 1992.","journal-title":"International Journal of Foundations of Computer Science"},{"key":"9_CR13","first-page":"107","volume-title":"Machine inductive inference and language identification","author":"J. Case","year":"1982","unstructured":"J. Case and C. Lynes. Machine inductive inference and language identification. In M. Nielsen and E. Schmidt, editors, Proceedings of the 9th International Colloquium on Automata, Languages and Programming, volume 140, pages 107\u2013115. Springer-Verlag, Berlin, 1982."},{"key":"9_CR14","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:193\u2013220, 1983.","journal-title":"Theoretical Computer Science"},{"key":"9_CR15","first-page":"183","volume":"34","author":"E. deLeeuw","year":"1956","unstructured":"E. deLeeuw, C. Moore, C. Shannon, and N. Shapiro. Computability by probabilistic machines. Automata Studies, Annals of Math. Studies, 34:183\u2013212, 1956.","journal-title":"Automata Studies, Annals of Math. Studies"},{"key":"9_CR16","unstructured":"M. Fulk. A Study of Inductive Inference machines. PhD thesis, SUNY at Buffalo, 1985."},{"key":"9_CR17","first-page":"179","volume":"15","author":"R. Freivalds","year":"1979","unstructured":"R. Freivalds and R. Wiehagen. Inductive inference with additional information. Electronische Informationverarbeitung und Kybernetik, 15:179\u2013195, 1979.","journal-title":"Electronische Informationverarbeitung und Kybernetik"},{"key":"9_CR18","volume-title":"PhD thesis","author":"J. Gill","year":"1972","unstructured":"J. Gill. Probabilistic Turing Machines and Complexity of Computation. PhD thesis, University of California, Berkeley, 1972."},{"key":"9_CR19","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1137\/0206049","volume":"6","author":"J. Gill","year":"1977","unstructured":"J. Gill. Computational complexity of probabilistic Turing machines. SIAM Journal on Computing, 6:675\u2013695, 1977.","journal-title":"SIAM Journal on Computing"},{"key":"9_CR20","doi-asserted-by":"crossref","first-page":"28","DOI":"10.2307\/2270580","volume":"30","author":"E. Gold","year":"1965","unstructured":"E. Gold. Limiting recursion. Journal of Symbolic Logic, 30:28\u201348, 1965.","journal-title":"Journal of Symbolic Logic"},{"key":"9_CR21","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E. Gold","year":"1967","unstructured":"E. Gold. Language identification in the limit: Information and Control, 10:447\u2013474, 1967.","journal-title":"Information and Control"},{"key":"9_CR22","unstructured":"J. Hopcroft and J. Ullman. Introduction to Automata Theory Languages and Computation. Addison-Wesley Publishing Company, 1979."},{"key":"9_CR23","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0020-0190(93)90229-3","volume":"47-2","author":"S. Jain","year":"1993","unstructured":"S. Jain and A. Sharma. On the non-existence of maximal inference degrees for language identification. Information Processing Letters, 47-2:81\u201388, 1993.","journal-title":"Information Processing Letters"},{"key":"9_CR24","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0020-0255(80)80006-5","volume":"22","author":"R. Klette","year":"1980","unstructured":"R. Klette and R. Wiehagen. Research in the theory of inductive inference by GDR mathematicians \u2014 A survey. Information Sciences, 22:149\u2013169, 1980.","journal-title":"Information Sciences"},{"key":"9_CR25","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1090\/S0002-9947-1976-0403933-6","volume":"220","author":"N. Lynch","year":"1976","unstructured":"N. Lynch, A. Meyer, and M. Fischer. Relativization of the theory of computational complexity. Transactions of the American Mathematical Society, 220:243\u2013287, 1976.","journal-title":"Transactions of the American Mathematical Society"},{"key":"9_CR26","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."},{"key":"9_CR27","volume-title":"Systems that Learn, An Introduction to Learning Theory for Cognitive and Computer Scientists","author":"D. Osherson","year":"1986","unstructured":"D. Osherson, M. Stob, and S. Weinstein. Systems that Learn, An Introduction to Learning Theory for Cognitive and Computer Scientists. MIT Press, Cambridge, Mass., 1986."},{"key":"9_CR28","unstructured":"M. Pleszkoch, G. Gasarch, S. Jain, and R. Solovay. Learning via queries to an oracle, 1990. Submitted for publication."},{"key":"9_CR29","doi-asserted-by":"crossref","first-page":"49","DOI":"10.2307\/2270581","volume":"30","author":"H. Putnam","year":"1965","unstructured":"H. Putnam. Trial and error predicates and the solution to a problem of Mostowski. Journal of Symbolic Logic, 30:49\u201357, 1965.","journal-title":"Journal of Symbolic Logic"},{"key":"9_CR30","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:331\u2013341, 1958.","journal-title":"Journal of Symbolic Logic"},{"key":"9_CR31","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers","year":"1967","unstructured":"H. Rogers. Theory of Recursive Functions and Effective Computability. Mc-Graw Hill, New York, 1967. Reprinted, MIT Press, 1987."},{"key":"9_CR32","doi-asserted-by":"crossref","first-page":"342","DOI":"10.2307\/2270310","volume":"36","author":"N. Shapiro","year":"1971","unstructured":"N. Shapiro. Review of \u201cLimiting recursion\u201d by E.M. Gold and \u201cTrial and error predicates and the solution to a problem of Mostowski\u201d by H. Putnam. Journal of Symbolic Logic, 36:342, 1971.","journal-title":"Journal of Symbolic Logic"},{"key":"9_CR33","doi-asserted-by":"crossref","first-page":"644","DOI":"10.2307\/1970028","volume":"69","author":"J. Shoenfield","year":"1959","unstructured":"J. Shoenfield. On degrees of unsolvability. Annals of Mathematics, 69:644\u2013653, 1959.","journal-title":"Annals of Mathematics"},{"key":"9_CR34","unstructured":"J. Shoenfield. Degrees of Unsolvability. North-Holland, 1971."},{"key":"9_CR35","doi-asserted-by":"crossref","unstructured":"R. Soare. Recursively Enumerable Sets and Degrees. Springer-Verlag, 1987.","DOI":"10.1007\/978-3-662-02460-7"},{"key":"9_CR36","volume-title":"Weak inductive inference","author":"J. Viksna","year":"1993","unstructured":"J. Viksna. Weak inductive inference. In J. Shawe-Taylor, editor, Proceedings of the First European Workshop on Computational Learning Theory. Oxford University Press, London, University of London, Royal Holloway, December 1993."},{"key":"9_CR37","volume-title":"Zur Theorie der Algorithmischen Erkennung","author":"R. Wiehagen","year":"1978","unstructured":"R. Wiehagen. Zur Theorie der Algorithmischen Erkennung. 1978. Humboldt-Universit\u00e4t, Berlin."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58520-6_54.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:18:38Z","timestamp":1619558318000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58520-6_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540585206","9783540490302"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/3-540-58520-6_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}