The Turing Test

Information and Meaning are present everywhere around us and within ourselves. Specific studies have been implemented in order to link information and meaning: - Semiotics - Phenomenology - Analytic Philosophy - Psychology No general coverage is available for the notion of meaning. We propose to complement this lack by a systemic approach to meaning generation.

In this paper a possible extension of Turing test [1] will be presented, which is intended to overcome the limits highlighted by several researchers and scientists in the last seventy years. The main problem related to the execution in Turing test is substantially dealing with the trouble in identification of a human-like intelligence based on a pure evaluation of external behavior of a machine. In this work first of all a description of classical Turing test will be done. After that, (...) some of the main exceptions or oppositions to the Turing test ability to detect “intelligent machines” will be presented. The Lovelace test will be presented as well, as possible alternative to Turing Test, and some considerations on its scope and effectiveness will be made. Furthermore, some references to Penrose and Hofstadter ideas will be recalled, highlighting the strongest troubles in defining and detecting a human-like intelligence, intended as “self-consciousness”. Finally, the new approach will be explained, introducing the new test intended to overcome the troubles highlighted on Turing test execution, based on a model of the self-consciousness obtained by means of the hypersets theory. An example will be presented as well, in order to clarify the proposed approach and its goal. (shrink)

In this paper, I argue that certain Machines can have rights independently of whether they are sentient, or conscious, or whatever you might call it.

In this multi-disciplinary investigation we show how an evidence-based perspective of quantification---in terms of algorithmic verifiability and algorithmic computability---admits evidence-based definitions of well-definedness and effective computability, which yield two unarguably constructive interpretations of the first-order Peano Arithmetic PA---over the structure N of the natural numbers---that are complementary, not contradictory. The first yields the weak, standard, interpretation of PA over N, which is well-defined with respect to assignments of algorithmically verifiable Tarskian truth values to the formulas of PA under the interpretation. (...) The second yields a strong, finitary, interpretation of PA over N, which is well-defined with respect to assignments of algorithmically computable Tarskian truth values to the formulas of PA under the interpretation. We situate our investigation within a broad analysis of quantification vis a vis: * Hilbert's epsilon-calculus * Goedel's omega-consistency * The Law of the Excluded Middle * Hilbert's omega-Rule * An Algorithmic omega-Rule * Gentzen's Rule of Infinite Induction * Rosser's Rule C * Markov's Principle * The Church-Turing Thesis * Aristotle's particularisation * Wittgenstein's perspective of constructive mathematics * An evidence-based perspective of quantification. By showing how these are formally inter-related, we highlight the fragility of both the persisting, theistic, classical/Platonic interpretation of quantification grounded in Hilbert's epsilon-calculus; and the persisting, atheistic, constructive/Intuitionistic interpretation of quantification rooted in Brouwer's belief that the Law of the Excluded Middle is non-finitary. We then consider some consequences for mathematics, mathematics education, philosophy, and the natural sciences, of an agnostic, evidence-based, finitary interpretation of quantification that challenges classical paradigms in all these disciplines. (shrink)

Turing’s much debated test has turned 70 and is still fairly controversial. His 1950 paper is seen as a complex and multilayered text, and key questions about it remain largely unanswered. Why did Turing select learning from experience as the best approach to achieve machine intelligence? Why did he spend several years working with chess playing as a task to illustrate and test for machine intelligence only to trade it out for conversational question-answering in 1950? Why did Turing refer to (...) gender imitation in a test for machine intelligence? In this article, I shall address these questions by unveiling social, historical and epistemological roots of the so-called Turing test. I will draw attention to a historical fact that has been only scarcely observed in the secondary literature thus far, namely that Turing’s 1950 test emerged out of a controversy over the cognitive capabilities of digital computers, most notably out of debates with physicist and computer pioneer Douglas Hartree, chemist and philosopher Michael Polanyi, and neurosurgeon Geoffrey Jefferson. Seen in its historical context, Turing’s 1950 paper can be understood as essentially a reply to a series of challenges posed to him by these thinkers arguing against his view that machines can think. Turing did propose gender learning and imitation as one of his various imitation tests for machine intelligence, and I argue here that this was done in response to Jefferson's suggestion that gendered behavior is causally related to the physiology of sex hormones. (shrink)

