The Meta-Turing Test

• URL: http://arxiv.org/abs/2205.05268v1
• Date: Wed, 11 May 2022 04:54:14 GMT
• Title: The Meta-Turing Test
• Authors: Toby Walsh
• Abstract summary: We propose an alternative to the Turing test that removes the inherent asymmetry between humans and machines. In this new test, both humans and machines judge each other.
• Score: 17.68987003293372
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose an alternative to the Turing test that removes the inherent asymmetry between humans and machines in Turing's original imitation game. In this new test, both humans and machines judge each other. We argue that this makes the test more robust against simple deceptions. We also propose a small number of refinements to improve further the test. These refinements could be applied also to Turing's original imitation game.

Related papers

• The Imitation Game According To Turing [0.0]
  Recent studies have claimed that Large Language Models (LLMs) can pass the Turing Test-a goal for AI since the 1950s-and therefore can "think" We conducted a rigorous Turing Test with GPT-4-Turbo that adhered closely to Turing's instructions for a three-player imitation game. All but one participant correctly identified the LLM, showing that one of today's most advanced LLMs is unable to pass a rigorous Turing Test.
  arXiv  Detail & Related papers  (2025-01-29T13:08:17Z)
• Exploring and Mitigating Adversarial Manipulation of Voting-Based Leaderboards [93.16294577018482]
  Arena, the most popular benchmark of this type, ranks models by asking users to select the better response between two randomly selected models. We show that an attacker can alter the leaderboard (to promote their favorite model or demote competitors) at the cost of roughly a thousand votes. Our attack consists of two steps: first, we show how an attacker can determine which model was used to generate a given reply with more than $95%$ accuracy; and then, the attacker can use this information to consistently vote against a target model.
  arXiv  Detail & Related papers  (2025-01-13T17:12:38Z)
• Self-Directed Turing Test for Large Language Models [56.64615470513102]
  The Turing test examines whether AIs can exhibit human-like behaviour in natural language conversations. Traditional Turing tests adopt a rigid dialogue format where each participant sends only one message each time. This paper proposes the Self-Directed Turing Test, which extends the original test with a burst dialogue format.
  arXiv  Detail & Related papers  (2024-08-19T09:57:28Z)
• Turing's Test, a Beautiful Thought Experiment [0.0]
  There has been a resurgence of claims and questions about the Turing test and its value. If AI were quantum physics, by now several "Schr"odinger's" cats would have been killed. This paper presents a wealth of evidence, including new archival sources, and gives original answers to several open questions about Turing's 1950 paper.
  arXiv  Detail & Related papers  (2023-12-18T19:38:26Z)
• Towards a Self-Replicating Turing Machine [0.0]
  We provide partial implementations of von Neumann's universal constructor and universal copier. Using the same principles, we also construct Turing machines. Our construction allows for mutations if desired, and we give a simple description language.
  arXiv  Detail & Related papers  (2023-06-29T11:50:58Z)
• The Turing Deception [0.0]
  This research revisits the classic Turing test and compares recent large language models such as ChatGPT. The question of whether an algorithm displays hints of Turing's truly original thoughts remains unanswered and potentially unanswerable for now.
  arXiv  Detail & Related papers  (2022-12-09T16:32:11Z)
• Sequential Causal Imitation Learning with Unobserved Confounders [82.22545916247269]
  "Monkey see monkey do" is an age-old adage, referring to na"ive imitation without a deep understanding of a system's underlying mechanics. This paper investigates the problem of causal imitation learning in sequential settings, where the imitator must make multiple decisions per episode.
  arXiv  Detail & Related papers  (2022-08-12T13:53:23Z)
• HandoverSim: A Simulation Framework and Benchmark for Human-to-Robot Object Handovers [60.45158007016316]
  "HandoverSim" is a simulation benchmark for human-to-robot object handovers. We leverage a recent motion capture dataset of hand grasping of objects. We create training and evaluation environments for the receiver with standardized protocols and metrics.
  arXiv  Detail & Related papers  (2022-05-19T17:59:00Z)
• Teach me to play, gamer! Imitative learning in computer games via linguistic description of complex phenomena and decision tree [55.41644538483948]
  We present a new machine learning model by imitation based on the linguistic description of complex phenomena. The method can be a good alternative to design and implement the behaviour of intelligent agents in video game development.
  arXiv  Detail & Related papers  (2021-01-06T21:14:10Z)
• Reservoir memory machines [79.79659145328856]
  We propose reservoir memory machines, which are able to solve some of the benchmark tests for Neural Turing Machines. Our model can also be seen as an extension of echo state networks with an external memory, enabling arbitrarily long storage without interference.
  arXiv  Detail & Related papers  (2020-02-12T01:45:00Z)
• Self-recognition in conversational agents [0.5156484100374058]
  Sustaining the idea of self within the Turing test is still possible if the judge decides to act as a textual mirror. It is possible that a successful self-recognition might pave way to stronger notions of self-awareness in artificial beings.
  arXiv  Detail & Related papers  (2020-02-06T16:32:46Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.