{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:13:13Z","timestamp":1725487993042},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540730002"},{"type":"electronic","value":"9783540730019"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"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":[[2007]]},"DOI":"10.1007\/978-3-540-73001-9_82","type":"book-chapter","created":{"date-parts":[[2007,7,24]],"date-time":"2007-07-24T11:16:31Z","timestamp":1185275791000},"page":"768-780","source":"Crossref","is-referenced-by-count":2,"title":["Turing Unbound: Transfinite Computation"],"prefix":"10.1007","author":[{"given":"Philip D.","family":"Welch","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"82_CR1","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1086\/289716","volume":"60","author":"J. Earman","year":"1993","unstructured":"Earman, J., Norton, J.D.: Forever is a day: Supertasks in Pitowsky and Malament-Hogarth spacetimes. Philosophy of Science\u00a060, 22\u201342 (1993)","journal-title":"Philosophy of Science"},{"issue":"2","key":"82_CR2","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1014019225365","volume":"41","author":"G. Etesi","year":"2002","unstructured":"Etesi, G., N\u00e9meti, I.: Non-Turing computations via Malament-Hogarth space-times. International Journal of Theoretical Physics\u00a041(2), 341\u2013370 (2002)","journal-title":"International Journal of Theoretical Physics"},{"issue":"1","key":"82_CR3","doi-asserted-by":"publisher","first-page":"28","DOI":"10.2307\/2270580","volume":"30","author":"E. Gold","year":"1965","unstructured":"Gold, E.: Limiting recursion. Journal of Symbolic Logic\u00a030(1), 28\u201348 (1965)","journal-title":"Journal of Symbolic Logic"},{"key":"82_CR4","unstructured":"Hamkins, J. D., Lewis, A.: Post\u2019s problem for supertasks has both positive and negative solutions. Archive for Mathematical Logic"},{"issue":"2","key":"82_CR5","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. Journal of Symbolic Logic\u00a065(2), 567\u2013604 (2000)","journal-title":"Journal of Symbolic Logic"},{"issue":"4","key":"82_CR6","first-page":"684","volume":"43","author":"L. Harrington","year":"1978","unstructured":"Harrington, L.: Analytic determinacy and 0#. JSL\u00a043(4), 684\u2013693 (1978)","journal-title":"JSL"},{"key":"82_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511524646","volume-title":"The large scale structure of space-time","author":"S.W. Hawking","year":"1973","unstructured":"Hawking, S.W., Ellis, G.F.R.: The large scale structure of space-time. Cambridge University Press, Cambridge (1973)"},{"issue":"2","key":"82_CR8","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF00682813","volume":"5","author":"M. Hogarth","year":"1992","unstructured":"Hogarth, M.: Does general relativity allow an observer to view an eternity in a finite time? Foundations of Physics Letters\u00a05(2), 173\u2013181 (1992)","journal-title":"Foundations of Physics Letters"},{"key":"82_CR9","first-page":"126","volume":"1","author":"M. Hogarth","year":"1994","unstructured":"Hogarth, M.: Non-Turing computers and non-Turing computability. PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association\u00a01, 126\u2013138 (1994)","journal-title":"PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association"},{"key":"82_CR10","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1093\/bjps\/55.4.681","volume":"55","author":"M. Hogarth","year":"2004","unstructured":"Hogarth, M.: Deciding arithmetic using SAD computers. British Journal for the Philosophy of Science\u00a055, 681\u2013691 (2004)","journal-title":"British Journal for the Philosophy of Science"},{"key":"82_CR11","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/S0049-237X(08)71267-9","volume-title":"Proceedings of the Kleene Symposium, Studies in Logic","author":"K. Hrbacek","year":"1980","unstructured":"Hrbacek, K., Simpson, S.: On Kleene degrees of analytic sets. In: Keisler, H.J., Barwise, J., Kunen, K. (eds.) Proceedings of the Kleene Symposium, Studies in Logic, pp. 347\u2013352. North-Holland, Amsterdam (1980)"},{"key":"82_CR12","doi-asserted-by":"publisher","first-page":"377","DOI":"10.2178\/bsl\/1122038993","volume":"11","author":"P. Koepke","year":"2005","unstructured":"Koepke, P.: Turing computation on ordinals. Bulletin of Symbolic Logic\u00a011, 377\u2013397 (2005)","journal-title":"Bulletin of Symbolic Logic"},{"issue":"5","key":"82_CR13","doi-asserted-by":"publisher","first-page":"867","DOI":"10.1017\/S0960129506005615","volume":"16","author":"P. Koepke","year":"2006","unstructured":"Koepke, P., Koerwien, M.: Ordinal computations. Mathematical Structures in Computer Science\u00a016(5), 867\u2013884 (2006)","journal-title":"Mathematical Structures in Computer Science"},{"key":"82_CR14","doi-asserted-by":"crossref","unstructured":"Koepke, P., Siders, R.: Computing the recursive truth predicate on ordinal register machines. In: Beckmann, A., et al. (ed.) Logical Approaches to Computational Barriers, Computer Science Report Series, p.\u00a021. Swansea (2006)","DOI":"10.1007\/11780342_27"},{"key":"82_CR15","first-page":"81","volume":"39","author":"I. Pitowsky","year":"1990","unstructured":"Pitowsky, I.: The physical Church-Turing thesis and physical computational complexity. Iyyun\u00a039, 81\u201399 (1990)","journal-title":"Iyyun"},{"key":"82_CR16","doi-asserted-by":"publisher","first-page":"49","DOI":"10.2307\/2270581","volume":"30","author":"H. Putnam","year":"1965","unstructured":"Putnam, H.: Trial and error predicates and the solution to a problem of Mostowski. Journal of Symbolic Logic\u00a030, 49\u201357 (1965)","journal-title":"Journal of Symbolic Logic"},{"key":"82_CR17","unstructured":"Rogers, H.: Recursive Function Theory. Higher Mathematics. McGraw (1967)"},{"key":"82_CR18","volume-title":"Perspectives in Mathematical Logic","author":"G.E. Sacks","year":"1990","unstructured":"Sacks, G.E.: Higher Recursion Theory. In: Perspectives in Mathematical Logic, Springer, Heidelberg (1990)"},{"key":"82_CR19","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0003-4843(72)90004-6","volume":"4","author":"G.E. Sacks","year":"1972","unstructured":"Sacks, G.E., Simpson, S.: The \u03b1-finite injury method. Annals of Mathematical Logic\u00a04, 343\u2013367 (1972)","journal-title":"Annals of Mathematical Logic"},{"key":"82_CR20","first-page":"374","volume":"36","author":"R.M. Solovay","year":"1971","unstructured":"Solovay, R.M.: Determinacy and type 2 recursion. Journal of Symbolic Logic\u00a036, 374 (1971)","journal-title":"Journal of Symbolic Logic"},{"key":"82_CR21","doi-asserted-by":"publisher","first-page":"83","DOI":"10.4064\/fm-108-2-83-88","volume":"108","author":"J.R. Steel","year":"1980","unstructured":"Steel, J.R.: Analytic sets and Borel isomorphisms. Fundamenta Mathematicae\u00a0108, 83\u201388 (1980)","journal-title":"Fundamenta Mathematicae"},{"key":"82_CR22","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1112\/S0024609399006657","volume":"32","author":"P.D. Welch","year":"2000","unstructured":"Welch, P.D.: The length of infinite time Turing machine computations. Bulletin of the London Mathematical Society\u00a032, 129\u2013136 (2000)","journal-title":"Bulletin of the London Mathematical Society"},{"key":"82_CR23","first-page":"223","volume-title":"Classical and New Paradigms of Computation and their Complexity hierarchies, Papers of the Conference Foundations of the Formal Sciences III, Trends in logic","author":"P.D. Welch","year":"2004","unstructured":"Welch, P.D.: Post\u2019s and other problems in higher type supertasks. In: L\u00f6we, B., Piwinger, B., R\u00e4sch, T. (eds.) Classical and New Paradigms of Computation and their Complexity hierarchies, Papers of the Conference Foundations of the Formal Sciences III, Trends in logic, October, vol.\u00a023, pp. 223\u2013237. Kluwer, Dordrecht (2004)"},{"key":"82_CR24","unstructured":"Welch, P.D.: Turing Unbound: The extent of computations in Malament-Hogarth spacetimes. British Journal for Philosophy of Science (submitted)"}],"container-title":["Lecture Notes in Computer Science","Computation and Logic in the Real World"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73001-9_82","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T08:18:15Z","timestamp":1556698695000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73001-9_82"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540730002","9783540730019"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73001-9_82","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}