{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,14]],"date-time":"2024-05-14T21:40:07Z","timestamp":1715722807186},"reference-count":86,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Minds & Machines"],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1007\/s11023-013-9317-3","type":"journal-article","created":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T05:58:35Z","timestamp":1374040715000},"page":"275-305","source":"Crossref","is-referenced-by-count":2,"title":["Practical Intractability: A Critique of the Hypercomputation Movement"],"prefix":"10.1007","volume":"24","author":[{"given":"Aran","family":"Nayebi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,7,18]]},"reference":[{"key":"9317_CR1","first-page":"1021","volume":"266","author":"L. Adleman","year":"1994","unstructured":"Adleman, L. (1994). Molecular computation of solutions to combinatorial problems. Science, 266, 1021\u20131024.","journal-title":"HortScience"},{"key":"9317_CR2","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1086.001.0001","volume-title":"Actors: A model of concurrent computation. Doctoral Dissertation","author":"G. A. Agha","year":"1986","unstructured":"Agha, G. A. (1986). Actors: A model of concurrent computation. Doctoral dissertation. Cambridge: MIT Press."},{"key":"9317_CR3","volume-title":"The Kleene symposium","year":"1980","unstructured":"Barwise, J., Keisler, H. J., & Kunen, K. (Eds.). (1980). The Kleene symposium. Amsterdam: North-Holland."},{"key":"9317_CR4","doi-asserted-by":"crossref","first-page":"645","DOI":"10.2307\/2013813","volume":"23","author":"R. M. 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":"9317_CR5","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.biosystems.2004.05.032","volume":"77","author":"C. S. Calude","year":"2004","unstructured":"Calude, C. S., & P\u0103un, G. (2004). Bio-steps beyond Turing. Biosystems, 77, 175\u2013194.","journal-title":"Biosystems"},{"key":"9317_CR6","doi-asserted-by":"crossref","first-page":"345","DOI":"10.2307\/2371045","volume":"58","author":"A. Church","year":"1936","unstructured":"Church, A. (1936). An unsolvable problem of elementary number theory. American Journal of Mathematics, 58, 345\u2013363.","journal-title":"American Journal of Mathematics"},{"key":"9317_CR7","doi-asserted-by":"crossref","first-page":"42","DOI":"10.2307\/2268808","volume":"2","author":"A. Church","year":"1937","unstructured":"Church, A. (1937). Review of Turing 1936\u20131937. Journal of Symbolic Logic, 2, 42\u201343.","journal-title":"Journal of Symbolic Logic"},{"key":"9317_CR8","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. Bulletin of the American Mathematical Society, 46, 130\u2013135.","journal-title":"Bulletin of the American Mathematical Society"},{"key":"9317_CR9","volume-title":"Foundations of actor semantics. Doctoral dissertation","author":"W. Clinger","year":"1981","unstructured":"Clinger, W. (1981). Foundations of actor semantics. Doctoral dissertation. Cambridge: MIT Press."},{"key":"9317_CR10","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1093\/analys\/58.2.128","volume":"58","author":"B. J. Copeland","year":"1998","unstructured":"Copeland, B. J. (1998). Turing\u2019s o-machines, Searle, Penrose and the brain. Analysis, 58, 128\u2013138.","journal-title":"Logic and Analysis"},{"key":"9317_CR11","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1038\/scientificamerican0499-98","volume":"253","author":"B. J. Copeland","year":"1999","unstructured":"Copeland, B. J., & Proudfoot, D. (1999). Alan Turing\u2019s forgotten ideas in computer science. Scientific American, 253, 98\u2013103.","journal-title":"Scientific American"},{"key":"9317_CR12","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1023\/A:1015607401307","volume":"12","author":"B. J. Copeland","year":"2002","unstructured":"Copeland, B. J. (2002). Accelerating Turing machines. Minds and Machines, 12, 281\u2013300.","journal-title":"Minds and Machines"},{"key":"9317_CR13","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1023\/A:1021105915386","volume":"12","author":"B. J. Copeland","year":"2002","unstructured":"Copeland, B. J. (2002). Hypercomputation. Minds and Machines, 12, 461\u2013502.","journal-title":"Minds and Machines"},{"key":"9317_CR14","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/s11023-007-9058-2","volume":"17","author":"B. J. 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":"9317_CR15","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":"9317_CR16","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1093\/bjps\/52.4.671","volume":"52","author":"E. B. Davies","year":"2001","unstructured":"Davies, E. 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":"9317_CR17","doi-asserted-by":"crossref","unstructured":"Davis, M. (2004). The myth of hypercomputation\u201d. In Teuscher et al. (2004), pp. 195\u2013211.","DOI":"10.1007\/978-3-662-05642-4_8"},{"key":"9317_CR18","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/11780342_13","volume":"3988","author":"M. Davis","year":"2006","unstructured":"Davis, M. (2006a). The Church\u2013Turing thesis: Consensus and opposition. Lecture Notes in Computer Science, 3988, 125\u2013132.","journal-title":"Lecture Notes in Computer Science"},{"key":"9317_CR19","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1016\/j.amc.2005.09.066","volume":"178","author":"M. Davis","year":"2006","unstructured":"Davis, M. (2006b). Why there is no such discipline as hypercomputation. Applied Mathematics and Computation, 178, 4\u20137.","journal-title":"Applied Mathematics and Computation"},{"key":"9317_CR20","doi-asserted-by":"crossref","unstructured":"de Leeuw, K., Moore, E. F., Shannon C. E., & Shapiro N. (1956). Computability by probabilistic machines. In McCarthy and Shannon (1956), pp. 183\u2013212.","DOI":"10.1515\/9781400882618-010"},{"key":"9317_CR21","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1098\/rspa.1985.0070","volume":"400","author":"D. Deutsch","year":"1985","unstructured":"Deutsch, D. (1985). Quantum theory, the Church\u2013Turing principle, and the universal quantum computer. Proceedings of the Royal Society, Series A, 400, 97\u2013117.","journal-title":"Proceedings of the Royal Society, Series A"},{"key":"9317_CR22","first-page":"279","volume":"81","author":"E. Eberbach","year":"2003","unstructured":"Eberbach, E., & Wegner, P. (2003). Beyond Turing machines. Bulletin of the European Association for Theoretical Computer Science, 81, 279\u2013304.","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"key":"9317_CR23","doi-asserted-by":"crossref","unstructured":"Eberbach, E., Goldin, D. Q., & Wegner, P. (2004). Turing\u2019s ideas and models of computation. In Teuscher et al. (2004), pp. 159\u2013194.","DOI":"10.1007\/978-3-662-05642-4_7"},{"key":"9317_CR24","volume-title":"The space of mathematics: Philosophical, epistemological, and historical explorations","year":"1992","unstructured":"Echeverr\u00eda, J., Ibarra, A., & Mormann, T. (Eds.). (1992). The space of mathematics: Philosophical, epistemological, and historical explorations. Berlin: Walter de Gruyter."},{"key":"9317_CR25","doi-asserted-by":"crossref","unstructured":"Feferman, S. (1992). Turing\u2019s \u2018oracle\u2019: From absolute to relative computability\u2014And back. In Echeverr\u00eda et al. (1992), pp. 314\u2013348.","DOI":"10.1515\/9783110870299.314"},{"key":"9317_CR26","doi-asserted-by":"crossref","unstructured":"Gandy, R. O. (1980). Church\u2019s thesis and principles for mechanisms\u201d. In Barwise et al. (1980), pp. 123\u2013148.","DOI":"10.1016\/S0049-237X(08)71257-6"},{"key":"9317_CR27","unstructured":"Gandy, R. O. (1993). On the impossibility of using analogue machines to calculate non-computable functions (unpublished)."},{"key":"9317_CR28","doi-asserted-by":"crossref","first-page":"28","DOI":"10.2307\/2270580","volume":"30","author":"E. M. Gold","year":"1965","unstructured":"Gold, E. M. (1965). Limiting recursion. Journal of Symbolic Logic 30, 28\u201346.","journal-title":"Journal of Symbolic Logic"},{"key":"9317_CR29","unstructured":"Gurevich, Y. (2011). What is an algorithm? Technical Report MSR-TR-2011-116. http:\/\/research.microsoft.com\/pubs\/155608\/209-3.pdf ."},{"key":"9317_CR30","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1145\/641205.641235","volume":"46","author":"D. Q. Goldin","year":"2003","unstructured":"Goldin, D, Q. & Wegner, P. (2003). Computation beyond Turing machines. Communications of the ACM, 46, 100\u2013102.","journal-title":"Communications of the ACM"},{"key":"9317_CR31","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1086\/521969","volume":"74","author":"A. Hagar","year":"2007","unstructured":"Hagar, A., & Korolev, A. (2007). Quantum hypercomputation\u2014Hype or computation?. Philosophy of Science, 74, 347\u2013363.","journal-title":"Philosophy of Science"},{"key":"9317_CR32","unstructured":"Hewitt, C., Bishop, P., & Steiger, R. (1973). A universal modular Actor formalism for artificial intelligence. In Proceedings of the 3rd international joint conference on Artificial intelligence (pp. 235\u2013245)."},{"key":"9317_CR33","unstructured":"Hopcroft, J. E., Ullman, J. D. (1979). Introduction to automata theory, languages, and computation. Reading, MA: Addison-Wesley."},{"key":"9317_CR87","unstructured":"Ince, D. C. (Ed). (1992). Collected works of A. M. Turing: mechanical intelligence. Amsterdam: Elsevier Science."},{"key":"9317_CR34","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1023\/A:1015634729532","volume":"12","author":"D. Israel","year":"2002","unstructured":"Israel, D. (2002). Reflections on G\u00f6del\u2019s and Gandy\u2019s reflections on Turing\u2019s thesis. Minds and Machines, 12, 181\u2013201.","journal-title":"Minds and Machines"},{"key":"9317_CR35","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195091953.001.0001","volume-title":"The logic of reliable inquiry","author":"K. T. Kelly","year":"1996","unstructured":"Kelly, K. T. (1996). The logic of reliable inquiry. New York: Oxford University Press."},{"key":"9317_CR36","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":"9317_CR37","doi-asserted-by":"crossref","first-page":"1461","DOI":"10.1023\/A:1025780028846","volume":"42","author":"T. D. Kieu","year":"2003","unstructured":"Kieu, T. D. (2003). Quantum algorithm for Hilbert\u2019s tenth problem. International Journal of Theoretical Physics, 42, 1461\u20131478.","journal-title":"International Journal of Theoretical Physics"},{"key":"9317_CR38","unstructured":"Kieu, T. D. (2003). Quantum adiabatic algorithm for Hilbert\u2019s tenth problem: I. The algorithm. http:\/\/arxiv.org\/abs\/quant-ph\/0310052 ."},{"key":"9317_CR39","volume-title":"Introduction to metamathematics","author":"S. C. Kleene","year":"1952","unstructured":"Kleene, S. C. (1952). Introduction to metamathematics. Amsterdam: North-Holland."},{"key":"9317_CR40","volume-title":"Mathematical logic","author":"S. C. Kleene","year":"1967","unstructured":"Kleene, S. C. (1967). Mathematical logic. New York: Wiley."},{"key":"9317_CR41","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":"9317_CR42","doi-asserted-by":"crossref","first-page":"900","DOI":"10.2307\/2273108","volume":"47","author":"G. Kreisel","year":"1982","unstructured":"Kreisel, G. (1982). Review of Pour-El and Richards. Journal of Symbolic Logic, 47, 900\u2013902.","journal-title":"Journal of Symbolic Logic"},{"key":"9317_CR43","first-page":"305","volume":"81","author":"E. Losseva","year":"2003","unstructured":"Losseva, E. (2003). Building reliable systems from unreliable components and the DNA computing paradigm. Bulletin of the European Association for Theoretical Computer Science, 81, 305\u2013317.","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"key":"9317_CR44","volume-title":"New computational paradigms: Changing conceptions of what is computable","year":"2007","unstructured":"L\u00f6we, B., Sorbi, A., & Cooper, S. B. (Eds.). (2007). New computational paradigms: Changing conceptions of what is computable. Heidelberg: Springer."},{"key":"9317_CR45","volume-title":"Automata studies","year":"1956","unstructured":"McCarthy, J., & Shannon, C. E. (Eds.). (1956). Automata studies. Princeton, NJ: Princeton University Press."},{"key":"9317_CR46","unstructured":"Mok, W. (2009). How Twitter is scaling. https:\/\/waimingmok.wordpress.com\/2009\/06\/27\/how-twitter-is-scaling\/."},{"key":"9317_CR47","unstructured":"Nayebi, A. (2012). Fast matrix multiplication techniques based on the Adleman\u2013Lipton model. International Journal of Computer Engineering Research, 3, 10\u201319. Also available at: http:\/\/arxiv.org\/abs\/0912.0750 , December 2011."},{"key":"9317_CR48","unstructured":"Networked cyber-physical systems at SRI. http:\/\/ncps.csl.sri.com\/ ."},{"key":"9317_CR49","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511976667","volume-title":"Quantum computation and quantum information","author":"M. A. Nielsen","year":"2010","unstructured":"Nielsen, M. A., & Chuang, I. L. (2010). Quantum computation and quantum information. Cambridge: Cambridge University Press."},{"key":"9317_CR50","unstructured":"Odersky, M., Spoon, L., & Venners, B. (2008). Scala: A scalable language. http:\/\/www.artima.com\/scalazine\/articles\/scalable-language.html ."},{"key":"9317_CR52","unstructured":"Ord, T. (2002). Hypercomputation: Computing more than the Turing machine. Honours thesis. The University of Melbourne. http:\/\/arxiv.org\/abs\/math\/0209332 ."},{"key":"9317_CR51","unstructured":"OSL (2012). Open systems laboratory: Research. http:\/\/osl.cs.uiuc.edu\/research.php ."},{"key":"9317_CR53","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1006\/jcss.1999.1693","volume":"61","author":"G. P\u0103un","year":"2000","unstructured":"P\u0103un, G. (2000). Computing with membranes. Journal of Computer and System Sciences, 61, 108\u2013143.","journal-title":"Journal of Computer and System Sciences"},{"key":"9317_CR54","first-page":"75","volume":"6","author":"G. P\u0103un","year":"2001","unstructured":"P\u0103un, G. (2001). P systems with active membranes: Attacking NP-complete problems. Journal of Automata, Languages and Combinatorics, 6, 75\u201390.","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"9317_CR55","unstructured":"P\u0103un, G. (2003). Membrane computing. In Fundamentals of computation theory (Vol. 2751, pp. 177\u2013220). Lecture Notes in Computer Science."},{"key":"9317_CR56","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1093\/bjps\/axr016","volume":"62","author":"G. Piccinini","year":"2011","unstructured":"Piccinini, G. (2011). The physical Church\u2013Turing thesis: Modest or bold? British Journal for the Philosophy of Science, 62, 733\u2013769.","journal-title":"British Journal for the Philosophy of Science"},{"key":"9317_CR57","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1090\/S0002-9904-1944-08111-1","volume":"50","author":"E. L. Post","year":"1944","unstructured":"Post, E. L. (1944). Recursively enumerable sets of positive integers and their decision problems. Bulletin of the American Mathematical Society, 50, 284\u2013316.","journal-title":"Bulletin of the American Mathematical Society"},{"key":"9317_CR58","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":"9317_CR59","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-21717-7","volume-title":"Computability in analysis and physics","author":"M. B. Pour-El","year":"1989","unstructured":"Pour-El, M. B., & Richards, J. I. (1989). Computability in analysis and physics. Berlin: Springer."},{"key":"9317_CR60","doi-asserted-by":"crossref","first-page":"49","DOI":"10.2307\/2270581","volume":"30","author":"H. Putnam","year":"1965","unstructured":"Putnam, H. (1965). Trial and error predicates and the solution to a problem of Mostowski. Journal of Symbolic Logic, 30, 49\u201357.","journal-title":"Journal of Symbolic Logic"},{"key":"9317_CR61","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\u2013150.","journal-title":"Proceedings of the Aristotelian Society"},{"key":"9317_CR62","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":"9317_CR63","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\u2013Turing thesis. Minds and Machines, 13, 87\u2013101.","journal-title":"Minds and Machines"},{"key":"9317_CR64","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":"9317_CR65","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/s11047-011-9280-y","volume":"11","author":"O. Shagrir","year":"2012","unstructured":"Shagrir, O. (2012). Supertasks do not increase computational power. Natural Computing, 11, 51\u201358.","journal-title":"Natural Computing"},{"key":"9317_CR66","doi-asserted-by":"crossref","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P. W. Shor","year":"1997","unstructured":"Shor, P. W. (1997). Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26, 1484\u20131509.","journal-title":"SIAM Journal on Computing"},{"key":"9317_CR68","unstructured":"Sieg, W. (2002a). Calculations by man and machines: Conceptual analysis. In Sieg et al. (2002), pp. 396\u2013415."},{"key":"9317_CR70","unstructured":"Sieg, W. (2002b). Calculations by man and machine: Mathematical presentation. In Proceedings of the Cracow international congress of logic, methodology and philosophy of science. Synthese series (pp. 245\u2013260). Dordrecht: Kluwer."},{"key":"9317_CR71","unstructured":"Sieg, W. (2007). Church without dogma\u2014Axioms for computability. In L\u00f6we et al. (2007), pp. 18\u201344."},{"key":"9317_CR69","unstructured":"Sieg, W., Sommer, R., & Talcott, C. (Eds.). (2002). Reflections on the foundations of mathematics. Association for Symbolic Logic."},{"key":"9317_CR67","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. The Monist, 82, 150\u2013164.","journal-title":"The Monist"},{"key":"9317_CR72","doi-asserted-by":"crossref","first-page":"284","DOI":"10.2307\/420992","volume":"2","author":"R. I. Soare","year":"1996","unstructured":"Soare, R. I. (1996). Computability and recursion. Bulletin of Symbolic Logic, 2, 284\u2013321.","journal-title":"Bulletin of Symbolic Logic"},{"key":"9317_CR73","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1016\/j.apal.2009.01.008","volume":"160","author":"I. R. Soare","year":"2009","unstructured":"Soare, R. I. (2009). Turing oracle machines, online computing, and three displacements in computability theory. Annals of Pure and Applied Logic, 160, 368\u2013399.","journal-title":"Annals of Pure and Applied Logic"},{"key":"9317_CR74","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1016\/j.amc.2005.09.067","volume":"178","author":"M. Stannett","year":"2006","unstructured":"Stannett, M. (2006). The case for hypercomputation. Applied Mathematics and Computation, 178, 8\u201324.","journal-title":"Applied Mathematics and Computation"},{"key":"9317_CR75","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1007\/978-3-642-24933-4_7","volume":"7000","author":"M.-O. Stehr","year":"2011","unstructured":"Stehr, M.-O., Talcott, C., Rushby, J., Lincoln, P., Kim, M., Cheung, S., et\u00a0al. (2011). Fractionated software for networked cyber-physical systems: Research directions and long-term vision. Lecture Notes in Computer Science, Formal Modeling: Actors, Open Systems, Biological Systems, 7000, 110\u2013143.","journal-title":"Lecture Notes in Computer Science, Formal Modeling: Actors, Open Systems, Biological Systems"},{"key":"9317_CR76","unstructured":"Stothers, A. (2010). On the complexity of matrix multiplication. Ph.D. thesis. University of Edinburgh. http:\/\/www.maths.ed.ac.uk\/pg\/thesis\/stothers.pdf ."},{"key":"9317_CR77","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/BF02165411","volume":"13","author":"V. Strassen","year":"1969","unstructured":"Strassen, V. (1969). Gaussian elimination is not optimal. Numerische Mathematik, 13, 354\u2013356.","journal-title":"Numerische Mathematik"},{"key":"9317_CR78","volume-title":"Alan Turing: Life and legacy of a great thinker","year":"2004","unstructured":"Teuscher, C. (Ed.). (2004). Alan Turing: Life and legacy of a great thinker. Berlin: Springer."},{"key":"9317_CR79","doi-asserted-by":"crossref","unstructured":"Turing, A. M. (1936\u20131937). On computable numbers, with an application to the Entscheidungsproblem. (1938) Proceedings of the London Mathematical Society, 42, 230\u2013265 (On computable numbers, with an application to the Entscheidungsproblem. A correction. Proceedings of the London Mathematical Society, 43, 544\u2013546.","DOI":"10.1112\/plms\/s2-43.6.544"},{"key":"9317_CR80","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1112\/plms\/s2-45.1.161","volume":"45","author":"A. M. Turing","year":"1939","unstructured":"Turing, A. M. (1939). Systems of logic based on ordinals. Proceedings of the London Mathematical Society, 45, 161\u2013228.","journal-title":"Proceedings of the London Mathematical Society"},{"key":"9317_CR81","unstructured":"Turing, A. M. (1948). Intelligent machinery. In Ince (1992), pp. 107\u2013127. Amsterdam: Elsevier Science."},{"key":"9317_CR83","volume-title":"From mathematics to philosophy","author":"H. Wang","year":"1974","unstructured":"Wang, H. (1974). From mathematics to philosophy. London: Routledge and Kegan Paul."},{"key":"9317_CR84","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1145\/253769.253801","volume":"40","author":"P. Wegner","year":"1997","unstructured":"Wegner, P. (1997). Why interaction is more powerful than algorithms. Communications of the ACM, 40, 81\u201391.","journal-title":"Communications of the ACM"},{"key":"9317_CR85","unstructured":"Weyl, H. (1928). Philosophie der Mathematik und Natureissenschaft. M\u00fcnchen; und Berlin: R. Oldenbourg (German). Philosophy of mathematics and natural science. Princeton: Princeton University Press, 1949 (English version)."},{"key":"9317_CR86","unstructured":"Williams, V. V. (2011). Breaking the Coppersmith\u2013Winograd barrier. http:\/\/www.cs.berkeley.edu\/~virgi\/matrixmult.pdf."}],"container-title":["Minds and Machines"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11023-013-9317-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11023-013-9317-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11023-013-9317-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,14]],"date-time":"2024-05-14T21:13:14Z","timestamp":1715721194000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11023-013-9317-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,18]]},"references-count":86,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["9317"],"URL":"https:\/\/doi.org\/10.1007\/s11023-013-9317-3","relation":{},"ISSN":["0924-6495","1572-8641"],"issn-type":[{"value":"0924-6495","type":"print"},{"value":"1572-8641","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7,18]]}}}