In his 1950 paper “Computing Machinery and Intelligence,” Alan Turing proposed that we can determine whether a machine thinks by considering whether it can win at a simple imitation game. A neutral questioner communicates with two different systems – one a machine and a human being – without knowing which is which. If after some reasonable amount of time the machine is able to fool the questioner into identifying it as the human, the machine wins the game, and we should (...) conclude that it thinks. This imitation game, now known as the Turing Test, has been much discussed by philosophers of mind, and for more than half a century now there has been considerable debate about whether it is an adequate test for thinking. But what has not been much discussed are the sexed presuppositions underlying the test. Too often forgotten in the philosophical discussion is the fact that Turing’s imitation game is modeled on an imitation game in which a neutral questioner communicates with two different humans – one a man and one a woman – without knowing which is which. In this original imitation game, the man wins the game if he is able to fool the questioner into identifying him as the woman. In this paper, I explore the implications of this set-up. As I argue, the fact that the Turing test was modeled on a man/woman imitation game seems to have led us astray in various ways in our attempt to conduct an effective investigation and assessment of computer intelligence. (shrink)

My basic argument is that a computer cannot distinguish between metaphor and nonsense. This would be my new “Turing Test.” I was very fond of a particular Italian poem, but I was told by an Italian friend that it was a hackneyed poem of little worth. I then taught myself to experience the poem alternately, as real poetry and as the silly nonsense that my friend claimed it really was. Having done so, I realized that I could do the same (...) with any metaphor, such as “having a green thumb.” Thinking about the nature of this switch, from the literal to the metaphorical, I also realized that it was the sort of change that could not be prescribed or even described: this, the basic aesthetic gesture, remains beyond the boundary of logical definition. It then dawned on me that it might provide a test for the validity of a “Turing Test,” by any definition. Can a computer track a mind as it goes through this transformation? I could not envisage such a possibility. This would be a “Turing Test” based on the discipline of aesthetics rather than on technology. It may even be argued that the ability to experience metaphor is the very definition of the human. (shrink)

Block’s, 5–43 1981) anti-behaviourist attack of the Turing Test not only illustrates that the test is a non-sufficient criterion for attributing thought; I suggest that it also exemplifies the limiting case of the more general concern that a machine which has access to enormous amounts of data can pass the Turing Test by simple symbol-manipulation techniques. If the answers to a human interrogator are entailed by the machines’ data, the Turing Test offers no clear criterion to distinguish between a thinking (...) machine and a machine that merely manipulates representations of words and sentences as it is found in contemporary Natural Language Processing models. This paper argues that properties about vagueness are accessible to any human-like thinker but do not normally display themselves in ordinary language use. Therefore, a machine that merely performs simple symbol manipulation from large amounts of previously acquired data – where this body of data does not contain facts about vagueness – will not be able to report on these properties. Conversely, a machine that has the capacity to think would be able to report on these properties. I argue that we can exploit this fact to establish a sufficient criterion of thought. The criterion is a specification of some of the questions that, as I explain, should be asked by the interrogator in a Turing Test situation. (shrink)

Do we suddenly become justified in treating robots like humans by positing new notions like “artificial moral agency” and “artificial moral responsibility”? I answer no. Or, to be more precise, I argue that such notions may become philosophically acceptable only after crucial metaphysical issues have been addressed. My main claim, in sum, is that “artificial moral responsibility” betokens moral responsibility to the same degree that a “fake orgasm” betokens an orgasm.

This is PhD thesis submitted to Institute Philosophy of Russian Academy of Science in March 2021.

An argument with roots in ancient Greek philosophy claims that only humans are capable of a certain class of thought termed conceptual, as opposed to perceptual thought, which is common to humans, the higher animals, and some machines. We outline the most detailed modern version of this argument due to Mortimer Adler, who in the 1960s argued for the uniqueness of the human power of conceptual thought. He also admitted that if conceptual thought were ever manifested by machines, such an (...) achievement would contradict his conclusion. We revisit Adler’s criterion in the light of the past five decades of artificial-intelligence research, and refine it in view of the classical definitions of perceptual and conceptual thought. We then examine two well-publicized examples of creative works produced by AI systems and show that evidence for conceptual thought appears to be lacking in them. Although clearer evidence for conceptual thought on the part of AI systems may arise in the near future, especially if the global neuronal workspace theory of consciousness prevails over its rival, integrated information theory, the question of whether AI systems can engage in conceptual thought appears to be still open. (shrink)

