Skip to main content
padlock icon - secure page this page is secure

Answering subcognitive Turing Test questions: a reply to French

Buy Article:

$60.00 + tax (Refund Policy)

Robert French has argued that a disembodied computer is incapable of passing a Turing Test that includes subcognitive questions. Subcognitive questions are designed to probe the network of cultural and perceptual associations that humans naturally develop as we live, embodied and embedded in the world. This paper shows how it is possible for a disembodied computer to answer subcognitive questions appropriately, contrary to French's claim. The paper's approach to answering subcognitive questions is to use statistical information extracted from a very large collection of text. In particular, it is shown how it is possible to answer a sample of subcognitive questions taken from French, by issuing queries to a search engine that indexes about 350 million Web pages. This simple algorithm may shed light on the nature of human (sub-) cognition, but the scope of this paper is limited to demonstrating that French is mistaken: a disembodied computer can answer subcognitive questions.
No Reference information available - sign in for access.
No Citation information available - sign in for access.
No Supplementary Data.
No Article Media
No Metrics

Keywords: LEXICAL ANALYSIS; MUTUAL INFORMATION; PMI-IR; STATISTICAL LANGUAGE PROCESSING; SUBCOGNITION; SUBCOGNITIVE QUESTIONS; TURING TEST; WEB MINING; WORD ASSOCIATION

Document Type: Research Article

Publication date: October 1, 2001

More about this publication?
  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
X
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more