Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article
Free access

Would Turing have passed the Turing Test?

Published: 01 September 2014 Publication History

Abstract

It's time to consider the Imitation Game as just a game.

Cited By

View all

Comments

Information & Contributors

Information

Published In

cover image Communications of the ACM
Communications of the ACM  Volume 57, Issue 9
September 2014
94 pages
ISSN:0001-0782
EISSN:1557-7317
DOI:10.1145/2663191
  • Editor:
  • Moshe Y. Vardi
Issue’s Table of Contents
Permission to make digital or hard copies of part or all 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 third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 September 2014
Published in CACM Volume 57, Issue 9

Check for updates

Qualifiers

  • Research-article
  • Popular
  • Refereed

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)558
  • Downloads (Last 6 weeks)81
Reflects downloads up to 02 Sep 2024

Other Metrics

Citations

Cited By

View all
  • (2023)Revisiting the Turing Test: Humans, Machines, and PhraseologyNudging Choices Through Media10.1007/978-3-031-26568-6_5(75-113)Online publication date: 1-Jul-2023
  • (2022)The Turing Test is a Thought ExperimentMinds and Machines10.1007/s11023-022-09616-833:1(1-31)Online publication date: 27-Nov-2022
  • (2020)Modes of Delivering PsychotherapyResearch Anthology on Rehabilitation Practices and Therapy10.4018/978-1-7998-3432-8.ch034(698-725)Online publication date: 21-Aug-2020
  • (2020)Will We Ever Have Conscious Machines?Frontiers in Computational Neuroscience10.3389/fncom.2020.55654414Online publication date: 22-Dec-2020
  • (2020)Strong (D)QBF Dependency Schemes via Tautology-Free Resolution PathsTheory and Applications of Satisfiability Testing – SAT 202010.1007/978-3-030-51825-7_28(394-411)Online publication date: 3-Jul-2020
  • (2019)SAT solvers and computer algebra systemsProceedings of the 29th Annual International Conference on Computer Science and Software Engineering10.5555/3370272.3370309(323-328)Online publication date: 4-Nov-2019
  • (2017)General bounds on satisfiability thresholds for random CSPs via fourier analysisProceedings of the Thirty-First AAAI Conference on Artificial Intelligence10.5555/3298023.3298143(3958-3965)Online publication date: 4-Feb-2017
  • (2017)A novel electrostatically doped ferroelectric Schottky barrier tunnel FETJournal of Computational Electronics10.1007/s10825-017-0987-616:3(685-695)Online publication date: 1-Sep-2017
  • (2017)Programming Without Program or How to Program in Natural Language UtterancesArtificial Intelligence XXXIV10.1007/978-3-319-71078-5_5(61-71)Online publication date: 21-Nov-2017
  • (2016)Principles for Designing an AI Competition, or Why the Turing Test Fails as an Inducement PrizeAI Magazine10.1609/aimag.v37i1.264637:1(91-96)Online publication date: 1-Mar-2016
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Digital Edition

View this article in digital edition.

Digital Edition

Magazine Site

View this article on the magazine site (external)

Magazine Site

Get Access

Login options

Full Access

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media