{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:19:24Z","timestamp":1742617164771,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540591191"},{"type":"electronic","value":"9783540491958"}],"license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59119-2_174","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:02:52Z","timestamp":1330275772000},"page":"140-153","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Learning recursive functions from approximations"],"prefix":"10.1007","author":[{"given":"John","family":"Case","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Susanne","family":"Kaufmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Efim","family":"Kinber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Kummer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0890-5401(88)90044-2","volume":"77","author":"A. Amir","year":"1988","unstructured":"A. Amir, W. I. Gasarch. Polynomial terse sets. Inf. and Comp., 77:37\u201356, 1988.","journal-title":"Inf. and Comp."},{"key":"10_CR2","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0304-3975(89)90153-9","volume":"66","author":"D. Angluin","year":"1989","unstructured":"D. Angluin, W. I. Gasarch, C. H. Smith. Training sequences. Theoretical Computer Science, 66:255\u2013272, 1989.","journal-title":"Theoretical Computer Science"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"G. Baliga, J. Case. Learning with higher order additional information. In: Proceedings 4th AII'94, pp. 64\u201375, Lecture Notes in Computer Science 872, 1994.","DOI":"10.1007\/3-540-58520-6_54"},{"key":"10_CR4","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1006\/inco.1993.1014","volume":"103","author":"R. Beigel","year":"1993","unstructured":"R. Beigel, W. I. Gasarch, J. Gill, J. C. Owings. Terse, superterse, and verbose sets. Information and Computation, 103:68\u201385, 1993.","journal-title":"Information and Computation"},{"key":"10_CR5","unstructured":"R. Beigel, M. Kummer, F. Stephan. Quantifying the amount of verboseness. To appear in: Information and Computation."},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"R. Beigel, M. Kummer, F. Stephan. Approximable sets. Proceedings Structure in Complexity Theory, Ninth Annual Conference, pp. 12\u201323, IEEE Press, 1994.","DOI":"10.1109\/SCT.1994.315822"},{"key":"10_CR7","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1145\/76359.76371","volume":"36","author":"A. Blumer","year":"1989","unstructured":"A. Blumer, A. Ehrenfeucht, D. Haussler, M. K. Warmuth. Learnability and the Vapnik-Chervonenkis dimension. J. of the ACM, 36:929\u2013965, 1989.","journal-title":"J. of the ACM"},{"key":"10_CR8","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, C. H. Smith. Identification criteria for machine inductive inference. Theoretical Computer Science, 25:193\u2013220, 1983.","journal-title":"Theoretical Computer Science"},{"key":"10_CR9","unstructured":"A. N. Degtev. On (m,n)-computable sets. In Algebraic Systems (Edited by D.I. Moldavanskij). Ivanova Gos. Univ. 88\u201399, 1981. (Russian) (MR 86b:03049)"},{"key":"10_CR10","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0168-0072(94)90035-3","volume":"66","author":"L. Fortnow","year":"1994","unstructured":"L. Fortnow, W. Gasarch, S. Jain, E. Kinber, M. Kummer, S. Kurtz, M. Pleszkoch, T. Slaman, R. Solovay, F. Stephan. Extremes in the degrees of inferability. Annals of Pure and Applied Logic, 66:231\u2013276, 1994.","journal-title":"Annals of Pure and Applied Logic"},{"key":"10_CR11","first-page":"179","volume":"15","author":"R. V. Freivalds","year":"1979","unstructured":"R. V. Freivalds, R. Wiehagen. Inductive inference with additional information. EIK, 15:179\u2013185, 1979.","journal-title":"EIK"},{"key":"10_CR12","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1145\/146637.146670","volume":"39","author":"W. I. Gasarch","year":"1992","unstructured":"W. I. Gasarch, C. H. Smith. Learning via queries. J. of the ACM, 39:649\u2013674, 1992.","journal-title":"J. of the ACM"},{"key":"10_CR13","doi-asserted-by":"crossref","first-page":"677","DOI":"10.2307\/2275300","volume":"57","author":"V. Harizanov","year":"1992","unstructured":"V. Harizanov, M. Kummer, J. C. Owings, Jr. Frequency computation and the cardinality theorem. J. Symb. Log., 57:677\u2013681, 1992.","journal-title":"J. Symb. Log."},{"key":"10_CR14","unstructured":"S. Kaufmann, M. Kummer. On a quantitative notion of uniformity. To appear in: Fundamenta Informaticae."},{"key":"10_CR15","first-page":"873","volume":"13","author":"E. B. Kinber","year":"1972","unstructured":"E. B. Kinber. On frequency calculations of general recursive predicates. Sov. Math. Dokl., 13:873\u2013876, 1972.","journal-title":"Sov. Math. Dokl."},{"key":"10_CR16","unstructured":"E. B. Kinber. Frequency-computable functions and frequency-enumerable sets. Candidate Dissertation, Riga, 1975. (Russian)"},{"key":"10_CR17","doi-asserted-by":"crossref","first-page":"682","DOI":"10.2307\/2275299","volume":"57","author":"M. Kummer","year":"1992","unstructured":"M. Kummer. A proof of Beigel's cardinality conjecture. J. Symb. Log., 57:682\u2013687, 1992.","journal-title":"J. Symb. Log."},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"M. Kummer, F. Stephan. Inclusion problems in parallel learning and games. Proceedings COLT'94, pp. 287\u2013298, ACM Press, 1994.","DOI":"10.1145\/180139.181156"},{"issue":"2","key":"10_CR19","first-page":"55","volume":"13","author":"D. McDermott","year":"1992","unstructured":"D. McDermott. Robot planning. AI Magazine, 13(2):55\u201379, 1992.","journal-title":"AI Magazine"},{"key":"10_CR20","volume-title":"Classical recursion theory","author":"P. Odifreddi","year":"1989","unstructured":"P. Odifreddi. Classical recursion theory. North-Holland, Amsterdam, 1989."},{"key":"10_CR21","doi-asserted-by":"crossref","first-page":"761","DOI":"10.2307\/2274739","volume":"54","author":"J. C. Owings Jr.","year":"1989","unstructured":"J. C. Owings, Jr. A cardinality version of Beigel's nonspeedup theorem. J. Symb. Log., 54:761\u2013767, 1989.","journal-title":"J. Symb. Log."},{"key":"10_CR22","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1145\/62044.62053","volume":"36","author":"L. Pitt","year":"1989","unstructured":"L. Pitt. Probabilistic inductive inference. J. of the ACM, 36:383\u2013433, 1989.","journal-title":"J. of the ACM"},{"key":"10_CR23","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0890-5401(88)90046-6","volume":"77","author":"L. Pitt","year":"1988","unstructured":"L. Pitt, C. H. Smith. Probability and plurality for aggregations of learning machines. Information and Computation, 77:77\u201392, 1988.","journal-title":"Information and Computation"},{"key":"10_CR24","unstructured":"G. F. Rose. An extended notion of computability. In Abstr. Intern. Congr. for Logic, Meth., and Phil. of Science, Stanford, California, 1960."},{"key":"10_CR25","doi-asserted-by":"crossref","first-page":"1144","DOI":"10.1145\/322344.322356","volume":"29","author":"C. H. Smith","year":"1982","unstructured":"C. H. Smith. The power of pluralism for automatic program synthesis. Journal of the ACM, 29:1144\u20131165, 1982.","journal-title":"Journal of the ACM"},{"key":"10_CR26","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02460-7","volume-title":"Recursively enumerable sets and degrees","author":"R. I. Soare","year":"1987","unstructured":"R. I. Soare. Recursively enumerable sets and degrees. Springer-Verlag, Berlin, 1987."},{"key":"10_CR27","first-page":"25","volume":"2","author":"B. A. Trakhtenbrot","year":"1963","unstructured":"B. A. Trakhtenbrot. On frequency computation of functions. Algebra i Logika, 2:25\u201332, 1963. (Russian)","journal-title":"Algebra i Logika"}],"container-title":["Lecture Notes in Computer Science","Computational Learning Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59119-2_174","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:42:58Z","timestamp":1742596978000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59119-2_174"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540591191","9783540491958"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-59119-2_174","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]},"assertion":[{"value":"1 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}