{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T06:43:17Z","timestamp":1765608197787},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540879862"},{"type":"electronic","value":"9783540879879"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87987-9_32","type":"book-chapter","created":{"date-parts":[[2009,3,17]],"date-time":"2009-03-17T11:20:06Z","timestamp":1237288806000},"page":"389-403","source":"Crossref","is-referenced-by-count":5,"title":["Dynamically Delayed Postdictive Completeness and Consistency in Learning"],"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"}]}],"member":"297","reference":[{"key":"32_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":"32_CR2","unstructured":"Akama, Y., Zeugmann, T.: Consistent and coherent learning with \u03b4-delay. Technical Report TCS-TR-A-07-29, Hokkaido Univ. (October 2007)"},{"key":"32_CR3","unstructured":"B\u0101rzdi\u0146\u0161, J.: Inductive inference of automata, functions and programs. In: Int.\u00a0Math.\u00a0Congress, Vancouver, pp. 771\u2013776 (1974)"},{"key":"32_CR4","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0019-9958(75)90261-2","volume":"28","author":"L. Blum","year":"1975","unstructured":"Blum, L., Blum, M.: Toward a mathematical theory of inductive inference. Information and Control\u00a028, 125\u2013155 (1975)","journal-title":"Information and Control"},{"key":"32_CR5","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF01761704","volume":"8","author":"J. Case","year":"1974","unstructured":"Case, J.: Periodicity in generations of automata. Mathematical Systems Theory\u00a08, 15\u201332 (1974)","journal-title":"Mathematical Systems Theory"},{"key":"32_CR6","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.jcss.2003.10.005","volume":"69","author":"J. Case","year":"2004","unstructured":"Case, J., Jain, S., Stephan, F., Wiehagen, R.: Robust learning \u2013 rich and poor. Journal of Computer and System Sciences\u00a069, 123\u2013165 (2004)","journal-title":"Journal of Computer and System Sciences"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Case, J., K\u00f6tzing, T.: Dynamically delayed postdictive completeness and consistency in machine inductive inference (2008), http:\/\/www.cis.udel.edu\/~case\/papers\/PcpPcsDelayTR.pdf","DOI":"10.1007\/978-3-540-87987-9_32"},{"key":"32_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-540-75225-7_7","volume-title":"Algorithmic Learning Theory","author":"J. Case","year":"2007","unstructured":"Case, J., K\u00f6tzing, T., Paddock, T.: Feasible iteration of feasible learning functionals. In: Hutter, M., Servedio, R.A., Takimoto, E. (eds.) ALT 2007. LNCS (LNAI), vol.\u00a04754, pp. 34\u201348. Springer, Heidelberg (2007)"},{"issue":"2","key":"32_CR9","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":"32_CR10","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0890-5401(88)90019-3","volume":"79","author":"M. Fulk","year":"1988","unstructured":"Fulk, M.: Saving the phenomena: Requirements that inductive machines not contradict known data. Inform. and Comp.\u00a079, 193\u2013209 (1988)","journal-title":"Inform. and Comp."},{"key":"32_CR11","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 (1999)","edition":"2"},{"key":"32_CR12","doi-asserted-by":"crossref","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":"32_CR13","doi-asserted-by":"crossref","unstructured":"Minicozzi, E.: Some natural properties of strong identification in inductive inference. In: Theoretical Computer Science, pp. 345\u2013360 (1976)","DOI":"10.1016\/0304-3975(76)90087-6"},{"key":"32_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1007\/3-540-51734-0_50","volume-title":"Analogical and Inductive Inference","author":"L. Pitt","year":"1989","unstructured":"Pitt, L.: Inductive inference, DFAs, and computational complexity. In: Jantke, K.P. (ed.) AII 1989. LNCS, vol.\u00a0397, pp. 18\u201344. Springer, Heidelberg (1989)"},{"key":"32_CR15","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers","year":"1967","unstructured":"Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw Hill, New York (1967) (Reprinted by MIT Press, Cambridge, Massachusetts, 1987)"},{"key":"32_CR16","doi-asserted-by":"crossref","unstructured":"Royer, J., Case, J.: Subrecursive Programming Systems. In: Progress in Theoretical Computer Science, Birkh\u00e4user (1994)","DOI":"10.1007\/978-1-4612-0249-3"},{"key":"32_CR17","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/j.ic.2003.11.001","volume":"189","author":"A. Sharma","year":"2004","unstructured":"Sharma, A., Stephan, F., Ventsov, Y.: Generalized notions of mind change complexity. Information and Computation\u00a0189, 235\u2013262 (2004)","journal-title":"Information and Computation"},{"key":"32_CR18","first-page":"93","volume":"12","author":"R. Wiehagen","year":"1976","unstructured":"Wiehagen, R.: Limes-erkennung rekursiver Funktionen durch spezielle Strategien. Elek. Informationverarbeitung und Kyb.\u00a012, 93\u201399 (1976)","journal-title":"Elek. Informationverarbeitung und Kyb."},{"key":"32_CR19","unstructured":"Wiehagen, R.: Zur Theorie der Algorithmischen Erkennung. Dissertation\u00a0B. Humboldt University of Berlin (1978)"}],"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-87987-9_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:07:33Z","timestamp":1606183653000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-87987-9_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540879862","9783540879879"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87987-9_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}