Switch to: References

Add citations

You must login to add citations.
  1. On the Claim that a Table-Lookup Program Could Pass the Turing Test.Drew McDermott - 2014 - Minds and Machines 24 (2):143-188.
    The claim has often been made that passing the Turing Test would not be sufficient to prove that a computer program was intelligent because a trivial program could do it, namely, the “Humongous-Table (HT) Program”, which simply looks up in a table what to say next. This claim is examined in detail. Three ground rules are argued for: (1) That the HT program must be exhaustive, and not be based on some vaguely imagined set of tricks. (2) That the HT (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • The importance of a human viewpoint on computer natural language capabilities: a Turing test perspective.Kevin Warwick & Huma Shah - 2016 - AI and Society 31 (2):207-221.
  • Some Implications of a Sample of Practical Turing Tests.Kevin Warwick, Huma Shah & James Moor - 2013 - Minds and Machines 23 (2):163-177.
    A series of imitation games involving 3-participant (simultaneous comparison of two hidden entities) and 2-participant (direct interrogation of a hidden entity) were conducted at Bletchley Park on the 100th anniversary of Alan Turing’s birth: 23 June 2012. From the ongoing analysis of over 150 games involving (expert and non-expert, males and females, adults and child) judges, machines and hidden humans (foils for the machines), we present six particular conversations that took place between human judges and a hidden entity that produced (...)
    Direct download (15 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • Turing Interrogative Games.Paweł Łupkowski & Andrzej Wiśniewski - 2011 - Minds and Machines 21 (3):435-448.
    The issue of adequacy of the Turing Test (TT) is addressed. The concept of Turing Interrogative Game (TIG) is introduced. We show that if some conditions hold, then each machine, even a thinking one, loses a certain TIG and thus an instance of TT. If, however, the conditions do not hold, the success of a machine need not constitute a convincing argument for the claim that the machine thinks.
    Direct download (12 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • The well-tested young scientist.Colin Hales - 2010 - International Journal of Machine Consciousness 2 (1):35-39.