# Information Processing as an Account of Concrete Digital Computation

- 175 Downloads
- 4 Citations

## Abstract

It is common in cognitive science to equate computation (and in particular digital computation) with information processing. Yet, it is hard to find a comprehensive explicit account of concrete digital computation in information processing terms. An information processing account seems like a natural candidate to explain digital computation. But when ‘information’ comes under scrutiny, this account becomes a less obvious candidate. Four interpretations of information are examined here as the basis for an *information processing* account of digital computation, namely Shannon information, algorithmic information, factual information and instructional information. I argue that any plausible account of concrete computation has to be capable of explaining at least the three key algorithmic notions of input, output and procedures. Whist algorithmic information fares better than Shannon information, the most plausible candidate for an information processing account is instructional information.

## Keywords

Concrete digital computation Turing machines Algorithmic information Shannon information Factual information Instructional information Cognitive science Algorithm Program## Notes

### Acknowledgements

Part of this research was done during a visiting fellowship at the IAS-STS in Graz, Austria in 2011. Thanks to Gualtiero Piccinini, Oron Shagrir and Matt Johnson for useful comments on earlier drafts of this paper. I have greatly benefited from discussions with Naftali Tishby and Karl Posch on the mathematical theory of information and with Cristian Calude on algorithmic information theory and for that I am grateful. I would also like to express my gratitude to both Graham White and Marty Wolf, who refereed the paper and agreed to drop their anonymity in the process. Their insightful comments helped reshape and improve this paper significantly. I am indebted to Phillip Staines for his detailed comments and ongoing support. Earlier versions of this paper were presented at the 2010 AAPNZ conference in Hamilton, NZ, the 2011 AISB convention in York, UK and the IAS-STS fellowship colloquium in Graz, Austria. All the people mentioned above contributed to the final draft of the paper, but I am responsible for any remaining mistakes. This paper is dedicated in loving memory of Moshe Bensal.

## References

