Abstract
In this chapter, we examine three fairly recent accounts of computation with at least one common characteristic, namely, that they do not posit any extrinsic representational properties. These accounts imply that concrete digital computing systems can be individuated by either their causal properties or their functional/organisational properties.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Copeland, B.J.: What is computation? Synthese 108(3), 335–359 (1996), doi:10.1007/BF00413693
Copeland, B.J.: The Broad Conception of Computation. American Behavioral Scientist 40(6), 690–716 (1997), doi:10.1177/0002764297040006003
Copeland, B.J.: Hypercomputation. Minds and Machines 12(4), 461–502 (2002), doi:10.1023/A:1021105915386
Copeland, B.J., Shagrir, O.: Physical Computation: How General are Gandy’s Principles for Mechanisms? Minds and Machines 17(2), 217–231 (2007), doi:10.1007/s11023-007-9058-2
Copeland, B.J., Sylvan, R.: Beyond the universal Turing machine. Australasian Journal of Philosophy 77(1), 46–66 (1999), doi:10.1080/00048409912348801
Cummins, R.: Programs in the Explanation of Behavior. Philosophy of Science 44(2), 269–287 (1977), doi:10.1086/288742
Cummins, R.: Meaning and mental representation. MIT Press, Cambridge (1989)
Cummins, R.: Systematicity. The Journal of Philosophy 93(12), 591–614 (1996), doi:10.2307/2941118
Cummins, R.: The world in the head. Oxford University Press, Oxford (2010)
Davies, E.B.: Building Infinite Machines. The British Journal for the Philosophy of Science 52(4), 671–682 (2001), doi:10.1093/bjps/52.4.671
Dowek, G.: Around the Physical Church-Turing Thesis: Cellular Automata, Formal Languages, and the Principles of Quantum Theory. In: Dediu, A.-H., MartÃn-Vide, C. (eds.) LATA 2012. LNCS, vol. 7183, pp. 21–37. Springer, Heidelberg (2012)
Fresco, N., Wolf, M.J.: The instructional information processing account of digital computation (forthcoming) Synthese, doi:10.1007/s11229-013-0338-5
Gandy, R.: Church’s Thesis and Principles for Mechanisms. In: The Kleene Symposium, pp. 123–148. North-Holland (1980)
Gibbs, N.E., Tucker, A.B.: A model curriculum for a liberal arts degree in computer science. Communications of the ACM 29(3), 202–210 (1986), doi:10.1145/5666.5667
Gurevich, Y.: Algorithms in the world of bounded resources. In: Herken, R. (ed.) A Half-century Survey on the Universal Turing Machine, pp. 407–416. Oxford University Press, New York (1988)
Gurevich, Y.: What Is an Algorithm? In: Bieliková, M., Friedrich, G., Gottlob, G., Katzenbeisser, S., Turán, G. (eds.) SOFSEM 2012. LNCS, vol. 7147, pp. 31–42. Springer, Heidelberg (2012a)
Gurevich, Y.: Foundational Analyses of Computation. In: Cooper, S.B., Dawar, A., Löwe, B. (eds.) CiE 2012. LNCS, vol. 7318, pp. 264–275. Springer, Heidelberg (2012b)
Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to automata theory, languages, and computation. Addison-Wesley, Boston (2001)
Machtey, M., Young, P.: An introduction to the general theory of algorithms. North-Holland, New York (1978)
Moschovakis, Y.N.: On founding the theory of algorithms. In: Dales, H.G., Oliveri, G. (eds.) Truth in Mathematics, pp. 71–104. Clarendon Press, Oxford (1998)
Moschovakis, Y.N., Paschalis, V.: Elementary Algorithms and Their Implementations. In: Cooper, S.B., Löwe, B., Sorbi, A. (eds.) New Computational Paradigms, pp. 87–118. Springer, New York (2008)
Piccinini, G.: Computing mechanisms. Philosophy of Science 74(4), 501–526 (2007), doi:10.1086/522851
Piccinini, G.: Computers. Pacific Philosophical Quarterly 89(1), 32–73 (2008a), doi:10.1111/j.1468-0114.2008.00309.x
Piccinini, G.: Some neural networks compute, others don’t. Neural Networks 21(2-3), 311–321 (2008b), doi:10.1016/j.neunet.2007.12.010
Piccinini, G., Scarantino, A.: Information processing, computation, and cognition. Journal of Biological Physics 37(1), 1–38 (2011)
Scarantino, A., Piccinini, G.: Information without truth. Metaphilosophy 41(3), 313–330 (2010), doi:10.1111/j.1467-9973.2010.01632.x
Scheutz, M.: Do Walls Compute After All? Challenging Copeland’s Solution to Searle’s Theorem Against Strong AI. In: Proceedings of the 9th Midwest AI and Cognitive Science Conference, pp. 43–49. AAAI Press (1998)
Scheutz, M.: When Physical Systems Realize Functions... Minds and Machines 9(2), 161–196 (1999), doi:10.1023/A:1008364332419
Shagrir, O.: Effective Computation by Humans and Machines. Minds and Machines 12(2), 221–240 (2002), doi:10.1023/A:1015694932257
Sieg, W.: On mind & Turing’s machines. Natural Computing 6(2), 187–205 (2007), doi:10.1007/s11047-006-9021-9
Sieg, W.: Church Without Dogma: Axioms for Computability. In: Cooper, S.B., Löwe, B., Sorbi, A. (eds.) New Computational Paradigms, pp. 139–152. Springer, New York (2008)
Sieg, W., Byrnes, J.: An abstract model for parallel computations: Gandy’s thesis. The Monist 82(1), 150–164 (1999)
Turing, A.M.: On Computable Numbers, with an Application to the Entscheidungsproblem. Proceedings of the London Mathematical Society s2-42(1), 230–265 (1936), doi:10.1112/plms/s2-42.1.230
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Fresco, N. (2014). Causal and Functional Accounts of Computation Examined. In: Physical Computation and Cognitive Science. Studies in Applied Philosophy, Epistemology and Rational Ethics, vol 12. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41375-9_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-41375-9_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41374-2
Online ISBN: 978-3-642-41375-9
eBook Packages: EngineeringEngineering (R0)