{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T19:49:28Z","timestamp":1785440968243,"version":"3.56.0"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642308697","type":"print"},{"value":"9783642308703","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30870-3_41","type":"book-chapter","created":{"date-parts":[[2012,5,28]],"date-time":"2012-05-28T02:56:12Z","timestamp":1338173772000},"page":"405-415","source":"Crossref","is-referenced-by-count":7,"title":["Towards a Theory of Infinite Time Blum-Shub-Smale Machines"],"prefix":"10.1007","author":[{"given":"Peter","family":"Koepke","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Benjamin","family":"Seyfferth","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"1","key":"41_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/S0273-0979-1989-15750-9","volume":"21","author":"L. Blum","year":"1989","unstructured":"Blum, L., Shub, M., Smale, S.: On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Bulletin of the American Mathematical Society\u00a021(1), 1\u201346 (1989)","journal-title":"Bulletin of the American Mathematical Society"},{"key":"41_CR2","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1142\/9789812704979_0005","volume-title":"Words, Languages and Combinatorics III","author":"V. Brattka","year":"2003","unstructured":"Brattka, V.: The emperors new recursiveness: The epigraph of the exponential funciton in two models of computability. In: Ito, M., Imaoka, T. (eds.) Words, Languages and Combinatorics III, pp. 63\u201372. World Scientific Publishing, Singapore (2003)"},{"issue":"2","key":"41_CR3","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s00153-009-0167-x","volume":"49","author":"M. Carl","year":"2010","unstructured":"Carl, M., Fischbach, T., Koepke, P., Miller, R., Nasfi, M., Weckbecker, G.: The basic theory of infinite time register machines. Archive for Mathematical Logic\u00a049(2), 249\u2013273 (2010)","journal-title":"Archive for Mathematical Logic"},{"issue":"2","key":"41_CR4","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. The Journal of Symbolic Logic\u00a065(2), 567\u2013604 (2000)","journal-title":"The Journal of Symbolic Logic"},{"key":"41_CR5","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. The Bulletin of Symbolic Logic\u00a011, 377\u2013397 (2005)","journal-title":"The Bulletin of Symbolic Logic"},{"key":"41_CR6","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. (eds.) CiE 2006. LNCS, vol.\u00a03988, pp. 257\u2013266. Springer, Heidelberg (2006)"},{"key":"41_CR7","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":"41_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56999-9","volume-title":"Computable analysis. An Introduction","author":"K. Weihrauch","year":"2000","unstructured":"Weihrauch, K.: Computable analysis. An Introduction. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","How the World Computes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30870-3_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:32:31Z","timestamp":1620127951000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30870-3_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642308697","9783642308703"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30870-3_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}