- Abramsky, S., Jagadeesan, R., & Malacaria, P. (2000). Full abstraction for PCF.
*Information and Computation, 163*, 409–470.CrossRefGoogle Scholar - Adriaans, P. (2008). Learning and the cooperative computational universe. In P. Adriaans & J. van Benthem (Eds.),
*Handbook of the philosophy of science, volume 8: philosophy of information, pp. 133–167*. New York: Elsevier.Google Scholar - Agassi, J. (1988). Winter 1988 Daedalus.
*SIGArt newsletter, 105*, 15–22.CrossRefGoogle Scholar - Agassi, J. (2003). Newell’s list. Commentary on Anderson, J. & Lebiere, C.: The Newell test for a theory of cognition.
*Behavioural and brain sciences, 26*, 601–602.CrossRefGoogle Scholar - Barwise, J., & Seligman, J. (1997).
*Information flow: the logic of distributed systems*. Cambridge: Cambridge University Press.CrossRefGoogle Scholar - Broderick, P. B. (2004). On communication and computation.
*Minds and Machines, 14*, 1–19.CrossRefGoogle Scholar - Calude, C. S. (1988). Theories of computational complexity. Elsevier Science.Google Scholar
- Calude, C. S. (2002). Information and randomness: an algorithmic perspective. 2nd edition. Springer.Google Scholar
- Calude, C. S. (2009). Information: the algorithmic paradigm. In G. Sommaruga (Ed.),
*Formal theories of information*. New York: Springer.Google Scholar - Calude, C. S., Salomaa K., Roblot, T. K. (2011). Finite state complexity.
*Theoretical Computer Science, 412*, 5668–5677.Google Scholar - Carnap, R., & Bar-Hillel, Y. (1952). An outline of a theory of semantic information. MIT Research Laboratory of Electronics, Technical Report No. 247. Cambridge, MA: MIT.Google Scholar
- Chaitin, G. J. (2003). Algorithmic information theory. 3rd Printing. Cambridge University Press.Google Scholar
- Chaitin, G. J. (2007).
*Thinking about Gödel & Turing: essays on complexity, 1970–2007*. Singapoer: World Scientific.CrossRefGoogle Scholar - Cordeschi, R. (2004). Cybernetics. In L. Floridi (Ed.),
*The Blackwell guide to philosophy of computing and information*(pp. 186–196). Oxford: Blackwell.Google Scholar - Corning, P. A. (2001). “Control information”: the missing element in Norbert Wiener’s cybernetic paradigm?
*Kybernetes, 30*, 1272–1288.CrossRefGoogle Scholar - Dennett, D. C. (1991).
*Consciousness explained*. Boston, MA: Little, Brown.Google Scholar - Dershowitz, N., & Gurevich, Y. (2008). A natural axiomatization of computability and proof of Church’s thesis.
*The Bulletin of Symbolic Logic, 14*, 299–350.CrossRefGoogle Scholar - Downey, R. G., & Hirschfeldt, D. R. (2010).
*Algorithmic randomness and complexity*. NY: Springer.CrossRefGoogle Scholar - Dretske, F. I. (1981).
*Knowledge and the flow of information*. Cambridge, MA: The MIT Press.Google Scholar - Dretske, F. I. (1993). Can intelligence be artificial?
*Philosophical studies, 71*, 201–216.CrossRefGoogle Scholar - Dreyfus, H. L. (1979).
*What computers can't do: the limits of artificial intelligence*(2nd ed.). NY: Harper & Row.Google Scholar - Dunn, M. (2008). Information in computer science. In P. Adriaans & J. van Benthem (Eds.),
*Handbook of the philosophy of science, volume 8: philosophy of information, pp. 581-608*. New York: Elsevier.Google Scholar - Fetzer, J. H. (2004). Information: does it have to be true?
*Minds and Machines, 14*, 223–229.CrossRefGoogle Scholar - Feynman, R. P. (1996).
*The Feynman lectures on computation*. Reading, MA: Addison-Wesley.Google Scholar - Floridi, L. (2005).
*Is semantic information meaningful data?*(pp. 351–370). LXX: Philosophy and Phenomenological Research.Google Scholar - Floridi, L. (2008). Trends in the philosophy of information. In P. Adriaans & J. van Benthem (Eds.),
*Handbook of the philosophy of science, volume 8: philosophy of information, pp. 113–131*. New York: Elsevier.Google Scholar - Floridi, L. (2009). Philosophical conceptions of information. In G. Sommaruga (Ed.),
*Formal theories of information*(pp. 13–53). Berlin: Springer.CrossRefGoogle Scholar - Floridi, L. (2011).
*The philosophy of information*. Oxford, UK: Oxford University Press.CrossRefGoogle Scholar - Fresco, N. (2008). An analysis of the criteria for evaluating adequate theories of computation.
*Minds and Machines, 18*, 379–401.CrossRefGoogle Scholar - Fresco, N. (2010). A computational account of connectionist networks.
*Recent Patents on Computer Science, 3*, 20–27.CrossRefGoogle Scholar - Fresco, N. (2011). Concrete digital computation: what does it take for a physical system to compute?
*Journal of Logic, Language and Information, 20*, 513–537.CrossRefGoogle Scholar - Gettier, E. L. (1963). Is justified true belief knowledge?
*Analysis, 23*, 121–123.Google Scholar - Gruenberger, F. (1976). Bug. In A. Ralston (eds.) Encyclopedia of computer science. p. 189. NY: Van Nostrand Reinhold.Google Scholar
- Harnad, S. (1990). The symbol grounding problem.
*Physica, 42*, 335–346.Google Scholar - Hintikka, J. (1984). Some varieties of information.
*Information processing and management, 20*, 175–181.CrossRefGoogle Scholar - Karnani, M., Pääkkönen, K., & Annila, A. (2009). The physical character of information.
*Proceedings of the Royal Society, A, 465*, 2155–2175. doi: 10.1098/rspa.2009.0063.CrossRefGoogle Scholar - Larsson, S., Lüders, F. (2004). On the concept of information in industrial control systems. In the proceedings of the National Course in Philosophy of Computer Science, pp. 1–6.Google Scholar
- Malacaria, P. (2007). Assessing security threat of looping constructs. In the Proceedings of 34
^{th}ACM Symposium on Principles of Programming Languages, pp. 225–235.Google Scholar - Penrose, R. (1989).
*The emperor’s new mind*. London: Oxford University Press.Google Scholar - Piccinini, G. (2007). Computing mechanisms.
*Philosophy of Science, 74*, 501–526.CrossRefGoogle Scholar - Piccinini, G., & Scarantino, A. (2011). Information processing, computation, and cognition.
*Journal of Biological Physics, 37*, 1–38.CrossRefGoogle Scholar - Ralston, A. (1976). Encyclopedia of computer science. 1st edition. Petrocelli Books.Google Scholar
- Scarantino, A., & Piccinini, G. (2010). Information without truth.
*Metaphilosophy, 41*, 313–330.CrossRefGoogle Scholar - Shannon, C. E. (1948). A mathematical theory of communication.
*Mobile Computing and Communications Review, 5*, 1–55.Google Scholar - Smith, B. C. (2002). The foundations of computing. In M. Scheutz (Ed.),
*Computationalism: new directions*(pp. 23–58). Cambridge, MA: The MIT Press.Google Scholar - Soare, R. (2007). Computability and incomputability. In S. B. Cooper, B. Löwe, & A. Sorbi (Eds.),
*Proceedings of the third conference on Computability in Europe, Lecture Notes in Computer Science, 4497*(pp. 705–715). Berlin: Springer.Google Scholar - Sorensen, R. (2007). Can the dead speak? In S. Nuccentelli and G. Seay (Eds.) Themes from G. E. Moore: new essays in epistemology and ethics. New York: Oxford University Press.Google Scholar
- Turing, A. M. (1950).
*Computing machinery and intelligence*(pp. 433–460). LIX: Mind.Google Scholar - Wang, H. (1974).
*From mathematics to philosophy*. New York: Humanities Press.Google Scholar - White, G. (2011). Descartes among the robots: computer science and the inner/outer distinction.
*Minds and Machines, 21*, 179–202.CrossRefGoogle Scholar - Wiener, N. (1948).
*Cybernetics: or control and communication in the animal and the machine*. Cambridge: The MIT Press.Google Scholar - Wiener, N. (1966). God and Golem, Inc.: a comment on certain points where cybernetics impinges on religion. Cambridge: The MIT Press.Google Scholar