Large Language Models and the Reverse Turing Test

被引:47
|
作者
Sejnowski, Terrence J. [1 ,2 ]
机构
[1] Salk Inst Biol Studies, La Jolla, CA 92093 USA
[2] Univ Calif San Diego, Div Biol Sci, La Jolla, CA 92037 USA
关键词
LEARNING ALGORITHM; NEUROSCIENCE;
D O I
10.1162/neco_a_01563
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Large language models (LLMs) have been transformative. They are pretrained foundational models that are self-supervised and can be adapted with fine-tuning to a wide range of natural language tasks, each of which previously would have required a separate network model. This is one step closer to the extraordinary versatility of human language. GPT-3 and, more recently, LaMDA, both of them LLMs, can carry on dialogs with humans on many topics after minimal priming with a few examples. However, there has been a wide range of reactions and debate on whether these LLMs understand what they are saying or exhibit signs of intelligence. This high variance is exhibited in three interviews with LLMs reaching wildly different conclusions. A new possibility was uncovered that could explain this divergence. What appears to be intelligence in LLMs may in fact be a mirror that reflects the intelligence of the interviewer, a remarkable twist that could be considered a reverse Turing test. If so, then by studying interviews, we may be learning more about the intelligence and beliefs of the interviewer than the intelligence of the LLMs. As LLMs become more capable, they may transform the way we interact with machines and how they interact with each other. Increasingly, LLMs are being coupled with sensorimotor devices. LLMs can talk the talk, but can they walk the walk? A road map for achieving artificial general autonomy is outlined with seven major improvements inspired by brain systems and how LLMs could in turn be used to uncover new insights into brain function.
引用
收藏
页码:309 / 342
页数:34
相关论文
共 50 条
  • [31] The Turing Test*
    B. Jack Copeland
    Minds and Machines, 2000, 10 : 519 - 539
  • [32] Turing Test
    Harnad, Stevan
    TLS-THE TIMES LITERARY SUPPLEMENT, 2011, (5673): : 6 - 6
  • [33] The 'turing test'
    Burnside, John
    POETRY REVIEW, 2007, 97 (02): : 10 - 10
  • [34] Automating Autograding: Large Language Models as Test Suite Generators for Introductory Programming
    Alkafaween, Umar
    Albluwi, Ibrahim
    Denny, Paul
    JOURNAL OF COMPUTER ASSISTED LEARNING, 2025, 41 (01)
  • [35] An Empirical Evaluation of Using Large Language Models for Automated Unit Test Generation
    Schafer, Max
    Nadi, Sarah
    Eghbali, Aryaz
    Tip, Frank
    IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 2024, 50 (01) : 85 - 105
  • [36] Large Language Models in der WissenschaftLarge language models in science
    Karl-Friedrich Kowalewski
    Severin Rodler
    Die Urologie, 2024, 63 (9) : 860 - 866
  • [37] THE TURING PROGRAMMING LANGUAGE
    HOLT, RC
    CORDY, JR
    COMMUNICATIONS OF THE ACM, 1988, 31 (12) : 1410 - 1423
  • [38] FlakyFix: Using Large Language Models for Predicting Flaky Test Fix Categories and Test Code Repair
    Fatima, Sakina
    Hemmati, Hadi
    C. Briand, Lionel
    IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 2024, 50 (12) : 3146 - 3171
  • [39] Passed the Turing Test: Living in Turing Futures
    Goncalves, Bernardo
    INTELLIGENT COMPUTING, 2024, 3
  • [40] The Turing Test as interactive proof (Alan Turing)
    Shieber, Stuart M.
    NOUS, 2007, 41 (04): : 686 - 713