{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:13:15Z","timestamp":1725487995765},"publisher-location":"Berlin, Heidelberg","reference-count":44,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540730002"},{"type":"electronic","value":"9783540730019"}],"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-73001-9_12","type":"book-chapter","created":{"date-parts":[[2007,7,24]],"date-time":"2007-07-24T15:16:31Z","timestamp":1185290191000},"page":"115-124","source":"Crossref","is-referenced-by-count":0,"title":["Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems"],"prefix":"10.1007","author":[{"given":"John","family":"Case","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_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":"12_CR2","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1002\/malq.19960420138","volume":"42","author":"C. Ash","year":"1996","unstructured":"Ash, C., Knight, J.: Recursive structures and Eshov\u2019s hierarchy. Mathematical Logic Quarterly\u00a042, 461\u2013468 (1996)","journal-title":"Mathematical Logic Quarterly"},{"doi-asserted-by":"crossref","unstructured":"Baliga, G., Case, J., Merkle, W., Stephan, F., Wiehagen, W.: When unlearning helps, Journal submission (2007)","key":"12_CR3","DOI":"10.1016\/j.ic.2007.10.005"},{"key":"12_CR4","first-page":"82","volume":"210","author":"J. [ERROR while converting LaTeX\/Unico","year":"1974","unstructured":"B\u0101rzdi\u0146\u0161, J.: Two theorems on the limiting synthesis of functions. Theory of Algorithms and Programs, Latvian State University, Riga.\u00a0210, 82\u201388 (1974)","journal-title":"Theory of Algorithms and Programs, Latvian State University, Riga"},{"key":"12_CR5","first-page":"101","volume":"210","author":"J. [ERROR while converting LaTeX\/Unico","year":"1974","unstructured":"B\u0101rzdi\u0146\u0161, J., Freivalds, R.: Prediction and limiting synthesis of recursively enumerable classes of functions. Latvijas Valsts Univ.\u00a0Zinatn.\u00a0Raksti\u00a0210, 101\u2013111 (1974)","journal-title":"Latvijas Valsts Univ.\u00a0Zinatn.\u00a0Raksti"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"1411","DOI":"10.1137\/S0097539796300921","volume":"26","author":"E. Bernstein","year":"1997","unstructured":"Bernstein, E., Vazirani, U.: Quantum complexity theory. SIAM Journal on Computing\u00a026, 1411\u20131473 (1997)","journal-title":"SIAM Journal on Computing"},{"key":"12_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/11564089_20","volume-title":"Algorithmic Learning Theory (ALT\u201905)","author":"L. Carlucci","year":"2005","unstructured":"Carlucci, L., Case, J., Jain, S., Stephan, F.: Non\u00a0U-shaped vacillatory and team learning. In: Jain, S., Simon, H.U., Tomita, E. (eds.) ALT 2005. LNCS (LNAI), vol.\u00a03734, pp. 241\u2013255. Springer, Heidelberg (2005)"},{"key":"12_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/11776420_20","volume-title":"Learning Theory (COLT\u201906)","author":"L. Carlucci","year":"2006","unstructured":"Carlucci, L., Case, J., Jain, S., Stephan, F.: Memory-limited U-shaped learning. In: Lugosi, G., Simon, H. (eds.) COLT 2006. LNCS (LNAI), vol.\u00a04005, pp. 244\u2013258. Springer, Heidelberg (2006)"},{"issue":"6","key":"12_CR9","doi-asserted-by":"publisher","first-page":"1941","DOI":"10.1137\/S0097539793249694","volume":"28","author":"J. Case","year":"1999","unstructured":"Case, J.: The power of vacillation in language learning. SIAM Journal on Computing\u00a028(6), 1941\u20131969 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.apal.2005.06.013","volume":"139","author":"J. Case","year":"2006","unstructured":"Case, J., Chen, K., Jain, S., Merkle, W., Royer, J.: Generality\u2019s price: Inescapable deficiencies in machine-learned programs. Annals of Pure. and Applied Logic\u00a0139, 303\u2013326 (2006)","journal-title":"Annals of Pure and Applied Logic"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1006\/inco.1998.2784","volume":"152","author":"J. Case","year":"1999","unstructured":"Case, J., Jain, S., Lange, S., Zeugmann, T.: Incremental concept learning for bounded data mining. Information and Computation\u00a0152, 74\u2013110 (1999)","journal-title":"Information and Computation"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BFb0012761","volume-title":"Automata, Languages, and Programming","author":"J. Case","year":"1982","unstructured":"Case, J., Lynes, C.: Machine inductive inference and language identification. In: Nielsen, M., Schmidt, E.M. (eds.) Automata, Languages, and Programming. LNCS, vol.\u00a0140, pp. 107\u2013115. Springer, Heidelberg (1982)"},{"doi-asserted-by":"crossref","unstructured":"Case, J., Moelius, S.: U-shaped, iterative, and iterative-with-counter learning (2007) (Submitted)","key":"12_CR13","DOI":"10.1007\/978-3-540-72927-3_14"},{"doi-asserted-by":"crossref","unstructured":"Case, J., Paddock, T., K\u00f6tzing, T.: Feasible iteration of feasible learning functionals, Work in progress (2007)","key":"12_CR14","DOI":"10.1007\/978-3-540-75225-7_7"},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0304-3975(83)90061-0","volume":"25","author":"J. Case","year":"1983","unstructured":"Case, J., Smith, C.: Comparison of identification criteria for machine inductive inference. Theoretical Computer Science\u00a025, 193\u2013220 (1983)","journal-title":"Theoretical Computer Science"},{"key":"12_CR16","volume-title":"Introduction to Algorithms","author":"T. Cormen","year":"2001","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge, MA (2001)","edition":"2"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/S0019-9958(86)80042-0","volume":"69","author":"R. Daley","year":"1986","unstructured":"Daley, R., Smith, C.: On the complexity of inductive inference. Information and Control\u00a069, 12\u201340 (1986)","journal-title":"Information and Control"},{"key":"12_CR18","volume-title":"Monographs in Computer Science","author":"R. Downey","year":"1998","unstructured":"Downey, R., Fellows, M.: Parameterized Complexity. In: Monographs in Computer Science, Springer, Heidelberg (1998)"},{"doi-asserted-by":"crossref","unstructured":"Ershov, Y.: A hierarchy of sets, I. Algebra i Logika, 7(1):47\u201374, 1968. In Russian (English translation in Algebra and Logic, 7:25\u201343 1968) (1968)","key":"12_CR19","DOI":"10.1007\/BF02218750"},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/BF02218664","volume":"7","author":"Y. Ershov","year":"1968","unstructured":"Ershov, Y.: A hierarchy of sets II. Algebra and Logic\u00a07, 212\u2013232 (1968)","journal-title":"Algebra and Logic"},{"issue":"2","key":"12_CR21","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"},{"issue":"3","key":"12_CR22","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1016\/S0022-0000(05)80072-8","volume":"49","author":"M. Fulk","year":"1994","unstructured":"Fulk, M., Jain, S., Osherson, D.: Open problems in Systems That Learn. Journal of Computer and System Sciences\u00a049(3), 589\u2013604 (1994)","journal-title":"Journal of Computer and System Sciences"},{"key":"12_CR23","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E. Gold","year":"1967","unstructured":"Gold, E.: Language identification in the limit. Information and Control\u00a010, 447\u2013474 (1967)","journal-title":"Information and Control"},{"key":"12_CR24","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1090\/S0002-9947-1965-0170805-7","volume":"117","author":"J. Hartmanis","year":"1965","unstructured":"Hartmanis, J., Stearns, R.: On the computational complexity of algorithms. Transactions of the American Mathematical Society\u00a0117, 285\u2013306 (1965)","journal-title":"Transactions of the American Mathematical Society"},{"key":"12_CR25","volume-title":"Introduction to Numerical Analysis","author":"F. Hildebrand","year":"1956","unstructured":"Hildebrand, F.: Introduction to Numerical Analysis. McGraw-Hill, New York (1956)"},{"key":"12_CR26","volume-title":"Introduction to Automata Theory Languages and Computation","author":"J. Hopcroft","year":"1979","unstructured":"Hopcroft, J., Ullman, J.: Introduction to Automata Theory Languages and Computation. Addison-Wesley Publishing Company, London, UK (1979)"},{"key":"12_CR27","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":"12_CR28","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6610.001.0001","volume-title":"Systems that Learn: An Introduction to Learning Theory","author":"S. Jain","year":"1999","unstructured":"Jain, S., Osherson, D., Royer, J., Sharma, A.: Systems that Learn: An Introduction to Learning Theory, 2nd edn. MIT Press, Cambridge, MA (1999)","edition":"2"},{"key":"12_CR29","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1006\/inco.1996.2614","volume":"132","author":"S. Jain","year":"1997","unstructured":"Jain, S., Sharma, A.: Elementary formal systems, intrinsic complexity, and procrastination. Information and Computation\u00a0132, 65\u201384 (1997)","journal-title":"Information and Computation"},{"key":"12_CR30","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":"12_CR31","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, MA (1994)"},{"key":"12_CR32","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1006\/inco.1995.1170","volume":"123","author":"E. Kinber","year":"1995","unstructured":"Kinber, E., Stephan, F.: Language learning from texts: Mind changes, limited memory and monotonicity. Information and Computation\u00a0123, 224\u2013241 (1995)","journal-title":"Information and Computation"},{"key":"12_CR33","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1006\/jcss.1996.0051","volume":"53","author":"S. Lange","year":"1996","unstructured":"Lange, S., Zeugmann, T.: Incremental learning from positive data. Journal of Computer and System Sciences\u00a053, 88\u2013103 (1996)","journal-title":"Journal of Computer and System Sciences"},{"key":"12_CR34","volume-title":"Monographs of the Society for Research in Child Development, (Includes commentary by H. Clahsen)","author":"G. Marcus","year":"1992","unstructured":"Marcus, G., Pinker, S., Ullman, M., Hollander, M., Rosen, T.J., Xu, F.: Overregularization in Language Acquisition. In: Monographs of the Society for Research in Child Development (Includes commentary by H. Clahsen), vol.\u00a057(4), University of Chicago Press, Chicago (1992)"},{"key":"12_CR35","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":"12_CR36","volume-title":"Classical Recursion Theory, volume II.","author":"P. Odifreddi","year":"1999","unstructured":"Odifreddi, P.: Classical Recursion Theory, volume II. Elsivier, Amsterdam (1999)"},{"issue":"1","key":"12_CR37","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0010-0277(91)90022-V","volume":"86","author":"K. Plunkett","year":"1991","unstructured":"Plunkett, K., Marchman, V.: U-shaped learning and frequency effects in a multi-layered perceptron: implications for child language acquisition. Cognition\u00a086(1), 43\u2013102 (1991)","journal-title":"Cognition"},{"issue":"2","key":"12_CR38","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1006\/jcss.1999.1669","volume":"60","author":"R. Reischuk","year":"2000","unstructured":"Reischuk, R., Zeugmann, T.: An average-case optimal one-variable pattern language learner. Journal of Computer and System Sciences (Special Issue for COLT\u201998)\u00a060(2), 302\u2013335 (2000)","journal-title":"Journal of Computer and System Sciences, (Special Issue for COLT\u201998)"},{"unstructured":"Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw Hill, New York, 1967. Reprinted, MIT Press (1987)","key":"12_CR39"},{"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 Boston (1994)","key":"12_CR40","DOI":"10.1007\/978-1-4612-0249-3"},{"unstructured":"Sipser, M.: Private communication (1978)","key":"12_CR41"},{"volume-title":"U-Shaped Behavioral Growth","year":"1982","unstructured":"Strauss, S., Stavy, R. (eds.): U-Shaped Behavioral Growth. Academic Press, NY (1982)","key":"12_CR42"},{"issue":"2","key":"12_CR43","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0010-0277(02)00176-2","volume":"86","author":"N. Taatgen","year":"2002","unstructured":"Taatgen, N., Anderson, J.: Why do children learn to say broke? A model of learning the past tense without feedback. Cognition\u00a086(2), 123\u2013155 (2002)","journal-title":"Cognition"},{"key":"12_CR44","first-page":"93","volume":"12","author":"R. Wiehagen","year":"1976","unstructured":"Wiehagen, R.: Limes-erkennung rekursiver funktionen durch spezielle strategien. Electronische Informationverarbeitung und Kybernetik\u00a012, 93\u201399 (1976)","journal-title":"Electronische Informationverarbeitung und Kybernetik"}],"container-title":["Lecture Notes in Computer Science","Computation and Logic in the Real World"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73001-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,20]],"date-time":"2021-08-20T09:30:16Z","timestamp":1629451816000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73001-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540730002","9783540730019"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73001-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}