{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:20:52Z","timestamp":1743128452439,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540752240"},{"type":"electronic","value":"9783540752257"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-75225-7_7","type":"book-chapter","created":{"date-parts":[[2007,10,10]],"date-time":"2007-10-10T12:46:43Z","timestamp":1192020403000},"page":"34-48","source":"Crossref","is-referenced-by-count":4,"title":["Feasible Iteration of Feasible Learning Functionals"],"prefix":"10.1007","author":[{"given":"John","family":"Case","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timo","family":"K\u00f6tzing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Todd","family":"Paddock","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"287","DOI":"10.2178\/jsl\/1080938842","volume":"69","author":"A. Ambainis","year":"2004","unstructured":"Ambainis, A., Case, J., Jain, S., Suraj, M.: Parsimony hierarchies for inductive inference. Journal of Symbolic Logic\u00a069, 287\u2013328 (2004)","journal-title":"Journal of Symbolic Logic"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Case, J., Paddock, T., K\u00f6tzing, T.: Feasible iteration of feasible learning functionals (expanded version). Technical report, University of Delaware (2007), At http:\/\/www.cis.udel.edu\/~case\/papers\/FeasibleLearningTR.pdf and contains complete proofs","DOI":"10.1007\/978-3-540-75225-7_7"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Downey, R., Fellows, M.: Parameterized Complexity. In: Downey, R., Fellows, M. (eds.) Monographs in Computer Science. Springer, Heidelberg (1998)","DOI":"10.1007\/978-1-4612-0515-9"},{"issue":"3","key":"7_CR4","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/S0895480199353895","volume":"14","author":"D. Dor","year":"2001","unstructured":"Dor, D., Zwick, U.: Median selection requires (2\u2009+\u2009\u03b5)n comparisons. SIAM Journal on Discrete Mathematics\u00a014(3), 312\u2013325 (2001)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"2","key":"7_CR5","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1006\/inco.1993.1068","volume":"107","author":"R. Freivalds","year":"1993","unstructured":"Freivalds, R., Smith, C.: On the role of procrastination in machine learning. Information and Computation\u00a0107(2), 237\u2013271 (1993)","journal-title":"Information and Computation"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1017\/S0956796800003841","volume":"11","author":"R. Irwin","year":"2001","unstructured":"Irwin, R., Kapron, B., Royer, J.: On characterizations of the basic feasible functional, Part I. Journal of Functional Programming\u00a011, 117\u2013153 (2001)","journal-title":"Journal of Functional Programming"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Jain, S., Osherson, D., Royer, J., Sharma, A.: Systems that Learn: An Introduction to Learning Theory. 2nd edn. MIT Press, Cambridge (1999)","DOI":"10.7551\/mitpress\/6610.001.0001"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1137\/S0097539794263452","volume":"25","author":"B. Kapron","year":"1996","unstructured":"Kapron, B., Cook, S.: A new characterization of type 2 feasibility. SIAM Journal on Computing\u00a025, 117\u2013132 (1996)","journal-title":"SIAM Journal on Computing"},{"key":"7_CR9","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3897.001.0001","volume-title":"An Introduction to Computational Learning Theory","author":"M. Kearns","year":"1994","unstructured":"Kearns, M., Vazirani, U.: An Introduction to Computational Learning Theory. MIT Press, Cambridge (1994)"},{"key":"7_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2606-0","volume-title":"An Introduction to Kolmogorov Complexity and Its Applications","author":"M. Li","year":"1997","unstructured":"Li, M., Vitanyi, P.: An Introduction to Kolmogorov Complexity and Its Applications, 2nd edn. Springer, Heidelberg (1997)","edition":"2"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0022-0000(76)80035-9","volume":"12","author":"K. Mehlhorn","year":"1976","unstructured":"Mehlhorn, K.: Polynomial and abstract subrecursive classes. Journal of Computer and System Sciences\u00a012, 147\u2013178 (1976)","journal-title":"Journal of Computer and System Sciences"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Royer, J., Case, J.: Subrecursive Programming Systems: Complexity and Succinctness. Research monograph in Progress in Theoretical Computer Science. Birkh\u00e4user\u00a0Boston (1994)","DOI":"10.1007\/978-1-4612-0249-3"},{"key":"7_CR13","unstructured":"Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw Hill, New York, 1967. MIT Press (reprinted, 1987)"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Reischuk, R., Zeugmann, T.: An average-case optimal one-variable pattern language learner. Journal of Computer and System Sciences, Special Issue for COLT 1998, 60(2), 302\u2013335 (2000),","DOI":"10.1006\/jcss.1999.1669"},{"key":"7_CR15","unstructured":"Sierpinski, W.: Cardinal and ordinal numbers. Second revised edn. PWN \u2013Polish Scientific Publishers (1965)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75225-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,25]],"date-time":"2021-08-25T15:16:52Z","timestamp":1629904612000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75225-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540752240","9783540752257"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75225-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}