skip to main content
research-article
Free Access

Moving beyond the Turing test

Published:01 December 2012Publication History
Skip Abstract Section

Abstract

Computers interacting with, not imitating, humans is the way forward.

References

  1. Bell, G. and Gemmell, J. Total Recall: How the E-Memory Revolution Will Change Everything, Dutton. New York, 2009.Google ScholarGoogle Scholar
  2. Dreyfus, H.L. What Computers Can't Do. Harper & Row, New York, 1979.Google ScholarGoogle Scholar
  3. Ferrucci, D., Brown, E., Chu-Carroll, J., Fan, J., Gondek, D., Kalyanpur, A., Lally, A., Murdock, J., Nyberg, E., Prager, J., Schlaefer, N., and Welty, C. Building Watson: An overview of the DeepQA project. AI Magazine 31, 3 (2010). 59--79.Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. French, R.M. Dusting off the Turing Test. Science 336, 6078 (Apr. 13, 2012), 164--165.Google ScholarGoogle ScholarCross RefCross Ref
  5. French, R.M. Subcognition and the limits of the Turing Test. Mind 99, 393 (1990), 53--65.Google ScholarGoogle Scholar
  6. French, R.M. Subcognitive probing: Hard questions for the Turing Test. In Proceedings of the 10th Annual Cognitive Science Society Conference (Montréal, July). LEA, Hillsdale, NJ, 1988, 361--367.Google ScholarGoogle Scholar
  7. French, R.M. The Turing Test: The first 50 years. Trends in Cognitive Sciences 4, 3 (Mar. 2000), 115--121.Google ScholarGoogle ScholarCross RefCross Ref
  8. Haugeland, J. Artificial Intelligence, The Very Idea, MIT Press, Cambridge, MA, 1985. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Hayes, P. and Ford, K. Turing Test considered harmful. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (Montréal). Morgan Kauffman Publishers, San Francisco, 1995, 972--977. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Hofstadter, D.R. Metamagical Themas. Basic Books, New York, 1985, 631--665.Google ScholarGoogle Scholar
  11. Holland, J.H. Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, MI, 1975.Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Kolata, G. How can computers get common sense? Science 217, 4566 (Sept. 1982), 1237--1238.Google ScholarGoogle Scholar
  13. Minsky, M. Computation: Finite and Infinite Machines, Prentice-Hall, Englewood Cliffs, NJ, 1967. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Mitchell, M. An Introduction to Genetic Algorithms, MIT Press, Cambridge, MA, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Roy, D. Human Speechome Project, 2011; http://www.media.mit.edu/press/speechomeGoogle ScholarGoogle Scholar
  16. Roy, D., Patel, R., DeCamp, P., Kubat, R., Fleischman, M., Roy, B., Mavridis, N., Tellex, S., Salata, A., Guinness, J., Levit, M., and Gorniak, P. The Human Speechome Project. In Proceedings of the 28th Annual Cognitive Science Society Conference, R. Sun and N. Miyake, Eds. (Vancouver, B.C., Canada). LEA, Hillsdale, NJ, 2006, 2059--2064.Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Simon, H. and Newell, A. Heuristic problem solving: The next advance in operations research. Operations Research 6, 1 (Jan.--Feb., 1958), 1--10.Google ScholarGoogle Scholar
  18. Talbot, D. A social-media decoder. Technology Review (Nov.-Dec. 2011); http://www.technologyreview.com/computing/38910/Google ScholarGoogle Scholar
  19. Turing, A.M. Computing machinery and intelligence. Mind 59, 236 (1950), 433--460.Google ScholarGoogle Scholar
  20. Whitby, B. The Turing Test: AI's biggest blind alley? In Machines and Thought: The Legacy of Alan Turing, P. Millican and A. Clark, Eds. Oxford University Press, Oxford, U.K., 1996, 53--63.Google ScholarGoogle Scholar

Index Terms

  1. Moving beyond the Turing test

              Recommendations

              Comments

              Login options

              Check if you have access through your login credentials or your institution to get full access on this article.

              Sign in

              Full Access

              • Published in

                cover image Communications of the ACM
                Communications of the ACM  Volume 55, Issue 12
                December 2012
                102 pages
                ISSN:0001-0782
                EISSN:1557-7317
                DOI:10.1145/2380656
                Issue’s Table of Contents

                Copyright © 2012 ACM

                Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

                Publisher

                Association for Computing Machinery

                New York, NY, United States

                Publication History

                • Published: 1 December 2012

                Permissions

                Request permissions about this article.

                Request Permissions

                Check for updates

                Qualifiers

                • research-article
                • Popular
                • Refereed

              PDF Format

              View or Download as a PDF file.

              PDF

              eReader

              View online with eReader.

              eReader

              HTML Format

              View this article in HTML Format .

              View HTML Format