Susan Schneider (2019) has proposed two new tests for consciousness in AI (artificial intelligence) systems, the AI Consciousness Test and the Chip Test. On their face, the two tests seem to have the virtue of proving satisfactory to a wide range of consciousness theorists holding divergent theoretical positions, rather than narrowly relying on the truth of any particular theory of consciousness. Unfortunately, both tests are undermined in having an ‘audience problem’: Those theorists with the kind of architectural worries that motivate (...) the need for such tests should, on similar grounds, doubt that the tests establish the existence of genuine consciousness in the AI in question. Nonetheless, the proposed tests constitute progress, as they could find use by some theorists holding fitting views about consciousness and perhaps in conjunction with other tests for AI consciousness. (shrink)

The superposition of magical thinking, quantum entanglement, and self-referential recursion explains the relationship between human and machine intelligence (universal intelligence).

Philosophy of Mind: The Basics is a concise and engaging introduction to the fundamental philosophical questions and theories about the mind. The author Amy Kind, a leading expert in the field, examines central issues concerning the nature of consciousness, thought, and emotion. The book addresses key questions such as: • What is the nature of the mind? • What is the relationship between the mind and the brain? • Can machines have minds? • How will future technology impact the mind? (...) With a glossary of key terms and suggestions for further reading, Philosophy of Mind: The Basics is an ideal starting point for anyone seeking a lively and accessible introduction to the rich and complex study of philosophy of mind. (shrink)

The goal of creating Artificial General Intelligence (AGI) – or in other words of creating Turing machines (modern computers) that can behave in a way that mimics human intelligence – has occupied AI researchers ever since the idea of AI was first proposed. One common theme in these discussions is the thesis that the ability of a machine to conduct convincing dialogues with human beings can serve as at least a sufficient criterion of AGI. We argue that this very ability (...) should be accepted also as a necessary condition of AGI, and we provide a description of the nature of human dialogue in particular and of human language in general against this background. We then argue that it is for mathematical reasons impossible to program a machine in such a way that it could master human dialogue behaviour in its full generality. This is (1) because there are no traditional explicitly designed mathematical models that could be used as a starting point for creating such programs; and (2) because even the sorts of automated models generated by using machine learning, which have been used successfully in areas such as machine translation, cannot be extended to cope with human dialogue. If this is so, then we can conclude that a Turing machine also cannot possess AGI, because it fails to fulfil a necessary condition thereof. At the same time, however, we acknowledge the potential of Turing machines to master dialogue behaviour in highly restricted contexts, where what is called “narrow” AI can still be of considerable utility. (shrink)

Pattern recognition is represented as the limit, to which an infinite Turing process converges. A Turing machine, in which the bits are substituted with qubits, is introduced. That quantum Turing machine can recognize two complementary patterns in any data. That ability of universal pattern recognition is interpreted as an intellect featuring any quantum computer. The property is valid only within a quantum computer: To utilize it, the observer should be sited inside it. Being outside it, the observer would obtain quite (...) different result depending on the degree of the entanglement of the quantum computer and observer. All extraordinary properties of a quantum computer are due to involving a converging infinite computational process contenting necessarily both a continuous advancing calculation and a leap to the limit. Three types of quantum computation can be distinguished according to whether the series is a finite one, an infinite rational or irrational number. (shrink)

Computational complexity is a discipline of computer science and mathematics which classifies computational problems depending on their inherent difficulty, i.e. categorizes algorithms according to their performance, and relates these classes to each other. P problems are a class of computational problems that can be solved in polynomial time using a deterministic Turing machine while solutions to NP problems can be verified in polynomial time, but we still do not know whether they can be solved in polynomial time as well. A (...) solution for the so-called NP-complete problems will also be a solution for any other such problems. Its artificial-intelligence analogue is the class of AI-complete problems, for which a complete mathematical formalization still does not exist. In this chapter we will focus on analysing computational classes to better understand possible formalizations of AI-complete problems, and to see whether a universal algorithm, such as a Turing test, could exist for all AI-complete problems. In order to better observe how modern computer science tries to deal with computational complexity issues, we present several different deep-learning strategies involving optimization methods to see that the inability to exactly solve a problem from a higher order computational class does not mean there is not a satisfactory solution using state-of-the-art machine-learning techniques. Such methods are compared to philosophical issues and psychological research regarding human abilities of solving analogous NP-complete problems, to fortify the claim that we do not need to have an exact and correct way of solving AI-complete problems to nevertheless possibly achieve the notion of strong AI. (shrink)

