Computers Aren’t Syntax All the Way Down or Content All the Way Up
- 142 Downloads
This paper argues that the idea of a computer is unique. Calculators and analog computers are not different ideas about computers, and nature does not compute by itself. Computers, once clearly defined in all their terms and mechanisms, rather than enumerated by behavioral examples, can be more than instrumental tools in science, and more than source of analogies and taxonomies in philosophy. They can help us understand semantic content and its relation to form. This can be achieved because they have the potential to do more than calculators, which are computers that are designed not to learn. Today’s computers are not designed to learn; rather, they are designed to support learning; therefore, any theory of content tested by computers that currently exist must be of an empirical, rather than a formal nature. If they are designed someday to learn, we will see a change in roles, requiring an empirical theory about the Turing architecture’s content, using the primitives of learning machines. This way of thinking, which I call the intensional view of computers, avoids the problems of analogies between minds and computers. It focuses on the constitutive properties of computers, such as showing clearly how they can help us avoid the infinite regress in interpretation, and how we can clarify the terms of the suggested mechanisms to facilitate a useful debate. Within the intensional view, syntax and content in the context of computers become two ends of physically realizing correspondence problems in various domains.
KeywordsComputer Explanation Semantic content Learning computers Correspondence problem
I thank five reviewers of Minds and Machines for their comments, which significantly improved the paper. Thanks also to Halit Oğuztüzün and Umut Özge for feedback on an earlier draft, which led to some new sections, and to Vincent Nunney for last minute help with some pieces of text. All errors and misunderstandings are mine.
- Aaronson, S. (2013). Why philosophers should care about computational complexity. In B. J. Copeland, C. J. Posy, & O. Shagrir (Eds.), Computability: Turing, Gödel, Church, and beyond. Cambridge: MIT Press.Google Scholar
- ACM. (2012). ACM turing centenary celebration. Association for Computing Machinery, June 15–16, San Francisco. http://turing100.acm.org/.
- Block, N. (1978). Troubles with functionalism. In C. W. Savage (Ed.), Minnesota studies in the philosophy of science. Minneapolis: University of Minnesota Press.Google Scholar
- Bozşahin, C. (2016). What is a computational constraint? In V. C. Müller (Ed.), Computing and philosophy. Synthese Library 375 (pp. 3–16). Heidelberg: Springer.Google Scholar
- Bringsjord, S., & Taylor. J. (2005). An argument for \(P=NP\). arXiv:cs/0406056.
- Bryant, P. E. (1974). Perception and understanding in young children. New York: Basic Book.Google Scholar
- Cariani, P. (1998). Epistemic autonomy through adaptive sensing. In Intelligent control (ISIC). Held jointly with IEEE international symposium on computational intelligence in robotics and automation (CIRA), Intelligent systems and semiotics (ISAS) (pp. 718–723).Google Scholar
- Dennett, D. C. (1991). Consciousness explained. New York: Little Brown & Co.Google Scholar
- Fodor, J. (1975). The language of thought. Cambridge, MA: Harvard.Google Scholar
- Gleitman, L. R., & Elissa, L. N. (1995). The invention of language by children: Environmental and biological influences on the acquisition of language. In L. R. Gleitman & M. Liberman (Eds.), Language: An invitation to cognitive science (2nd ed., pp. 1–24). Cambridge, MA: MIT Press.Google Scholar
- Graham, P. (1994). On Lisp. Englewood Cliffs, NJ: Prentice Hall.Google Scholar
- Hoyte, D. (2008). Let over lambda. HCSW and Hoytech. Doug Hoyte. ISBN 9781435712751.Google Scholar
- Keller, H. (1905). The story of my life. Garden City, NY: Doubleday.Google Scholar
- Knuth, D. E. (2014). Twenty questions for Donald Knuth. http://www.informit.com/articles/article.aspx?p=2213858. Accessed 1 June 2017.
- Lenneberg, E. H. (1967). The biological foundations of language. New York: Wiley.Google Scholar
- Lewis, H. R., & Papadimitriou, C. H. (1998). Elements of the theory of computation (2nd ed.). New Jersey: Prentice-Hall.Google Scholar
- Pask, G. (1968). Colloquy of mobiles. London: ICA.Google Scholar
- Pitowsky, I. (1990). The physical Church thesis and physical computational complexity. Iyyun: The Jerusalem Philosophical Quarterly, 39, 81–99.Google Scholar
- Preston, J. (2002). Introduction. In Preston and Bishop (2002).Google Scholar
- Ross, J. R. (1967). Constraints on variables in syntax. Ph.D. dissertation, MIT. Published as Ross 1986.Google Scholar
- Ross, J. R. (1986). Infinite syntax!. Norton, NJ: Ablex.Google Scholar
- Searle, J. R. (2001). Chinese Room argument. In R. A. Wilson & F. C. Keil (Eds.), The MIT encyclopedia of the cognitive sciences (pp. 115–116). Cambridge, MA: MIT Press.Google Scholar
- Searle, J. R. (2002). Twenty-one years in the Chinese Room. In Preston and Bishop (2002).Google Scholar
- Simon, H. (1969). The sciences of the artificial. Cambridge: MIT Press.Google Scholar