{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T10:24:28Z","timestamp":1777544668946,"version":"3.51.4"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,6,23]],"date-time":"2007-06-23T00:00:00Z","timestamp":1182556800000},"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":[[2007,8,7]]},"DOI":"10.1007\/s11023-007-9058-2","type":"journal-article","created":{"date-parts":[[2007,6,22]],"date-time":"2007-06-22T09:00:21Z","timestamp":1182502821000},"page":"217-231","source":"Crossref","is-referenced-by-count":24,"title":["Physical Computation: How General are Gandy\u2019s Principles for Mechanisms?"],"prefix":"10.1007","volume":"17","author":[{"given":"B. Jack","family":"Copeland","sequence":"first","affiliation":[]},{"given":"Oron","family":"Shagrir","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,6,23]]},"reference":[{"key":"9058_CR1","doi-asserted-by":"crossref","unstructured":"Abramson, F.G. (1971). Effective computation over the real numbers. Twelfth annual symposium on switching and automata theory. Northridge, Calif.: Institute of Electrical and Electronics Engineers.","DOI":"10.1109\/SWAT.1971.12"},{"key":"9058_CR2","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1090\/S0002-9904-1940-07154-X","volume":"46","author":"A. Church","year":"1940","unstructured":"Church, A. (1940). On the concept of a random sequence. American Mathematical Society Bulletin, 46, 130\u2013135.","journal-title":"American Mathematical Society Bulletin"},{"key":"9058_CR3","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1177\/0002764297040006003","volume":"40","author":"B. J. 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":"9058_CR4","doi-asserted-by":"crossref","unstructured":"(1998a). Super Turing-machines. Complexity, 4, 30\u201332.","DOI":"10.1002\/(SICI)1099-0526(199809\/10)4:1<30::AID-CPLX9>3.0.CO;2-8"},{"key":"9058_CR5","unstructured":"(1998b). Even Turing machines can compute uncomputable functions. In C. Calude, J. Casti & M. Dinneen (Eds.), Unconventional models of computation. London: Springer-Verlag."},{"key":"9058_CR6","unstructured":"(2000). Narrow versus wide mechanism. Journal of Philosophy, 96, 5\u201332."},{"key":"9058_CR7","doi-asserted-by":"crossref","unstructured":"(2002a). Accelerating Turing machines. Minds and Machines, 12, 281\u2013301.","DOI":"10.1023\/A:1015607401307"},{"key":"9058_CR8","unstructured":"(2002b). Hypercomputation. In B. J. Copeland (Ed.) 2002\u20133."},{"key":"9058_CR9","unstructured":"(Ed.). (2002\u20133). Hypercomputation. Special issue of Minds and Machines (Vols 12(4), 13(1))."},{"key":"9058_CR10","unstructured":"(Ed.). (2004). The essential Turing. Oxford: Oxford University Press."},{"key":"9058_CR11","unstructured":"(Ed.). (2005). Alan Turing\u2019s Automatic Computing Engine: The master codebreaker\u2019s struggle to build the modern computer. Oxford: Oxford University Press."},{"key":"9058_CR12","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1038\/scientificamerican0499-98","volume":"280","author":"B. J. Copeland","year":"1999","unstructured":"Copeland, B. J., & Proudfoot, D. (1999). Alan Turing\u2019s forgotten ideas in computer science. Scientific American, 280, 76\u201381 (April).","journal-title":"Scientific American"},{"key":"9058_CR13","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1080\/00048409912348801","volume":"77","author":"B. J. 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":"9058_CR14","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/BF00665895","volume":"4","author":"N. C. A. da Costa","year":"1991","unstructured":"da Costa, N. C. A., & Doria, F. A. (1991). Classical physics and Penrose\u2019s thesis. Foundations of Physics Letters, 4, 363\u2013374.","journal-title":"Foundations of Physics Letters"},{"key":"9058_CR15","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1093\/bjps\/52.4.671","volume":"52","author":"B. Davies","year":"2001","unstructured":"Davies, B. (2001). Building infinite machines. British Journal for the Philosophy of Science, 52, 671\u2013682.","journal-title":"British Journal for the Philosophy of Science"},{"key":"9058_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-010-9072-8","volume-title":"A primer on determinism","author":"J. Earman","year":"1986","unstructured":"Earman, J. (1986). A primer on determinism. Dordrecht: D. Reidel."},{"key":"9058_CR17","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":"9058_CR18","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1023\/A:1014019225365","volume":"41","author":"G. Etesi","year":"2002","unstructured":"Etesi, G., & N\u00e9meti, I. (2002). Non-Turing computations via Malament-Hogarth space-times. International Journal of Theoretical Physics, 41, 341\u2013370.","journal-title":"International Journal of Theoretical Physics"},{"key":"9058_CR19","unstructured":"Gandy, R. (1980). Church\u2019s thesis and principles for mechanisms. In J. Barwise, H. J. Keisler & K. Kunen (Eds.), The Kleene symposium. Amsterdam: North-Holland."},{"key":"9058_CR20","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s11023-005-9006-y","volume":"16","author":"A. Hagar","year":"2006","unstructured":"Hagar, A., & Korolev, A. (2006). Quantum hypercomputability? Minds and Machines, 16, 87\u201393.","journal-title":"Minds and Machines"},{"key":"9058_CR21","unstructured":"(2007). Quantum hypercomputation: Hype or computation? Philosophy of Science (forthcoming)."},{"key":"9058_CR22","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF00682813","volume":"5","author":"M. L. 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":"9058_CR23","unstructured":"(1994). Non-Turing computers and non-Turing computability. PSA, 1, 126\u2013138."},{"key":"9058_CR24","doi-asserted-by":"crossref","unstructured":"(2004). Deciding arithmetic using SAD computers. British Journal for the Philosophy of Science, 55, 681\u2013691.","DOI":"10.1093\/bjps\/55.4.681"},{"key":"9058_CR25","doi-asserted-by":"crossref","unstructured":"Israel, D. (2002). Reflections on G\u00f6del\u2019s and Gandy\u2019s reflections on Turing\u2019s thesis. Minds and Machines, 12, 181\u2013201.","DOI":"10.1023\/A:1015634729532"},{"key":"9058_CR26","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1023\/A:1021130831101","volume":"12","author":"T. D. Kieu","year":"2002","unstructured":"Kieu, T. D. (2002). Quantum hypercomputation. Minds and Machines, 12, 541\u2013561.","journal-title":"Minds and Machines"},{"key":"9058_CR27","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF00484949","volume":"29","author":"G. Kreisel","year":"1974","unstructured":"Kreisel, G. (1974). A notion of mechanistic theory. Synthese, 29, 11\u201326.","journal-title":"Synthese"},{"key":"9058_CR28","doi-asserted-by":"crossref","unstructured":"(1982). Review of Pour-El and Richards. Journal of Symbolic Logic, 47, 900\u2013902.","DOI":"10.2307\/2273108"},{"key":"9058_CR29","volume-title":"Shadows of the mind: A search for the missing science of consciousness","author":"R. Penrose","year":"1994","unstructured":"Penrose, R. (1994). Shadows of the mind: A search for the missing science of consciousness. Oxford: Oxford University Press."},{"key":"9058_CR30","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":"9058_CR31","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0003-4843(79)90021-4","volume":"17","author":"M. B. Pour-El","year":"1979","unstructured":"Pour-El, M. B., & Richards, J. I. (1979). A computable ordinary differential equation which possesses no computable solution. Annals of Mathematical Logic, 17, 61\u201390.","journal-title":"Annals of Mathematical Logic"},{"key":"9058_CR32","unstructured":"(1989). Computability in analysis and physics. Berlin: Springer."},{"key":"9058_CR33","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1093\/aristotelian\/36.1.131","volume":"36","author":"B. A. W. Russell","year":"1936","unstructured":"Russell, B. A. W. (1936). The limits of empiricism. Proceedings of the Aristotelian Society, 36, 131\u201350.","journal-title":"Proceedings of the Aristotelian Society"},{"key":"9058_CR34","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1023\/A:1015694932257","volume":"12","author":"O. Shagrir","year":"2002","unstructured":"Shagrir, O. (2002). Effective computation by humans and machines. Minds and Machines, 12, 221\u2013240.","journal-title":"Minds and Machines"},{"key":"9058_CR35","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1023\/A:1021365222692","volume":"13","author":"O. Shagrir","year":"2003","unstructured":"Shagrir, O., & Pitowsky, I. (2003). Physical hypercomputation and the Church-Turing thesis. Minds and Machines, 13, 87\u2013101.","journal-title":"Minds and Machines"},{"key":"9058_CR36","unstructured":"Sieg, W. (2002). Calculations by man & machine: Mathematical presentation. Proceedings of the Cracow international congress of logic, methodology and philosophy of science. Synthese Series, Kluwer Academic Publishers."},{"key":"9058_CR37","doi-asserted-by":"crossref","first-page":"150","DOI":"10.5840\/monist19998213","volume":"82","author":"W. Sieg","year":"1999","unstructured":"Sieg, W., & Byrnes, J. (1999). An abstract model for parallel computations: Gandy\u2019s thesis. Monist, 82, 150\u2013164.","journal-title":"Monist"},{"key":"9058_CR38","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0304-3975(94)90178-3","volume":"131","author":"H. T. Siegelmann","year":"1994","unstructured":"Siegelmann, H. T., & Sontag, E. D. (1994). Analog computation via neural networks. Theoretical Computer Science, 131, 331\u2013360.","journal-title":"Theoretical Computer Science"},{"key":"9058_CR39","unstructured":"Turing, A. M. (1936). On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society (Series 2, Vol. 42, pp. 230\u2013265). In Copeland B. J. (Ed.). The essential Turing, 2004."},{"key":"9058_CR40","doi-asserted-by":"crossref","unstructured":"(1945). Proposed electronic calculator. In Copeland B. J. (Ed.) Alan Turing\u2019s Automatic Computing Engine, 2005.","DOI":"10.1093\/acprof:oso\/9780198565932.001.0001"},{"key":"9058_CR41","unstructured":"(1948). Intelligent machinery. In The essential Turing."},{"key":"9058_CR42","unstructured":"Welch P. D. The extent of computation in Malament-Hogarth spacetimes (forthcoming)."}],"container-title":["Minds and Machines"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11023-007-9058-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11023-007-9058-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11023-007-9058-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T02:48:08Z","timestamp":1559357288000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11023-007-9058-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,23]]},"references-count":42,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,8,7]]}},"alternative-id":["9058"],"URL":"https:\/\/doi.org\/10.1007\/s11023-007-9058-2","relation":{},"ISSN":["0924-6495","1572-8641"],"issn-type":[{"value":"0924-6495","type":"print"},{"value":"1572-8641","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,6,23]]}}}