私は計算と宇宙の限界に関する最近の議論をコンピュータとして読み、ポリマス物理学者と意思決定理論家デビッド・ウォルパートの驚くべき仕事に関するいくつかのコメントを見つけることを望んでいますが、単一の引用 を見つけていないので、私はこの非常に簡単な要約を提示します。ウォルパートは、計算を行うデバイスから独立し、物理学の法則から独立している推論(計算)の限界に関する驚くべき不可能または不完全な定理(199 2年から2008年のarxiv.org参照)を証明したので、コンピュータ、物理学、人間の行動に適用されます。彼らは、カントールの対角化、嘘つきのパラドックス、ワールドラインを利用して、チューリングマシ ン理論の究極の定理である可能性のあるものを提供し、不可能、不完全性、計算の限界、そしてコンピュータとしての宇宙に関する洞察を提供し、すべての可能な宇宙とすべての存在またはメカニズムを生み出し、とりわけ 非量子機械不確実性原理と単一主義の証明を生み出します。チャイティン、ソロモノフ、コモルガロフ、ヴィトゲンシュタインの古典的な作品と、どのプログラム(したがってデバイスも)が所有するよりも複雑なシーケン ス(またはデバイス)を生成できないという考えには明らかなつながりがあります。この作品の体は、物理的な宇宙よりも複雑な存在はあり得ないので無テズムを意味すると言うかもしれませんし、ヴィトゲンチニアンの観 点から見ると、「より複雑な」は無意味です(満足の条件はありません、すなわち、真実のメーカーやテスト)。「神」(つまり、無限の時間/空間とエネルギーを持つ「デバイス」)でさえ、与えられた「数」が「ランダ ム」であるかどうかを判断したり、与えられた「公式」、定理または「文章」または「デバイス」(これらはすべて複雑な言語ゲームである)が特定の「システム」の一部であることを示す特定の方法を見つけることができ ません。 現代の2つのシス・エムスの見解から人間の行動のための包括的な最新の枠組みを望む人は、私の著書「ルートヴィヒ・ヴィトゲンシュタインとジョン・サールの第2回(2019)における哲学、心理学、ミンと言語の論 理的構造」を参照することができます。私の著作の多くにご興味がある人は、21世紀4日(2019年)の「話す猿--哲学、心理学、科学、宗教、政治」を見ることができます。 .

Ich habe viele kürzliche Diskussionen über die Grenzen der Berechnung und das Universum als Computer gelesen, in der Hoffnung, einige Kommentare über die erstaunliche Arbeit des Polymath Physikers und Entscheidungstheoretikers David Wolpert zu finden, aber habe kein einziges Zitat gefunden und so präsentiere ich diese sehr kurze Zusammenfassung. Wolpert bewies einige verblüffende Unmöglichkeit oder Unvollständigkeit Theoreme (1992 bis 2008-siehe arxiv dot org) über die Grenzen der Schlussfolgerung (Berechnung), die so allgemein sind, dass sie unabhängig von dem Gerät, das die Berechnung, (...) und sogar unabhängig von den Gesetzen der Physik, so dass sie für Computer, Physik und menschliches Verhalten gelten. Sie nutzen Cantors Diagonalisierung, das Lügner-Paradoxon und die Weltlinien, um das vielleicht ultimative Theorem in turing Machine Theory zu liefern, und geben scheinbar Einblicke in Unmöglichkeit, Unvollständigkeit, die Grenzen der Berechnung und das Universum als Computer, in alle möglichen Universen und alle Wesen oder Mechanismen, was unter anderem ein nicht quantenmechanisches Unsicherheitsprinzip und einen Beweis für Monotheismus erzeugt. Es gibt offensichtliche Verbindungen zum klassischen Werk von Chaitin, Solomonoff, Komolgarov und Wittgenstein und zu der Vorstellung, dass kein Programm (und damit kein Gerät) eine Sequenz (oder ein Gerät) mit größerer Komplexität erzeugen kann, als es besitzt. Man könnte sagen, dass dieses Werk den Atheismus impliziert, da es keine Entität geben kann, die komplexer ist als das physikalische Universum, und aus Wittgensteins Sicht ist "komplexer" bedeutungslos (hat keine Bedingungen der Befriedigung, d.h. Wahrheitsmacher oder Test). Selbst ein "Gott" (das heist ein "Gerät" mit unbegrenzter Zeit/Raum und Energie) kann weder bestimmen, ob eine bestimmte "Zahl" "zufällig"ist, noch einen bestimmten Weg finden, um nachzuweisen, dass eine bestimmte "Formel", "Satz" oder "Satz" oder "Gerät" (alles komplexe Sprachspiele) Teil eines bestimmten "Systems" ist. Wer aus der modernen zweisystems-Sichteinen umfassenden, aktuellen Rahmen für menschliches Verhalten wünscht, kann mein Buch "The Logical Structure of Philosophy, Psychology, Mindand Language in Ludwig Wittgenstein and John Searle' 2nd ed (2019) konsultieren. Diejenigen,die sich für mehr meiner Schriften interessieren, können Talking Monkeys--Philosophie, Psychologie, Wissenschaft, Religion und Politik auf einem verdammten Planeten --Artikel und Rezensionen 2006-2019 2nd ed (2019) und Suicidal Utopian Delusions in the 21st Century 4th ed (2019) und andere sehen. (shrink)

