Lessons from a Restricted Turing Test

We report on the recent Loebner prize competition inspired by Turing's test of intelligent behavior. The presentation covers the structure of the competition and the outcome of its first instantiation in an actual event, and an analysis of the purpose, design, and appropriateness of such a competition. We argue that the competition has no clear purpose, that its design prevents any useful outcome, and that such a competition is inappropriate given the current level of technology. We then speculate as to suitable alternatives to the Loebner prize.Comment: 20 page

Algorithmic Identification of Probabilities

TThe problem is to identify a probability associated with a set of natural numbers, given an infinite data sequence of elements from the set. If the given sequence is drawn i.i.d. and the probability mass function involved (the target) belongs to a computably enumerable (c.e.) or co-computably enumerable (co-c.e.) set of computable probability mass functions, then there is an algorithm to almost surely identify the target in the limit. The technical tool is the strong law of large numbers. If the set is finite and the elements of the sequence are dependent while the sequence is typical in the sense of Martin-L\"of for at least one measure belonging to a c.e. or co-c.e. set of computable measures, then there is an algorithm to identify in the limit a computable measure for which the sequence is typical (there may be more than one such measure). The technical tool is the theory of Kolmogorov complexity. We give the algorithms and consider the associated predictions.Comment: 19 pages LaTeX.Corrected errors and rewrote the entire paper. arXiv admin note: text overlap with arXiv:1208.500

An Evaluation of Three Online Chatbots

Chatbots enable machines to emulate human conversation. While research has been done to examine how human-like communication with chatbots can be, heretofore comparisons of the systems with humans have not accounted for abnormal behavior from the users. For example, the people using the chatbot might be lying or trying to, in turn, imitate a computer’s response. Results of a study comparing transcripts from three chatbots and two humans show that student evaluators were able to correctly identify two computer transcripts, but failed on one. Further, they incorrectly guessed that one of the humans was a chatbot. The study also presents a detailed analysis of the 11 responses from the agents

The Sound of Psychological Thriller

In this paper I will be discussing the similarity between The Imitation Game and the 2001 classic A Beautiful Mind in terms of plot, character development and soundtrack. The Imitation Game is therefore a terrific film to analyze considering the fact that it could be studied in parallel with the aforementioned acclaimed classic from 2001 as a modern day take on the following topic: Does the score of the film The Imitation Game successfully portrays the internal struggles, thoughts, enlightenment and ingenious mind of Alan Turing?https://remix.berklee.edu/graduate-studies-scoring/1050/thumbnail.jp

All the King’s Men: British Codebreaking Operations: 1938-43

The Enigma code was one of the most dangerous and effective weapons the Germans wielded at the outbreak of the Second World War. The Enigma machine was capable of encrypting radio messages that seemed virtually unbreakable. In fact, there were 158,900, 000,000,000 possible combinations in any given message transmitted. On the eve of the war’s outbreak, the British had recently learned that the Poles had made significant progress against this intimidating cipher in the early 1930s. Incensed and with little help, the British Government Code & Cipher School began the war searching for a solution. Drawing from their experiences from the First World War, and under the visionary guidance of Alan Turing, Gordon Welchman, and countless others, the British created a new, mechanical approach to breaking the seemingly impossible German code. By breaking the code, they could very well save Britain

Ideologies of computer scientists and technologists (Correctness beyond reason)

Ideologies of computer scientists and technologist

The Turing Deception

This research revisits the classic Turing test and compares recent large language models such as ChatGPT for their abilities to reproduce human-level comprehension and compelling text generation. Two task challenges -- summarization, and question answering -- prompt ChatGPT to produce original content (98-99%) from a single text entry and also sequential questions originally posed by Turing in 1950. We score the original and generated content against the OpenAI GPT-2 Output Detector from 2019, and establish multiple cases where the generated content proves original and undetectable (98%). The question of a machine fooling a human judge recedes in this work relative to the question of "how would one prove it?" The original contribution of the work presents a metric and simple grammatical set for understanding the writing mechanics of chatbots in evaluating their readability and statistical clarity, engagement, delivery, and overall quality. While Turing's original prose scores at least 14% below the machine-generated output, the question of whether an algorithm displays hints of Turing's truly original thoughts (the "Lovelace 2.0" test) remains unanswered and potentially unanswerable for now