Advertisement

Minds and Machines

, Volume 28, Issue 3, pp 543–567 | Cite as

Computers Aren’t Syntax All the Way Down or Content All the Way Up

  • Cem Bozşahin
Article
  • 142 Downloads

Abstract

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.

Keywords

Computer Explanation Semantic content Learning computers Correspondence problem 

Notes

Acknowledgements

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.

References

  1. Aaronson, S. (2005). Guest column: NP-complete problems and physical reality. ACM SIGACT News, 36(1), 30–52.CrossRefGoogle Scholar
  2. 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
  3. Abend, O., Kwiatkowski, T., Smith, N., Goldwater, S., & Steedman, Mark. (2017). Bootstrapping language acquisition. Cognition, 164, 116–143.CrossRefGoogle Scholar
  4. ACM. (2012). ACM turing centenary celebration. Association for Computing Machinery, June 15–16, San Francisco. http://turing100.acm.org/.
  5. Bickhard, M. H. (1996). Troubles with computationalism. In W. O’Donohue & R. Kitchener (Eds.), Philosophy of psychology (pp. 173–183). London: Sage.CrossRefGoogle Scholar
  6. 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
  7. 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
  8. Bringsjord, S., & Taylor. J. (2005). An argument for \(P=NP\). arXiv:cs/0406056.
  9. Bryant, P. E. (1974). Perception and understanding in young children. New York: Basic Book.Google Scholar
  10. Burgin, M. (2001). How we know what technology can do. Communications of the ACM, 44(11), 82–88.CrossRefGoogle Scholar
  11. 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
  12. Cockshott, P., Mackenzie, L. M., & Michaelson, G. (2012). Computation and its limits. Oxford: Oxford University Press.zbMATHGoogle Scholar
  13. Copeland, B. J. (2002). Hypercomputation. Minds and Machines, 12(4), 461–502.CrossRefzbMATHGoogle Scholar
  14. Copeland, B. J., & Shagrir, O. (2011). Do accelerating Turing machines compute the uncomputable? Minds and Machines, 21(2), 221–239.CrossRefGoogle Scholar
  15. Curtiss, S., Fromkin, V., Krashen, S., Rigler, D., & Rigler, M. (1974). The linguistic development of Genie. Language, 50(3), 528–554.CrossRefGoogle Scholar
  16. Dennett, D. C. (1971). Intentional systems. The Journal of Philosophy, 68(4), 87–106.CrossRefGoogle Scholar
  17. Dennett, D. C. (1991). Consciousness explained. New York: Little Brown & Co.Google Scholar
  18. Dewdney, A. K. (1984). On the spaghetti computer and other analog gadgets for problem solving. Scientific American, 250(6), 19–26.CrossRefGoogle Scholar
  19. Fodor, J. (1975). The language of thought. Cambridge, MA: Harvard.Google Scholar
  20. Ford, J. (2011). Helen Keller was never in a Chinese Room. Minds and Machines, 21(1), 57–72.CrossRefGoogle Scholar
  21. Fortnow, L. (2013). The golden ticket: P, NP, and the search for the impossible. Princeton: Princeton University Press.CrossRefzbMATHGoogle Scholar
  22. Fromkin, V., Krashen, S., Curtiss, S., Rigler, D., & Rigler, M. (1974). The development of language in Genie: A case of language acquisition beyond the “critical period”. Brain and Language, 1(1), 81–107.CrossRefGoogle Scholar
  23. Gandy, R. (1980). Church’s thesis and principles for mechanisms. Studies in Logic and the Foundations of Mathematics, 101, 123–148.MathSciNetCrossRefzbMATHGoogle Scholar
  24. 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
  25. Graham, P. (1994). On Lisp. Englewood Cliffs, NJ: Prentice Hall.Google Scholar
  26. Horsman, C., Stepney, S., Wagner, R. C., & Kendon, V. (2013). When does a physical system compute? Proceedings of the Royal Society A, 470, 20140182.CrossRefzbMATHGoogle Scholar
  27. Hoyte, D. (2008). Let over lambda. HCSW and Hoytech. Doug Hoyte. ISBN 9781435712751.Google Scholar
  28. Jay, B., & Given-Wilson, T. (2011). A combinatory account of internal structure. The Journal of Symbolic Logic, 76(3), 807–826.MathSciNetCrossRefzbMATHGoogle Scholar
  29. Keller, H. (1905). The story of my life. Garden City, NY: Doubleday.Google Scholar
  30. Knuth, D. E. (1973). Searching and Sorting, the art of computer programming, vol. 3. Reading, MA: Addison-Wesley.zbMATHGoogle Scholar
  31. Knuth, D. E. (1996). Selected papers on computer science. Cambridge: Cambridge University Press.zbMATHGoogle Scholar
  32. Knuth, D. E. (2014). Twenty questions for Donald Knuth. http://www.informit.com/articles/article.aspx?p=2213858. Accessed 1 June 2017.
  33. Lenneberg, E. H. (1967). The biological foundations of language. New York: Wiley.Google Scholar
  34. Lewis, H. R., & Papadimitriou, C. H. (1998). Elements of the theory of computation (2nd ed.). New Jersey: Prentice-Hall.Google Scholar
  35. Mills, J. W. (2008). The nature of the extended analog computer. Physica D: Nonlinear Phenomena, 237(9), 1235–1256.MathSciNetCrossRefzbMATHGoogle Scholar
  36. Newell, A., & Simon, H. (1976). Computer science as empirical inquiry: Symbols and search. Communications of the ACM, 19(3), 113–126.MathSciNetCrossRefGoogle Scholar
  37. Pask, G. (1968). Colloquy of mobiles. London: ICA.Google Scholar
  38. Piccinini, G. (2008). Computers. Pacific Philosophical Quarterly, 89, 32–73.CrossRefGoogle Scholar
  39. Pitowsky, I. (1990). The physical Church thesis and physical computational complexity. Iyyun: The Jerusalem Philosophical Quarterly, 39, 81–99.Google Scholar
  40. Preston, J. (2002). Introduction. In Preston and Bishop (2002).Google Scholar
  41. Preston, J., & Bishop, M. (Eds.). (2002). Views into the Chinese room: New essays on Searle and artificial intelligence. Oxford: Oxford University Press.zbMATHGoogle Scholar
  42. Rapaport, W. J. (1988). Syntactic semantics: Foundations of computational natural-language understanding. In J. H. Fetzer (Ed.), Aspects of artificial intelligence (pp. 81–131). Holland: Kluwer.CrossRefGoogle Scholar
  43. Rapaport, W. J. (2006). How Helen Keller used syntactic semantics to escape from a Chinese Room. Minds and Machines, 16(4), 381–436.CrossRefGoogle Scholar
  44. Rapaport, W. J. (2011). Yes, she was!. Minds and Machines, 21(1), 3–17.CrossRefGoogle Scholar
  45. Rogers, H, Jr. (1959). The present theory of Turing machine computability. Journal of the Society for Industrial and Applied Mathematics, 7(1), 114–130.MathSciNetCrossRefzbMATHGoogle Scholar
  46. Ross, J. R. (1967). Constraints on variables in syntax. Ph.D. dissertation, MIT. Published as Ross 1986.Google Scholar
  47. Ross, J. R. (1986). Infinite syntax!. Norton, NJ: Ablex.Google Scholar
  48. Rubel, L. A. (1993). The extended analog computer. Advances in Applied Mathematics, 14(1), 39–50.MathSciNetCrossRefzbMATHGoogle Scholar
  49. Searle, J. R. (1980). Minds, brains and programs. The Behavioral and Brain Sciences, 3, 417–424.CrossRefGoogle Scholar
  50. Searle, J. R. (1990). Is the brain’s mind a digital computer? Proceedings of American Philosophical Association, 64(3), 21–37.CrossRefGoogle Scholar
  51. 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
  52. Searle, J. R. (2002). Twenty-one years in the Chinese Room. In Preston and Bishop (2002).Google Scholar
  53. Shagrir, O. (1999). What is computer science about? The Monist, 82(1), 131–149.CrossRefGoogle Scholar
  54. Simon, H. (1969). The sciences of the artificial. Cambridge: MIT Press.Google Scholar
  55. Turing, A. M. (1936). On computable numbers, with an application to the entscheidungsproblem. Proceedings of the London Mathematical Society, 42(series 2), 230–265.MathSciNetzbMATHGoogle Scholar
  56. Turing, A. M. (1950). Computing machinery and intelligence. Mind, 59, 433–460.MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature B.V. 2018

Authors and Affiliations

  1. 1.Cognitive Science DepartmentMiddle East Technical University (ODTÜ)AnkaraTurkey

Personalised recommendations