{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T15:47:12Z","timestamp":1725983232831},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319944173"},{"type":"electronic","value":"9783319944180"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-94418-0_13","type":"book-chapter","created":{"date-parts":[[2018,7,4]],"date-time":"2018-07-04T12:38:26Z","timestamp":1530707906000},"page":"126-135","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Taming Koepke\u2019s Zoo"],"prefix":"10.1007","author":[{"given":"Merlin","family":"Carl","sequence":"first","affiliation":[]},{"given":"Sabrina","family":"Ouazzani","sequence":"additional","affiliation":[]},{"given":"Philip","family":"Welch","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,3]]},"reference":[{"key":"13_CR1","unstructured":"Friedman, S., Welch, P.: Two observations concerning infinite time Turing machines. In: Dimitriou, I. (ed.) BIWOC Report, pp. 44\u201347. Hausdorff Centre for Mathematics, Bonn (2007)"},{"issue":"2","key":"13_CR2","doi-asserted-by":"publisher","first-page":"567","DOI":"10.2307\/2586556","volume":"65","author":"JD Hamkins","year":"2000","unstructured":"Hamkins, J.D., Lewis, A.: Infinite time turing machines. J. Symb. Log. 65(2), 567\u2013604 (2000)","journal-title":"J. Symb. Log."},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0003-4843(72)90001-0","volume":"4","author":"R Jensen","year":"1972","unstructured":"Jensen, R.: The fine structure of the constructible hierarchy. Ann. Math. Log. 4, 229\u2013308 (1972)","journal-title":"Ann. Math. Log."},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/11494645_28","volume-title":"New Computational Paradigms","author":"P Koepke","year":"2005","unstructured":"Koepke, P.: Computing a model of set theory. In: Cooper, S.B., L\u00f6we, B., Torenvliet, L. (eds.) CiE 2005. LNCS, vol. 3526, pp. 223\u2013232. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11494645_28"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-642-03073-4_29","volume-title":"Mathematical Theory and Computational Practice","author":"P Koepke","year":"2009","unstructured":"Koepke, P.: Ordinal computability. In: Ambos-Spies, K., L\u00f6we, B., Merkle, W. (eds.) CiE 2009. LNCS, vol. 5635, pp. 280\u2013289. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-03073-4_29"},{"key":"13_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. 5028, pp. 306\u2013315. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-69407-6_34"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/11780342_27","volume-title":"Logical Approaches to Computational Barriers","author":"Peter Koepke","year":"2006","unstructured":"Koepke, P., Syders, R.: Computing the recursive truth predicate on ordinal register machines. In: Beckmann, A., et al. (eds.) Logical Approaches to Computational Barriers. Computer Science Report Series, Swansea, vol. 7, pp. 160\u2013169 (2006)"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/j.apal.2009.01.005","volume":"160","author":"P Koepke","year":"2009","unstructured":"Koepke, P., Seyfferth, B.: Ordinal machines and admissible recursion theory. Ann. Pure Appl. Log. 160, 310\u2013318 (2009)","journal-title":"Ann. Pure Appl. Log."},{"issue":"9","key":"13_CR9","doi-asserted-by":"publisher","first-page":"1501","DOI":"10.1016\/j.apal.2014.04.016","volume":"165","author":"B Rin","year":"2014","unstructured":"Rin, B.: The computational strengths of $$\\alpha $$-tape infinite time turing machines. Ann. Pure Appl. Log. 165(9), 1501\u20131511 (2014)","journal-title":"Ann. Pure Appl. Log."},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1007\/978-1-4020-5764-9_10","volume-title":"Handbook of Set Theory","author":"R Schindler","year":"2010","unstructured":"Schindler, R., Zeman, M.: Fine structure. In: Foreman, M., Kanamori, A. (eds.) Handbook of Set Theory, pp. 605\u2013656. Springer, Dordrecht (2010). \nhttps:\/\/doi.org\/10.1007\/978-1-4020-5764-9_10"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1016\/j.tcs.2008.09.050","volume":"410","author":"P Welch","year":"2009","unstructured":"Welch, P.: Characteristics of discrete transfinite time turing machine models: halting times, stabilization times, and normal form theorems. Theoret. Comput. Sci. 410, 426\u2013442 (2009)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"13_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S1755020313000361","volume":"7","author":"P Welch","year":"2014","unstructured":"Welch, P.: Some observations on truth hierarchies. Rev. Symb. Log. 7(1), 1\u201330 (2014)","journal-title":"Rev. Symb. Log."},{"issue":"2","key":"13_CR13","doi-asserted-by":"publisher","first-page":"418","DOI":"10.2178\/jsl\/1305810756","volume":"76","author":"P Welch","year":"2011","unstructured":"Welch, P.: Weak systems of determinacy and arithmetical quasi-inductive definitions. J. Symb. Log. 76(2), 418\u2013436 (2011)","journal-title":"J. Symb. Log."}],"container-title":["Lecture Notes in Computer Science","Sailing Routes in the World of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94418-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,7,4]],"date-time":"2018-07-04T12:45:25Z","timestamp":1530708325000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-94418-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319944173","9783319944180"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94418-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}