Abstract
Recently, Horsman et al. (Proc R Soc Lond A 470:20140182, 2014) have proposed a new framework, Abstraction/Representation (AR) theory, for understanding and evaluating claims about unconventional or non-standard computation. Among its attractive features, the theory in particular implies a novel account of what is means to be a computer. After expounding on this account, I compare it with other accounts of concrete computation, finding that it does not quite fit in the standard categorization: while it is most similar to some semantic accounts, it is not itself a semantic account. Then I evaluate it according to the six desiderata for accounts of concrete computation proposed by Piccinini (Physical computation: a mechanistic account, Oxford University Press, Oxford, 2015). Finding that it does not clearly satisfy some of them, I propose a modification, which I call Agential AR theory, that does, yielding an account that could be a serious competitor to other leading account of concrete computation.
Similar content being viewed by others
Notes
Note the similarity between a representation and a “partial” functor between categories. Horsman (2015, p. 10) raises the possibility of giving a categorical interpretation of AR theory but does not pursue it. Similarly, I also urge its pursuit, but in future work. (See also footnote 5.)
Horsman (2015, 2017) and Horsman et al. (2017b) essentially define a theory to be a set of representation relations, but this immediately leads to difficulties accounting for how theories can make claims about possible but not actual concrete situations: such situations are simply not in the domain of physical object states. But this problem can be avoided if one simply assumes that, whatever theories are, they provide representation relations for a wide range of domains, including possible but not actual physical states.
In fact, it’s not clear that all aspects of AR theory are compatible with the structuralist accounts of scientific representation given by van Fraassen (2008), who takes representations to entail the proposal or assertion of an hypothesis that there is an isomorphic embedding of the abstract model into the concrete target of the representation. For AR theory, a representation relation is a map from the concrete to the abstract: it’s just the wrong kind of relation to be an isomorphic embedding. Perhaps a structuralist account of representation for AR theory would make the representation relation a homomorphism, but I won’t pursue this question here.
One might describe this with an approximately commuting diagram—see footnote 1 for more on the connection with category theory. Also cf. Corless and Fillion (2014, p. 30), who attribute the idea of an approximately commuting diagram to describe representation in the context of numerical computing to Robidoux (2002, Chap. 6).
One could say in such cases that the function \(C_\mathcal {T} = \mathcal {R_T}(\mathbf {H})\) is the corresponding “abstract evolution” (Horsman 2015, p. 4), but this should be understood metaphorically: since abstract objects do not exist in time they cannot literally evolve.
See also Horsman (2017, p. 198).
They continue, “We almost never talk about ‘information’ or ‘knowledge’ or ‘meaning’ in using AR theory” but this seems to be an overstatement on at least one count: “information” is used in the context of discussing AR theory on several occasions in the same paper (Horsman et al. 2018, pp. 138, 142, 148) and elsewhere. Perhaps it is best to interpret these positive usages as information in the mathematical sense (Shannon and Weaver 1949), devoid of semantic content.
In the interests of facilitating reference throughout this section, I have separated the desiderata by line breaks in the following quote instead of listing them in-line.
A third sense is the so-called “value-free ideal” of having no social, moral, or political value impinge on scientific method or product.
Horsman et al. (2017b) also do so for chemotaxis in bacteria and DNA, but these cases less plausibly fall under the category of intuitively evaluable computations.
There is always some valid theory for any domain, namely, the one whose representation maps each physical system to the same abstract object—this is the constant representation. However, we must assume here some theory whose representation relation has a range with an infinite cardinality. Unless the physical domain \(\mathbf {P}\) is much simpler than it appears, this will be easily satisfied.
Another option would be to restrict the admissible representations or encodings directly, although to avoid being ad hoc this would move AR theory in the direction of a syntactic account of concrete computation. I won’t pursue that option here, since it is inimical to the motivations for AR theory for understanding unconventional computation, as discussed in Sect. 3.
I am writing as if there could be only one agential community—a group of objects considered as agents simpliciter—presumably the one in which we are included. There could be, however, as many distinct such communities as there are groups with different shared capabilities for abstraction and representation, observation and prediction, and theorizing and confirmation. Thus one can think about agential communities as a sort of epistemic community (van Fraassen 1980, pp. 18–19), of which there can be many and which can in principle change over time (van Fraassen 2005). But delineating the extent and multitude of these boundaries is not necessary for AAR theory: it is always applied relative to some such community, of which we can at least identify a prototypical or otherwise representative member.
This would follow from one view of cognitive science’s status as a science. Failing that, however, one could always conservatively restrict to humans.
References
Bueno, O. (2014). Nominalism in the philosophy of mathematics. In E. N. Zalta (Ed.), The Stanford Encyclopedia of Philosophy. Metaphysics Research Lab, Stanford University, Spring 2014 edition.
Chakravartty, A. (2017). Scientific realism. In E. N. Zalta (Ed.), The Stanford Encyclopedia of Philosophy. Metaphysics Research Lab, Stanford University, Summer 2017 edition.
Chalmers, D. J. (1996). Does a rock implement every finite-state automaton? Synthese, 108(3), 310–333.
Copeland, B. J. (1996). What is computation? Synthese, 108(3), 335–359.
Corless, R., & Fillion, N. (2014). A graduate introduction to numerical methods. New York: Springer.
Egan, F. (1999). In defence of narrow mindedness. Mind and Language, 14(2), 177–94.
Fodor, J. A. (1975). The language of thought. Cambridge, MA: Harvard University Press.
Fodor, J. A. (1981). The mind–body problem. Scientific American, 244, 114–125.
Frege, G. (1953). Foundations of arithmetic (J. L. Austin, Trans). Oxford: Blackwell.
Frigg, R., & Nguyen, J. (2016). Scientific representation. In E. N. Zalta (Ed.), The Stanford Encyclopedia of Philosophy. Metaphysics Research Lab, Stanford University, Winter 2016 edition.
Horsman, C., Stepney, S., Wagner, R. C., & Kendon, V. (2014). When does a physical system compute? Proceedings of the Royal Society of London A, 470, 20140182.
Horsman, D. (2017). The representation of computation in physical systems. In M. Massimi, J.-W. Romeijn, & G. Schurz (Eds.), EPSA15 selected papers (pp. 191–204). Cham: Springer.
Horsman, D., Kendon, V., & Stepney, S. (2017a). The natural science of computing. Communications of the ACM, 60(8), 31–34.
Horsman, D., Kendon, V., & Stepney, S. (2018). Abstraction/representation theory and the natural science of computation. In M. E. Cuffaro & S. C. Fletcher (Eds.), Physical perspectives on computation, computational perspectives on physics (pp. 127–149). Cambridge: Cambridge University Press.
Horsman, D., Kendon, V., Stepney, S., & Young, J. P. W. (2017b). Abstraction and representation in living organisms: When does a biological system compute? In G. Dodig-Crnkovic & R. Giovagnoli (Eds.), Representation and reality in humans, other living organisms and intelligent machines (pp. 91–116). Cham: Springer International Publishing.
Horsman, D. C. (2015). Abstraction/representation theory for heterotic physical computing. Philosophical Transactions of the Royal Society of London A, 373, 20140224.
Linnebo, Ø. (2018). Platonism in the philosophy of mathematics. In E. N. Zalta (Ed.), The Stanford Encyclopedia of Philosophy. Metaphysics Research Lab, Stanford University, Spring 2018 edition.
Lintott, C. J., Schawinski, K., Slosar, A., Land, K., Bamford, S., Thomas, D., et al. (2008). Galaxy zoo: Morphologies derived from visual inspection of galaxies from the Sloan Digital Sky Survey. Monthly Notices of the Royal Astronomical Society, 389(3), 1179–1189.
Maroney, O. J. E., & Timpson, C. G. (2018). How is there a physics of information? On characterizing physical evolution as information processing. In M. E. Cuffaro & S. C. Fletcher (Eds.), Physical perspectives on computation, computational perspectives on physics (pp. 103–126). Cambridge: Cambridge University Press.
Maudlin, T. (1989). Computation and consciousness. Journal of Philosophy, 86(8), 407–432.
Monton, B., & Mohler, C. (2017). Constructive empiricism. In E. N. Zalta (Ed.), The Stanford Encyclopedia of Philosophy. Metaphysics Research Lab, Stanford University, Summer 2017 edition.
Piccinini, G. (2007). Computing mechanisms. Philosophy of Science, 74(4), 501–526.
Piccinini, G. (2015). Physical computation: A mechanistic account. Oxford: Oxford University Press.
Piccinini, G. (2017). Computation in physical systems. In E. N. Zalta (Ed.), The Stanford Encyclopedia of Philosophy. Metaphysics Research Lab, Stanford University, Summer 2017 edition.
Putnam, H. (1960). Minds and machines. In S. Hook (Ed.), Dimensions of mind: A symposium (pp. 138–164). New York: Collier.
Quine, W. (1969). Existence and quantification. Ontological relativity and other essays (pp. 91–113). New York: Columbia University Press.
Reiss, J., & Sprenger, J. (2017). Scientific objectivity. In E. N. Zalta (Ed.), The Stanford Encyclopedia of Philosophy. Metaphysics Research Lab, Stanford University, Winter 2017 edition.
Robidoux, N. (2002). Numerical solution of the steady diffusion equation with discontinuous coefficients. Ph.D. thesis, University of New Mexico.
Shagrir, O. (2006). Why we view the brain as a computer. Synthese, 153(3), 393–416.
Shannon, C. E., & Weaver, W. (1949). The mathematical theory of communication. Urbana, IL: University of Illinois Press.
Suárez, M. (2003). Scientific representation: Against similarity and isomorphism. International Studies in the Philosophy of Science, 17(3), 225–44.
Sutner, K. (2018). Physics-like models of computation. In M. E. Cuffaro & S. C. Fletcher (Eds.), Physical perspectives on computation, computational perspectives on physics (pp. 151–171). Cambridge: Cambridge University Press.
Tedre, M. (2011). Computing as a science: A survey of competing viewpoints. Minds and Machines, 21(3), 361–387.
van Fraassen, B. C. (1980). The scientific image. Oxford: Oxford University Press.
van Fraassen, B. C. (2005). The day of the dolphins: Puzzling over epistemic partnership. In A. Irvine & K. Peacock (Eds.), Mistakes of reason: Essays in honour of John Woods (pp. 111–133). Toronto: University of Toronto Press.
van Fraassen, B. C. (2008). Scientific representation: Paradoxes of perspective. Oxford: Oxford University Press.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Fletcher, S.C. Computers in Abstraction/Representation Theory. Minds & Machines 28, 445–463 (2018). https://doi.org/10.1007/s11023-018-9470-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11023-018-9470-9