В «Godel's Way» три видных ученых обсуждают такие вопросы, как неплатежеспособность, неполнота, случайность, вычислительность и последовательность. Я подхожу к этим вопросам с точки зрения Витгенштейна, что есть две основные проблемы, которые имеют совершенно разные решения. Есть научные или эмпирические вопросы, которые являются факты о мире, которые должны быть исследованы наблюдений и философские вопросы о том, как язык может быть использован внятно (которые включают в себя определенные вопросы в математике и логике), которые должны быть решены, глядят, как мы на самом деле (...) использовать слова в конкретных контекстах. Когда мы получаем ясно о том, какой языковой игре мы играем, эти темы рассматриваются как обычные научные и математические вопросы, как и любые другие. Идеи Витгенштейна редко были равны и никогда не превосходили и столь же уместно сегодня, как они были 80 лет назад, когда он диктовал Blue и Браун Книги. Несмотря на свои недостатки, на самом деле серия заметок, а не готовой книги, это уникальный источник работы этих трех известных ученых, которые работают на кровотечения края физики, математики и философии на протяжении более полувека. Da Costa и Doria процитированы Wolpert (см. ниже или мои статьи на Wolpert и моем просмотрении Yanofsky 'Внешние пределы разума') в виду того что они написали на всеобщихвычислениях,, и среди его много выполнений, Da Costa пионер в paraconsistency. Те, кто желает всеобъемлющего до современных рамок для человеческого поведения из современных двух systEms зрения могут проконсультироваться с моей книгой"Логическая структура философии, психологии, Минd иязык в Людвиг Витгенштейн и Джон Сирл" второй ред (2019). Те, кто заинтересован в более моих сочинений могут увидеть "Говоря обезьян - Философия, психология, наука, религия и политика на обреченной планете - Статьи и обзоры 2006-2019 3-й ed (2019) и suicidal утопических заблуждений в 21-мst веке 4-й ed (2019) th и другие. (shrink)

ノソン・ヤノフスキーの「理性の外側の限界」を、ウィトゲンシュタインと進化心理学の統一的な視点から詳しくレビューします。私は、言語や数学のパラドックス、不完全さ、デデシッド性、コンピュータとしての脳、宇 宙などの問題の難しさは、すべて適切な文脈での言語の使用を注意深く見なさなかったことから生じるため、科学的事実の問題を言語の仕組みの問題から切り離すことができなかったことを示しています。私は、不完全さ、 パラタンシ、不整合性に関するヴィトゲンシュタインの見解と、計算の限界に関するウォルパートの仕事について議論します。要約すると:ブルックリンによると宇宙---良い科学、それほど良い哲学ではありません。 現代の2つのシス・エムスの見解から人間の行動のための包括的な最新の枠組みを望む人は、私の著書「ルートヴィヒ・ヴィトゲンシュタインとジョン・サールの第2回(2019)における哲学、心理学、ミンと言語の論 理的構造」を参照することができます。私の著作の多くにご興味がある人は、運命の惑星における「話す猿--哲学、心理学、科学、宗教、政治―記事とレビュー2006-2019 第3回(2019)」と21世紀4日(2019年)の自殺ユートピア妄想st Century 4th ed (2019)などを見ることができます。 .

