{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:50:15Z","timestamp":1743094215038,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319587400"},{"type":"electronic","value":"9783319587417"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-58741-7_20","type":"book-chapter","created":{"date-parts":[[2017,5,11]],"date-time":"2017-05-11T12:59:28Z","timestamp":1494507568000},"page":"198-209","source":"Crossref","is-referenced-by-count":0,"title":["The Recognizability Strength of Infinite Time Turing Machines with Ordinal Parameters"],"prefix":"10.1007","author":[{"given":"Merlin","family":"Carl","sequence":"first","affiliation":[]},{"given":"Philipp","family":"Schlicht","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,12]]},"reference":[{"issue":"9","key":"20_CR1","doi-asserted-by":"crossref","first-page":"1403","DOI":"10.1016\/j.apal.2014.04.010","volume":"165","author":"M Carl","year":"2014","unstructured":"Carl, M.: The distribution of \n            \n$$ITRM$$\n\n          -recognizable reals. Ann. Pure Appl. Logic 165(9), 1403\u20131417 (2014)","journal-title":"Ann. Pure Appl. Logic"},{"key":"20_CR2","unstructured":"Carl, M.: The lost melody phenomenon. In: Infinity, computability, and metamathematics, vol. 23 of Tributes, pp. 49\u201370. College Publications, London (2014)"},{"issue":"4","key":"20_CR3","doi-asserted-by":"crossref","first-page":"1116","DOI":"10.1017\/jsl.2015.8","volume":"80","author":"M Carl","year":"2015","unstructured":"Carl, M.: Optimal results on recognizability for infinite time register machines. J. Symb. Log. 80(4), 1116\u20131130 (2015)","journal-title":"J. Symb. Log."},{"issue":"2","key":"20_CR4","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1215\/00294527-1306199","volume":"52","author":"S Coskey","year":"2011","unstructured":"Coskey, S., Hamkins, J.D.: Infinite time decidable equivalence relation theory. Notre Dame J. Formal Log. 52(2), 203\u2013228 (2011)","journal-title":"Notre Dame J. Formal Log."},{"key":"20_CR5","unstructured":"Carl, M., Schlicht, P.: Randomness via infinite time machines and effective descriptive set theory (2016). Submitted"},{"key":"20_CR6","unstructured":"Carl, M., Schlicht, P., Welch, P.: Recognizable sets and Woodin cardinals (2016). Submitted"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-642-39053-1_27","volume-title":"The Nature of Computation. Logic, Algorithms, Applications","author":"ME Habi\u010d","year":"2013","unstructured":"Habi\u010d, M.E.: Cardinal-recognizing infinite time turing machines. In: Bonizzoni, P., Brattka, V., L\u00f6we, B. (eds.) CiE 2013. LNCS, vol. 7921, pp. 231\u2013240. Springer, Heidelberg (2013). doi:\n10.1007\/978-3-642-39053-1_27"},{"issue":"2","key":"20_CR8","doi-asserted-by":"crossref","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. Symbolic Log. 65(2), 567\u2013604 (2000)","journal-title":"J. Symbolic Log."},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Welch, P.D.: Minimality arguments for infinite time turing degrees. In: Sets and proofs (Leeds 1997). London Mathematical Society Lecture Note Series, vol. 258, pp. 425\u2013436. Cambridge University Press, Cambridge (1999)","DOI":"10.1017\/CBO9781107325944.018"},{"issue":"4\u20135","key":"20_CR10","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1016\/j.tcs.2008.09.050","volume":"410","author":"PD Welch","year":"2009","unstructured":"Welch, P.D.: Characteristics of discrete transfinite time Turing machine models: halting times, stabilization times, and normal form theorems. Theoret. Comput. Sci. 410(4\u20135), 426\u2013442 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Welch, P.D.: Transfinite machine models. In: Turing\u2019s Legacy: Developments from Turing\u2019s Ideas in Logic. Lecture Notes in Logic, vol. 42, pp. 493\u2013529. Association Symbolic Logic, La Jolla, CA (2014)","DOI":"10.1017\/CBO9781107338579.015"},{"key":"20_CR12","series-title":"De Gruyter Series in Logic and its Applications","volume-title":"Inner Models and Large Cardinals","author":"M Zeman","year":"2012","unstructured":"Zeman, M.: Inner Models and Large Cardinals. De Gruyter Series in Logic and its Applications, vol. 5. Walter de Gruyter & Co., Berlin (2012)"}],"container-title":["Lecture Notes in Computer Science","Unveiling Dynamics and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-58741-7_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,31]],"date-time":"2017-08-31T09:02:37Z","timestamp":1504170157000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-58741-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319587400","9783319587417"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-58741-7_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}