{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T12:06:46Z","timestamp":1759147606207},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642030727"},{"type":"electronic","value":"9783642030734"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03073-4_29","type":"book-chapter","created":{"date-parts":[[2009,7,14]],"date-time":"2009-07-14T08:06:17Z","timestamp":1247558777000},"page":"280-289","source":"Crossref","is-referenced-by-count":15,"title":["Ordinal Computability"],"prefix":"10.1007","author":[{"given":"Peter","family":"Koepke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","volume-title":"Perspectives in Mathematical Logic","author":"N.J. Cutland","year":"1980","unstructured":"Cutland, N.J.: Computability: An Introduction to Recursive Function Theory. In: Perspectives in Mathematical Logic. Cambridge University Press, Cambridge (1980)"},{"issue":"2","key":"29_CR2","doi-asserted-by":"publisher","first-page":"567","DOI":"10.2307\/2586556","volume":"65","author":"J.D. Hamkins","year":"2000","unstructured":"Hamkins, J.D., Lewis, A.: Infinite Time Turing Machines. J. Symbolic Logic\u00a065(2), 567\u2013604 (2000)","journal-title":"J. Symbolic Logic"},{"key":"29_CR3","unstructured":"Irrgang, B., Seyfferth, B.: Multitape ordinal machines and primitive recursion. In: Beckmann, A., et al. (eds.) Logic and Theory of Algorithms - CiE 2008 - Local Proceedings, pp. 175\u2013184. University of Athens (2008)"},{"issue":"3","key":"29_CR4","doi-asserted-by":"publisher","first-page":"377","DOI":"10.2178\/bsl\/1122038993","volume":"11","author":"P. Koepke","year":"2005","unstructured":"Koepke, P.: Turing computations on ordinals. Bull. Symbolic Logic\u00a011(3), 377\u2013397 (2005)","journal-title":"Bull. Symbolic Logic"},{"key":"29_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/11780342_27","volume-title":"Logical Approaches to Computational Barriers","author":"P. Koepke","year":"2006","unstructured":"Koepke, P.: Infinite Time Register Machines. In: Beckmann, A., Berger, U., L\u00f6we, B., Tucker, J.V., et al. (eds.) CiE 2006. LNCS, vol.\u00a03988, pp. 257\u2013266. Springer, Heidelberg (2006)"},{"key":"29_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-540-69407-6_34","volume-title":"Logic and Theory of Algorithms","author":"P. Koepke","year":"2008","unstructured":"Koepke, P., Miller, R.: An enhanced theory of Infinite Time Register Machines. In: Beckmann, A., Dimitracopoulos, C., L\u00f6we, B. (eds.) CiE 2008. LNCS, vol.\u00a05028, pp. 306\u2013315. Springer, Heidelberg (2008)"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Koepke, P., Seyfferth, B.: Ordinal machines and admissible recursion theory. Annals of Pure and Applied Logic (2009) (in print)","DOI":"10.1016\/j.apal.2009.01.005"},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/s00153-008-0093-3","volume":"47","author":"P. Koepke","year":"2008","unstructured":"Koepke, P., Siders, R.: Register computations on ordinals. Archive for Mathematical Logic\u00a047, 529\u2013548 (2008)","journal-title":"Archive for Mathematical Logic"},{"key":"29_CR9","volume-title":"Perspectives in Mathematical Logic","author":"S.G. Simpson","year":"1999","unstructured":"Simpson, S.G.: Subsystems of Second Order Arithmetic. In: Perspectives in Mathematical Logic. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Theory and Computational Practice"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03073-4_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T12:33:36Z","timestamp":1558442016000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03073-4_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642030727","9783642030734"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03073-4_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}