Ultimo sermone della Chiesa del Naturalismo fondamentalista del pastore Hofstadter. Come il suo lavoro molto più famoso (o infame per i suoi instancabili errori filosofici) Godel, Escher, Bach, ha una plausibilità superficiale, ma se si capisce che questo è scientismo dilagante che mescola problemi scientifici reali con quelli filosofici (cioè, gli unici problemi reali sono quali giochi di linguaggio dovremmo giocare) allora quasi tutti i suoi interessi scompaiono. Fornisco un quadro per l'analisi basata sulla psicologia evolutiva e il lavoro di (...) Wittgenstein (da allora aggiornato nei miei scritti più recenti). Coloro che desiderano un quadro aggiornato completo per il comportamento umano dalla moderna vista a due systems possono consultare il mio libro 'La struttura logica dellafilosofia, psicologia, Mind e il linguaggio in Ludwig Wittgenstein e John Searle' 2nd ed (2019). Coloro che sono interessati a più dei miei scritti possono vedere 'TalkingMonkeys--Filosofia, Psicologia, Scienza, Religione e Politica su un Pianeta Condannato--Articoli e Recensioni 2006-2019 3rd ed (2019) e Suicidal Utopian Delusions nel 21st Century 4th ed (2019) . (shrink)

Some people wrongly believe that A. Turing’s works that underlie all modern computer science never discussed “physical” robots. This is not so, since Turing did speak about such machines, though making a reservation that this discussion was still premature. In particular, in his 1948 report [8], he suggested that a physical intelligent machine equipped with motors, cameras and loudspeakers, when wandering through the fields of England, would present “the danger to the ordinary citizen would be serious.” [8, ]. Due to (...) this imperfection of technology in the field of knowledge that we now call robotics, the methodology that he proposed was based on human speech, or rather on text. Other natural human skills were too difficult to implement, while the exchange of cues via written messages was much more accessible for engineering implementation in Turing’s time. Nevertheless, since then, the progress of computer technology has taken forms that the founder of artificial intelligence could not have foreseen. (shrink)

The article discusses the main trends in the development of artificial intelligence systems and robotics (AI&R). The main question that is considered in this context is whether artificial systems are going to become more and more anthropomorphic, both intellectually and physically. In the current article, the author analyzes the current state and prospects of technological development of artificial intelligence and robotics, and also determines the main aspects of the impact of these technologies on society and economy, indicating the geopolitical strategic (...) nature of this influence. The author considers various approaches to the definition of artificial intelligence and robotics, focusing on the subject-oriented and functional ones. It also compares AI&R abilities and human abilities in areas such as categorization, pattern recognition, planning and decision making, etc. Based on this comparison, we investigate in which areas AI&R’s performance is inferior to a human, and in which cases it is superior to one. The modern achievements in the field of robotics and artificial intelligence create the necessary basis for further discussion of the applicability of goal setting in engineering, in the form of a Turing test. It is shown that development of AI&R is associated with certain contradictions that impede the application of Turing’s methodology in its usual format. The basic contradictions in the development of AI&R technologies imply that there is to be a transition to a post-Turing methodology for assessing engineering implementations of artificial intelligence and robotics. In such implementations, on the one hand, the ‘Turing wall’ is removed, and on the other hand, artificial intelligence gets its physical implementation. (shrink)

The aim of this paper is to present and discuss the issue of the adequacy of the Minimum Intelligent Signal Test (MIST) as an alternative to the Turing Test. MIST has been proposed by Chris McKinstry as a better alternative to Turing’s original idea. Two of the main claims about MIST are that (1) MIST questions exploit commonsense knowledge and as a result are expected to be easy to answer for human beings and difficult for computer programs; and that (2) (...) the MIST design aims at eliminating the problem of the role of judges in the test. To discuss these design assumptions we will present Peter D. Turney’s PMI-IR algorithm which allows for MIST-type questions to be answered. We will also present and discuss the results of our own study aimed at the judge problem for MIST. (shrink)

