Going Under Cover: Passing as Human

Artificial Interest: A Step on the Road to AI
  • Michael L. Mauldin


This chapter discusses strategies for building a computer program to pose as a human for the Turing test, including the use of humor to distract the human judge from the task of evaluating the conversation. Experiences of computer programs from the Loebner Prize competitions are analyzed to give a “top 10” list of mistakes that computers make when trying to appear human.


Natural language Artificial Intelligence deception posing human conversational patterns humor Julia 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Berliner, H. J., September 1980, Backgammon computer program beats world champion, Artificial Intelligence 13(2): 205–220.CrossRefGoogle Scholar
  2. Binsted, K., 1996, Machine Humour: An Implemented Model of Puns, Ph.D. thesis, University of Edinburgh.Google Scholar
  3. Carbonell, J., 1979, Subjective Understanding: Computer Models of Belief Systems, Technical Report YALE/DCS/tr150, Computer Science Department, Yale University, New Haven, CT..Google Scholar
  4. Dick, P. K., 1990, Blade Runner, Balantine Paperback.Google Scholar
  5. Epstein, R., 1992, The quest for the thinking computer, AAAI Magazine 13(2): 80–95.Google Scholar
  6. Epstein, R. 1994, 1994 Loebner Prize Competition in Artificial Intelligence: Official Transcripts and Results, Technical Report, Cambridge Center for Behavioral Studies.Google Scholar
  7. Gibson, W., 1995, Neuromancer, Ace Books, Reissued.Google Scholar
  8. Mauldin, M., Jacobson, G., Appel, A., and Hamey, L., 1984, ROG-O-MATIC: a belligerent expert system, Fifth Biennial Conference of the Canadian Society for Computational Studies of Intelligence, London, Ontario, May 16.Google Scholar
  9. Mauldin, M. L., 1994, Chatterbots, tinymuds, and the Turing test: entering the Loebner prize competition, 1994 Conference of the American Association for Artificial Intelligence.Google Scholar
  10. Pandolfini, B., 1997, Kasparov and Deep Blue: The Historic Chess Match Between Man and Machine, Fireside Press.Google Scholar
  11. Samuels, A. L., 1959, Some studies in machine learning using the game of checkers, IBM Journal of Research and Development 3(3): 210–229; reprinted 1963, in: Computers and Thought, E. A. Feigenbaum and J. Feldman, eds., MIT Press.CrossRefGoogle Scholar
  12. Schank, R., 1987, Carnegie Mellon Lecture series, from the author’s notes.Google Scholar
  13. Schank, R. C., Goldman, N. M., Rieger III, C. J., and Riesbeck, C., 1975, Inference and paraphrase by computer, JACM 22(3): 309–328.zbMATHCrossRefGoogle Scholar
  14. Shannon, C., 1950, A chess-playing machine, Scientific American 182(2): 48–51; reprinted 1956, in: The World of Mathematics, Vol. 4, J. R. Newman, ed., Simon & Schuster, NY, pp. 2124–2133.CrossRefGoogle Scholar
  15. Vinge, V. and Frankel, J., eds., 2001, True Names: And the Opening of the Cyberspace Frontier, Tor Books, New York.Google Scholar

Copyright information

© Springer Science+Business Media B.V. 2009

Authors and Affiliations

  • Michael L. Mauldin
    • 1
  1. 1.Carnegie Mellon University and Conversive, Inc.USA

Personalised recommendations