{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,25]],"date-time":"2024-06-25T05:17:57Z","timestamp":1719292677124},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,3,18]],"date-time":"2011-03-18T00:00:00Z","timestamp":1300406400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Minds &amp; Machines"],"published-print":{"date-parts":[[2011,5]]},"DOI":"10.1007\/s11023-011-9238-y","type":"journal-article","created":{"date-parts":[[2011,3,17]],"date-time":"2011-03-17T05:16:30Z","timestamp":1300338990000},"page":"221-239","source":"Crossref","is-referenced-by-count":18,"title":["Do Accelerating Turing Machines Compute the Uncomputable?"],"prefix":"10.1007","volume":"21","author":[{"given":"B.","family":"Jack Copeland","sequence":"first","affiliation":[]},{"given":"Oron","family":"Shagrir","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,3,18]]},"reference":[{"key":"9238_CR1","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1007\/s11047-009-9114-3","volume":"8","author":"H Andr\u00e9ka","year":"2009","unstructured":"Andr\u00e9ka, H., N\u00e9meti, I., & N\u00e9meti, P. (2009). General relativistic hypercomputing and foundation of mathematics. Natural Computing, 8, 499\u2013516.","journal-title":"Natural Computing"},{"key":"9238_CR2","unstructured":"Barker-Plummer, D. (2004). Turing machines. In E. N. Zalta (Ed.), The Stanford encyclopedia of philosophy. http:\/\/www.plato.stanford.edu\/archives\/spr2005\/entries\/turing-machine ."},{"key":"9238_CR3","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.amc.2005.09.068","volume":"178","author":"EJ Beggs","year":"2006","unstructured":"Beggs, E. J., & Tucker, J. V. (2006). Embedding infinitely parallel computation in Newtonian kinematics. Applied Mathematics and Computation, 178, 25\u201343.","journal-title":"Applied Mathematics and Computation"},{"key":"9238_CR4","doi-asserted-by":"crossref","first-page":"765","DOI":"10.2307\/2023500","volume":"59","author":"P Benacerraf","year":"1962","unstructured":"Benacerraf, P. (1962). Tasks, super-tasks, and the modern eleatics. Journal of Philosophy, 59, 765\u2013784.","journal-title":"Journal of Philosophy"},{"key":"9238_CR5","doi-asserted-by":"crossref","first-page":"645","DOI":"10.2307\/2013813","volume":"23","author":"RM Blake","year":"1926","unstructured":"Blake, R. M. (1926). The paradox of temporal process. Journal of Philosophy, 23, 645\u2013654.","journal-title":"Journal of Philosophy"},{"key":"9238_CR6","volume-title":"Computability and logic","author":"GS Boolos","year":"1980","unstructured":"Boolos, G. S., & Jeffrey, R. C. (1980). Computability and logic (2nd ed.). Cambridge: Cambridge University Press.","edition":"2"},{"key":"9238_CR7","doi-asserted-by":"crossref","first-page":"1011","DOI":"10.1017\/S0960129510000344","volume":"20","author":"CS Calude","year":"2010","unstructured":"Calude, C. S., & Staiger, L. (2010). A note on accelerated Turing machines. Mathematical Structures in Computer Science, 20, 1011\u20131017.","journal-title":"Mathematical Structures in Computer Science"},{"key":"9238_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(78)90002-6","volume":"6","author":"RS Cohen","year":"1978","unstructured":"Cohen, R. S., & Gold, A. Y. (1978). \u03c9-computations on Turing machines. Theoretical Computer Science, 6, 1\u201323.","journal-title":"Theoretical Computer Science"},{"key":"9238_CR9","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1177\/0002764297040006003","volume":"40","author":"BJ Copeland","year":"1997","unstructured":"Copeland, B. J. (1997). The broad conception of computation. American Behavioral Scientist, 40, 690\u2013716.","journal-title":"American Behavioral Scientist"},{"key":"9238_CR10","first-page":"150","volume-title":"Unconventional models of computation","author":"BJ Copeland","year":"1998","unstructured":"Copeland, B. J. (1998a). Even Turing machines can compute uncomputable functions. In C. S. Calude, J. Casti, & M. J. Dinneen (Eds.), Unconventional models of computation (pp. 150\u2013164). Singapore: Springer."},{"key":"9238_CR11","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1002\/(SICI)1099-0526(199809\/10)4:1<30::AID-CPLX9>3.0.CO;2-8","volume":"4","author":"BJ Copeland","year":"1998","unstructured":"Copeland, B. J. (1998b). Super Turing-machines. Complexity, 4, 30\u201332.","journal-title":"Complexity"},{"key":"9238_CR12","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1111\/1467-8284.00113","volume":"58","author":"BJ Copeland","year":"1998","unstructured":"Copeland, B. J. (1998c). Turing\u2019s O-machines, Penrose, Searle, and the brain. Analysis, 58, 128\u2013138.","journal-title":"Analysis"},{"key":"9238_CR13","doi-asserted-by":"crossref","first-page":"5","DOI":"10.2307\/2678472","volume":"97","author":"BJ Copeland","year":"2000","unstructured":"Copeland, B. J. (2000). Narrow versus wide mechanism: Including a re-examination of Turing\u2019s views on the mind-machine issue. Journal of Philosophy, 97, 5\u201332.","journal-title":"Journal of Philosophy"},{"key":"9238_CR14","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1023\/A:1015607401307","volume":"12","author":"BJ Copeland","year":"2002","unstructured":"Copeland, B. J. (2002a). Accelerating Turing machines. Minds and Machines, 12, 281\u2013300.","journal-title":"Minds and Machines"},{"key":"9238_CR15","doi-asserted-by":"crossref","unstructured":"Copeland, B. J. (2002b). Hypercomputation. In B. J. Copeland (Ed.) (2002\u20132003), 461\u2013502.","DOI":"10.1023\/A:1021105915386"},{"key":"9238_CR16","doi-asserted-by":"crossref","unstructured":"Copeland, B. J. (Ed.) (2002\u20132003). Hypercomputation. Special issue of Minds and Machines, 12(4), 13(1).","DOI":"10.1023\/A:1021105915386"},{"key":"9238_CR17","volume-title":"The essential Turing","year":"2004","unstructured":"Copeland, B. J. (Ed.). (2004a). The essential Turing. Oxford and New York: Oxford University Press."},{"key":"9238_CR18","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1109\/MAHC.2004.26","volume":"26","author":"BJ Copeland","year":"2004","unstructured":"Copeland, B. J. (2004b). Colossus\u2014its origins and originators. IEEE Annals of the History of Computing, 26, 38\u201345.","journal-title":"IEEE Annals of the History of Computing"},{"key":"9238_CR19","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/j.tcs.2003.12.014","volume":"317","author":"BJ Copeland","year":"2004","unstructured":"Copeland, B. J. (2004c). Hypercomputation: Philosophical issues. Theoretical Computer Science, 317, 251\u2013267.","journal-title":"Theoretical Computer Science"},{"key":"9238_CR20","unstructured":"Copeland, B. J. (2005). Comments from the chair: Hypercomputation and the Church-Turing thesis. Paper delivered at the American Philosophical Society Eastern Division Meeting, New York City."},{"key":"9238_CR21","unstructured":"Copeland, B. J. (2010). Colossus: Breaking the German \u201cTunny\u201d code at Bletchley Park. An illustrated history. The Rutherford Journal: The New Zealand Journal for the History and Philosophy of Science and Technology, 3, http:\/\/www.rutherfordjournal.org ."},{"key":"9238_CR22","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1038\/scientificamerican0499-98","volume":"280","author":"BJ Copeland","year":"1999","unstructured":"Copeland, B. J., & Proudfoot, D. (1999). Alan Turing\u2019s forgotten ideas in computer science. Scientific American, 280, 76\u201381.","journal-title":"Scientific American"},{"key":"9238_CR23","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/s11023-007-9058-2","volume":"17","author":"BJ Copeland","year":"2007","unstructured":"Copeland, B. J., & Shagrir, O. (2007). Physical computation: How general are Gandy\u2019s principles for mechanisms. Minds and Machines, 17, 217\u2013231.","journal-title":"Minds and Machines"},{"key":"9238_CR24","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1080\/00048409912348801","volume":"77","author":"BJ Copeland","year":"1999","unstructured":"Copeland, B. J., & Sylvan, R. (1999). Beyond the universal Turing machine. Australasian Journal of Philosophy, 77, 46\u201366.","journal-title":"Australasian Journal of Philosophy"},{"key":"9238_CR25","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1093\/bjps\/52.4.671","volume":"52","author":"BE Davies","year":"2001","unstructured":"Davies, B. E. (2001). Building infinite machines. British Journal for the Philosophy of Science, 52, 671\u2013682.","journal-title":"British Journal for the Philosophy of Science"},{"key":"9238_CR26","volume-title":"Computability and unsolvability","author":"M Davis","year":"1958","unstructured":"Davis, M. (1958). Computability and unsolvability. New York: McGraw-Hill."},{"key":"9238_CR27","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1086\/289716","volume":"60","author":"J Earman","year":"1993","unstructured":"Earman, J., & Norton, J. D. (1993). Forever is a day: Supertasks in Pitowsky and Malament-Hogarth spacetimes. Philosophy of Science, 60, 22\u201342.","journal-title":"Philosophy of Science"},{"key":"9238_CR28","first-page":"231","volume-title":"Benacerraf and his critics","author":"J Earman","year":"1996","unstructured":"Earman, J., & Norton, J. D. (1996). Infinite pains: The trouble with supertasks. In A. Morton & S. P. Stich (Eds.), Benacerraf and his critics (pp. 231\u2013261). Oxford: Blackwell."},{"key":"9238_CR29","unstructured":"Fearnley, L. G. (2009). On accelerated Turing machines. Honours thesis in Computer Science, University of Auckland."},{"key":"9238_CR30","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1080\/17445760701536068","volume":"23","author":"R Fraser","year":"2008","unstructured":"Fraser, R., & Akl, S. G. (2008). Accelerating machines: A review. International Journal of Parallel Emergent and Distributed Systems, 23, 81\u2013104.","journal-title":"International Journal of Parallel Emergent and Distributed Systems"},{"key":"9238_CR31","unstructured":"Hamkins, J. D. (2002). Infinite time Turing machines. In B. J. Copeland (Ed.) (2002\u20132003), 521\u2013539."},{"key":"9238_CR32","doi-asserted-by":"crossref","first-page":"567","DOI":"10.2307\/2586556","volume":"65","author":"JD Hamkins","year":"2000","unstructured":"Hamkins, J. D., & Lewis, A. (2000). Infinite time Turing machines. Journal of Symbolic Logic, 65, 567\u2013604.","journal-title":"Journal of Symbolic Logic"},{"key":"9238_CR33","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF00682813","volume":"5","author":"ML Hogarth","year":"1992","unstructured":"Hogarth, M. L. (1992). Does general relativity allow an observer to view an eternity in a finite time? Foundations of Physics Letters, 5, 173\u2013181.","journal-title":"Foundations of Physics Letters"},{"key":"9238_CR34","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1086\/psaprocbienmeetp.1994.1.193018","volume":"1","author":"ML Hogarth","year":"1994","unstructured":"Hogarth, M. L. (1994). Non-Turing computers and non-Turing computability. PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association, 1, 126\u2013138.","journal-title":"PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association"},{"key":"9238_CR35","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1093\/bjps\/55.4.681","volume":"55","author":"ML Hogarth","year":"2004","unstructured":"Hogarth, M. L. (2004). Deciding arithmetic using SAD computers. British Journal for the Philosophy of Science, 55, 681\u2013691.","journal-title":"British Journal for the Philosophy of Science"},{"key":"9238_CR36","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/2964568","volume":"24","author":"SA Kripke","year":"1959","unstructured":"Kripke, S. A. (1959). A completeness theorem in modal logic. Journal of Symbolic Logic, 24, 1\u201314.","journal-title":"Journal of Symbolic Logic"},{"key":"9238_CR37","volume-title":"Elements of the theory of computation","author":"HR Lewis","year":"1981","unstructured":"Lewis, H. R., & Papadimitriou, C. H. (1981). Elements of the theory of computation. Englewood Cliffs, NJ: Prentice-Hall."},{"key":"9238_CR38","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1098\/rsbm.1955.0019","volume":"1","author":"MHA Newman","year":"1955","unstructured":"Newman, M. H. A. (1955). Alan Mathison Turing, 1912\u20131954. Biographical Memoirs of Fellows of the Royal Society, 1, 253\u2013263.","journal-title":"Biographical Memoirs of Fellows of the Royal Society"},{"key":"9238_CR39","first-page":"81","volume":"39","author":"I Pitowsky","year":"1990","unstructured":"Pitowsky, I. (1990). The physical Church thesis and physical computational complexity. Iyyun, 39, 81\u201399.","journal-title":"Iyyun"},{"key":"9238_CR40","doi-asserted-by":"crossref","first-page":"103","DOI":"10.2307\/2269031","volume":"1","author":"EL Post","year":"1936","unstructured":"Post, E. L. (1936). Finite combinatory processes\u2013formulation 1. Journal of Symbolic Logic, 1, 103\u2013105.","journal-title":"Journal of Symbolic Logic"},{"key":"9238_CR41","doi-asserted-by":"crossref","unstructured":"Potgieter, P. H., & Rosinger, E. E. (2010). Output concepts for accelerated Turing machines. Natural Computing, 9, 853\u2013864.","DOI":"10.1007\/s11047-010-9197-x"},{"key":"9238_CR42","volume-title":"Word and object","author":"WVO Quine","year":"1960","unstructured":"Quine, W. V. O. (1960). Word and object. Cambridge, MA: MIT Press."},{"key":"9238_CR43","doi-asserted-by":"crossref","DOI":"10.5962\/bhl.title.2067","volume-title":"Our knowledge of the external world as a field for scientific method in philosophy","author":"BAW Russell","year":"1915","unstructured":"Russell, B. A. W. (1915). Our knowledge of the external world as a field for scientific method in philosophy. Chicago: Open Court."},{"key":"9238_CR44","unstructured":"Schaller, M., & Svozil, K. (2009). Zeno squeezing of cellular automata. arXiv:0908.0835."},{"key":"9238_CR45","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/j.tcs.2003.12.007","volume":"317","author":"O Shagrir","year":"2004","unstructured":"Shagrir, O. (2004). Super-tasks, accelerating Turing machines and uncomputability. Theoretical Computer Science, 317, 105\u2013114.","journal-title":"Theoretical Computer Science"},{"key":"9238_CR46","unstructured":"Shagrir, O. (2011). Supertasks do not increase computational power. Natural Computing (forthcoming)."},{"key":"9238_CR47","unstructured":"Shagrir, O., & Pitowsky, I. (2003). Physical hypercomputation and the Church-Turing thesis. In B. J. Copeland (Ed.) (2002\u20132003), 87\u2013101."},{"key":"9238_CR48","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1023\/A:1015603317236","volume":"12","author":"E Steinhart","year":"2002","unstructured":"Steinhart, E. (2002). Logically possible machines. Minds and Machines, 12, 259\u2013280.","journal-title":"Minds and Machines"},{"key":"9238_CR49","first-page":"178","volume-title":"The Blackwell guide to the philosophy of computing and information","author":"E Steinhart","year":"2003","unstructured":"Steinhart, E. (2003). The physics of information. In L. Floridi (Ed.), The Blackwell guide to the philosophy of computing and information (pp. 178\u2013185). Oxford: Blackwell."},{"key":"9238_CR50","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1038\/352664a0","volume":"352","author":"I Stewart","year":"1991","unstructured":"Stewart, I. (1991). Deciding the undecidable. Nature, 352, 664\u2013665.","journal-title":"Nature"},{"key":"9238_CR51","first-page":"371","volume-title":"Unconventional models of computation","author":"K Svozil","year":"1998","unstructured":"Svozil, K. (1998). The Church-Turing thesis as a guiding principle for physics. In C. S. Calude, J. Casti, & M. J. Dinneen (Eds.), Unconventional models of computation (pp. 371\u2013385). London: Springer."},{"key":"9238_CR53","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/3326643","volume":"15","author":"JF Thomson","year":"1954","unstructured":"Thomson, J. F. (1954). Tasks and super-tasks. Analysis, 15, 1\u201313.","journal-title":"Analysis"},{"key":"9238_CR54","first-page":"130","volume-title":"Zeno\u2019s paradoxes","author":"JF Thomson","year":"1970","unstructured":"Thomson, J. F. (1970). Comments on professor Benacerraf\u2019s paper. In W. C. Salmon (Ed.), Zeno\u2019s paradoxes (pp. 130\u2013138). Indianapolis: Bobbs-Merrill."},{"key":"9238_CR55","unstructured":"Turing, A. M. (1936). On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, Series 2, 42, 230\u2013265. (In The essential Turing (Copeland 2004a); page references are to the latter.)"},{"key":"9238_CR56","unstructured":"Turing, A. M. (1948). Intelligent machinery. National Physical Laboratory report. In The essential Turing (Copeland 2004a). A digital facsimile of the original document may be viewed in the Turing Archive for the History of Computing. http:\/\/www.AlanTuring.net\/intelligent_machinery ."},{"key":"9238_CR57","doi-asserted-by":"crossref","unstructured":"Turing, A. M. (1950). Computing machinery and intelligence. Mind, 59, 433\u201360. (In The essential Turing (Copeland 2004a); page references are to the latter.)","DOI":"10.1093\/mind\/LIX.236.433"},{"key":"9238_CR58","volume-title":"Philosophie der Mathematik und Naturwissenschaft","author":"H Weyl","year":"1927","unstructured":"Weyl, H. (1927). Philosophie der Mathematik und Naturwissenschaft. Munich: R. Oldenbourg."},{"key":"9238_CR59","volume-title":"Philosophy of mathematics and natural science","author":"H Weyl","year":"1949","unstructured":"Weyl, H. (1949). Philosophy of mathematics and natural science. Princeton: Princeton University Press."}],"container-title":["Minds and Machines"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11023-011-9238-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11023-011-9238-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11023-011-9238-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,9]],"date-time":"2019-06-09T09:02:37Z","timestamp":1560070957000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11023-011-9238-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,18]]},"references-count":58,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,5]]}},"alternative-id":["9238"],"URL":"https:\/\/doi.org\/10.1007\/s11023-011-9238-y","relation":{},"ISSN":["0924-6495","1572-8641"],"issn-type":[{"value":"0924-6495","type":"print"},{"value":"1572-8641","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3,18]]}}}