This volume celebrates the various facets of Alan Turing (1912–1954), the British mathematician and computing pioneer, widely considered as the father of computer science. It is aimed at the general reader, with additional notes and references for those who wish to explore the life and work of Turing more deeply. -/- The book is divided into eight parts, covering different aspects of Turing’s life and work. -/- Part I presents various biographical aspects of Turing, some from a personal point of (...) view. -/- Part II presents Turing’s universal machine (now known as a Turing machine), which provides a theoretical framework for reasoning about computation. His 1936 paper on this subject is widely seen as providing the starting point for the field of theoretical computer science. -/- Part III presents Turing’s working on codebreaking during World War II. While the War was a disastrous interlude for many, for Turing it provided a nationally important outlet for his creative genius. It is not an overstatement to say that without Turing, the War would probably have lasted longer, and may even have been lost by the Allies. The sensitive nature of Turning’s wartime work meant that much of this has been revealed only relatively recently. -/- Part IV presents Turing’s post-War work on computing, both at the National Physical Laboratory and at the University of Manchester. He made contributions to both hardware design, through the ACE computer at the NPL, and software, especially at Manchester. Part V covers Turing’s contribution to machine intelligence (now known as Artificial Intelligence or AI). Although Turing did not coin the term, he can be considered a founder of this field which is still active today, authoring a seminal paper in 1950. -/- Part VI covers morphogenesis, Turing’s last major scientific contribution, on the generation of seemingly random patterns in biology and on the mathematics behind such patterns. Interest in this area has increased rapidly in recent times in the field of bioinformatics, with Turing’s 1952 paper on this subject being frequently cited. -/- Part VII presents some of Turing’s mathematical influences and achievements. Turing was remarkably free of external influences, with few co-authors – Max Newman was an exception and acted as a mathematical mentor in both Cambridge and Manchester. -/- Part VIII considers Turing in a wider context, including his influence and legacy to science and in the public consciousness. -/- Reflecting Turing’s wide influence, the book includes contributions by authors from a wide variety of backgrounds. Contemporaries provide reminiscences, while there are perspectives by philosophers, mathematicians, computer scientists, historians of science, and museum curators. Some of the contributors gave presentations at Turing Centenary meetings in 2012 in Bletchley Park, King’s College Cambridge, and Oxford University, and several of the chapters in this volume are based on those presentations – some through transcription of the original talks, especially for Turing’s contemporaries, now aged in their 90s. Sadly, some contributors died before the publication of this book, hence its dedication to them. -/- For those interested in personal recollections, Chapters 2, 3, 11, 12, 16, 17, and 36 will be of interest. For philosophical aspects of Turing’s work, see Chapters 6, 7, 26–31, and 41. Mathematical perspectives can be found in Chapters 35 and 37–39. Historical perspectives can be found in Chapters 4, 8, 9, 10, 13–15, 18, 19, 21–25, 34, and 40. With respect to Turing’s body of work, the treatment in Parts II–VI is broadly chronological. We have attempted to be comprehensive with respect to all the important aspects of Turing’s achievements, and the book can be read cover to cover, or the chapters can be tackled individually if desired. There are cross-references between chapters where appropriate, and some chapters will inevitably overlap. -/- We hope that you enjoy this volume as part of your library and that you will dip into it whenever you wish to enter the multifaceted world of Alan Turing. (shrink)

It has been just over 100 years since the birth of Alan Turing and more than 65 years since he published in Mind his seminal paper, Computing Machinery and Intelligence. In the Mind paper, Turing asked a number of questions, including whether computers could ever be said to have the power of “thinking”. Turing also set up a number of criteria—including his imitation game—under which a human could judge whether a computer could be said to be “intelligent”. Turing’s paper, as (...) well as his important mathematical and computational insights of the 1930s and 1940s led to his popular acclaim as the “Father of Artificial Intelligence”. In the years since his paper was published, however, no computational system has fully satisfied Turing’s challenge. In this paper we focus on a different question, ignored in, but inspired by Turing’s work: How might the Artificial Intelligence practitioner implement “intelligence” on a computational device? Over the past 60 years, although the AI community has not produced a general-purpose computational intelligence, it has constructed a large number of important artifacts, as well as taken several philosophical stances able to shed light on the nature and implementation of intelligence. This paper contends that the construction of any human artifact includes an implicit epistemic stance. In AI this stance is found in commitments to particular knowledge representations and search strategies that lead to a product’s successes as well as its limitations. Finally, we suggest that computational and human intelligence are two different natural kinds, in the philosophical sense, and elaborate on this point in the conclusion. (shrink)

In this paper, we look at the possibility of a machine having a sense of humour. In particular, we focus on actual machine utterances in Turing test discourses. In doing so, we do not consider the Turing test in depth and what this might mean for humanity, rather we merely look at cases in conversations when the output from a machine can be considered to be humorous. We link such outpourings with Turing’s “arguments from various disabilities” used against the concept (...) of a machine being able to think, taken from his seminal work of 1950. Finally we consider the role that humour might play in adding to the deception, integral to the Turing test, that a machine in practice appears to be a human. (shrink)

Dullest book by a major scientist I have ever read. I suppose if you know almost nothing about cognition or AI research you might find this book useful. For anyone else it is a horrific bore. There are hundreds of books in cog sci, robotics, AI, evolutionary psychology and philosophy offering far more info and insight on cognition than this one. Minsky is a top rate senior scientist but it barely shows here. He has alot of good references but they (...) are seldom discussed in any depth and there is lots more left out than included on the subject of AI, cognition and the mind. -/- Those wishing a comprehensive up to date framework for human behavior from the modern two systems view may consult my book ‘The Logical Structure of Philosophy, Psychology, Mind and Language in Ludwig Wittgenstein and John Searle’ 2nd ed (2019). Those interested in more of my writings may see ‘Talking Monkeys--Philosophy, Psychology, Science, Religion and Politics on a Doomed Planet--Articles and Reviews 2006-2019 3rd ed (2019), The Logical Structure of Human Behavior (2019), and Suicidal Utopian Delusions in the 21st Century 4th ed (2019). (shrink)

Quand on se penche sur l’héritage philosophique de Turing, deux risques se posent. Le premier, c’est de le réduire à son test célèbre (Turing 1950). Ce qui a toutefois le mérite de la clarté. N’importe qui peut reconnaître la contribution en question et la situer dans le débat important sur la philosophie de l’intelligence artificielle. Le second risque est de le diluer dans un récit universel, faisant des idées deTuring les graines de tout ce que nous faisons et savons aujourd’hui. (...) Ceci a l’avantage de reconnaître la grandeur de ce génie. Cependant, dans un cas comme dans l’autre, nous allons probablement moins identifier les contributions conceptuelles deTuring qui nous ont aidés à forger un discours philosophique contemporain et qui méritent d’être approfondies et développées. Pour éviter ces deux risques, je me concentrerai dans les pages suivantes sur trois leçons philosophiques spécifiques, qui me semblent particulièrement significatives pour l’émergence de la philosophie de l’information et ses développements. Je ne propose pas ici une analyse philologique ni savante,mais un exercice minimaliste, herméneutique. Façon de faire écho àla démarche deTuring et de rendre hommage àson génie extraordinaire :ses interprètes n’ont pas fini de tirer parti de son héritage intellectuel. Je souhaite qu’un jourTuring devienne aussi important que Frege dans notre canon philosophique. (shrink)

Despite intensive debates regarding action imitation and sentence imitation, few studies have examined their relationship. In this paper, we argue that the mechanism of action imitation is necessary and in some cases sufficient to describe sentence imitation. We first develop a framework for action imitation in which key ideas of Hurley’s shared circuits model are integrated with Wolpert et al.’s motor selection mechanism and its extensions. We then explain how this action-based framework clarifies sentence imitation without a language-specific faculty. Finally, (...) we discuss the empirical support for and philosophical significance of this perspective. (shrink)

The article deals with some ideas by Turing concerning the background and the birth of the well-known Turing Test, showing the evolution of the main question proposed by Turing on thinking machine. The notions he used, especially that one of imitation, are not so much exactly defined and shaped, but for this very reason they have had a deep impact in artificial intelligence and cognitive science research from an epistemological point of view. Then, it is suggested that the fundamental concept (...) involved in Turing’s imitation game, conceived as a test for detecting the presence of intelligence in an artificial entity, is the concept of interaction, that Turing adopts in a wider, more intuitive and more fruitful sense than the one that is proper to the current research in interactive computing. (shrink)

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 (...) program must not be created by some set of sentient beings enacting responses to all possible inputs. (3) That in the current state of cognitive science it must be an open possibility that a computational model of the human mind will be developed that accounts for at least its nonphenomenological properties. Given ground rule 3, the HT program could simply be an “optimized” version of some computational model of a mind, created via the automatic application of program-transformation rules [thus satisfying ground rule 2]. Therefore, whatever mental states one would be willing to impute to an ordinary computational model of the human psyche one should be willing to grant to the optimized version as well. Hence no one could dismiss out of hand the possibility that the HT program was intelligent. This conclusion is important because the Humongous-Table Program Argument is the only argument ever marshalled against the sufficiency of the Turing Test, if we exclude arguments that cognitive science is simply not possible. (shrink)

Anti-behaviorist arguments against the validity of the Turing Test as a sufficient condition for attributing intelligence are based on a memorizing machine, which has recorded within it responses to every possible Turing Test interaction of up to a fixed length. The mere possibility of such a machine is claimed to be enough to invalidate the Turing Test. I consider the nomological possibility of memorizing machines, and how long a Turing Test they can pass. I replicate my previous analysis of this (...) critical Turing Test length based on the age of the universe, show how considerations of communication time shorten that estimate and allow eliminating the sole remaining contingent assumption, and argue that the bound is so short that it is incompatible with the very notion of the Turing Test. I conclude that the memorizing machine objection to the Turing Test as a sufficient condition for attributing intelligence is invalid. (shrink)