DOCSLIB.ORG

The Turing Guide Free

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
The Turing Guide Free FREE THE TURING GUIDE PDF Jack Copeland,Jonathan Bowen,Mark Sprevak,Robin Wilson | 544 pages | 02 Feb 2017 | Oxford University Press | 9780198747833 | English | Oxford, United Kingdom The Turing Test Walkthrough Goodreads helps you keep track of books you want to read. Want to Read saving…. Want to Read Currently Reading Read. Other editions. Enlarge cover. Error rating book. Refresh and try The Turing Guide. Open Preview See a Problem? Jack Copeland. Details if other :. Thanks for telling us about the problem. Return to Book Page. Preview — The Turing Guide by B. The Turing Guide by B. Jack Copeland Editor. Jonathan Bowen Editor. Mark Sprevak Editor. Robin J. Wilson Editor. Alan Turing has long proved a subject of fascination, but following the centenary of his birth inthe code-breaker, computer pioneer, mathematician and much more has become even more celebrated with much media coverage, and several meetings, conferences and books raising public awareness of Turing's life and work. This The Turing Guide will bring together contributions from s Alan Turing The Turing Guide long proved a subject of fascination, but following the centenary of his birth inthe code-breaker, computer pioneer, mathematician and much more has become even more celebrated with much media coverage, and several meetings, conferences and books raising public awareness of Turing's life and work. This volume will bring together contributions from some of the leading experts on Alan Turing to create a comprehensive guide to Turing that will serve as a useful resource for researchers in the area as well as the increasingly interested general reader. The book will cover aspects of Turing's life and the wide range of his intellectual activities, including mathematics, code-breaking, computer science, logic, artificial intelligence and mathematical biology, as well as his subsequent influence. Get A Copy. Hardcoverpages. More Details Other Editions 2. Friend Reviews. To see what your friends thought of this book, please sign up. To ask other readers questions about The Turing Guideplease sign up. Lists with This Book. This book is not The Turing Guide featured on Listopia. Community Reviews. Showing Average rating 4. Rating details. More filters. Sort order. Start your review of The Turing Guide. There have been plenty of biographies of Alan Turing, including Jack Copeland's own excellent Turing: Pioneer of the Information Age, but this chunky volume is something quite different - a massive, 42 section collection of articles about different aspects of Turing's work, from the inevitable Enigma and Tunny deciphering working during the Second World War, through the development of programmable computers, the Turing test and Turing's little-known foray into biology. Like all such collections, There have been plenty of biographies of Alan Turing, including Jack Copeland's own excellent Turing: Pioneer of the Information Age, but this chunky volume is something quite different - a massive, 42 section collection of articles about different aspects of Turing's work, from the inevitable Enigma and Tunny deciphering working during the Second World War, through the development of programmable computers, the Turing test and Turing's little-known foray into biology. Like all such collections, it suffers a little from overlap in sections and variability in quality, however what the approach enables the authors to do is to go into far more depth than I have seen elsewhere. So, for instance, there is an article on the use of the Manchester computers to produce the first computer-generated music which includes the details of how this was programmed and an analysis of the notes produced and how the recording was made at the wrong speed, changing the frequencies. Similarly there is far more depth on the approaches taken to crack the German codes, the mechanisms of the bombes and Collosus computers used at Bletchley Park. This is a goldmine of information if you enjoy delving into the depths of these examples of human ingenuity. I did find that after about the first half I was rather losing steam. The sections on AI and the mind, biology and mathematics seemed less approachable than the rest, though that may just be reader fatigue. Even so there's lots here that will appeal. Only one section stands out as particularly poor - a contribution by Stephen Wolfram which is entitled 'A century of Turing' but might The Turing Guide been better described as 'How Turing was Nearly as Clever as I am', as it seems far more The Turing Guide Wolfram than Turing. The Turing Guide biggest appeal of this book is likely to The Turing Guide for those who want to dig into more depth in the ways that Enigma and Tunny were dealt with, and in those early ACE and Baby computers, than can The Turing Guide covered in a typical scientific biography. There are also The Turing Guide highlights of information about Turing the person I have not seen elsewhere, although the Guide doesn't really work to The Turing Guide a rounded picture of the man. Rather than a book to read end-to-end, this collection seems better suited as a reference on these different aspects of Turing's work, providing excellent snapshots of this remarkable individual, who should have been recognised far earlier for his contributions than security restrictions allowed. View 1 comment. Mar 23, Heather rated it it was amazing. This is a fascinating book, full of personal accounts from those who knew Alan best. At times The Turing Guide was redundant in the essays, and there were several The Turing Guide skipped because they were extra math-y and therefore way beyond my comprehension. Would've liked to see more of Turing's work on ordinal logics. Very good The Turing Guide, though. I'll admit that the final few chapters that delve into mathematical theory defeated me somewhat, but the rest proved to be a hugely fascinating read. Sep 21, Rob rated it it was amazing. This was a fascinating book. Probably, most people, like myself, would be familiar with the activities of Alan Turing through his code breaking exploits during the war at Bletchley Park. This is covered in depth codebreakingpun intended within this book, but so too are his exploits in regards to computing, AI, biology, chess and the paranormal! It dips in to mathematics, computing and biology in ways that possibly only mathematicians, computer scientists and biologists would be interested in, but for the uninitiated a quick skim of those sections is all that is needed. If you want to know more about The Turing Guide Turing this a brilliant multi-source fact file. Such a clever fellow, let down by the laws of the time to die alone, with a crimincal record, The Turing Guide castrated and unappreciated. Jan Vanbuel rated it really liked it Sep 26, Paul Vittay rated it really liked it Aug 25, Jonathan P. Bowen rated it it was amazing Aug 03, Greg rated it liked it Sep 15, Fatin Ali rated it really liked it Feb 15, Ozlem Aslan rated it really liked it Aug 14, Victor rated it it was ok Apr 14, Rory Braybrook rated it liked it Jan 04, Tom Prosser rated it really liked it Jul 10, Abdullah O. Leo Arias rated it really liked it Jan 06, Robert Nansel rated it it was amazing Oct 14, Rhonda marked it as to-read Jan 07, Selda marked it as to- read Jan 08, Gavin marked it as to-read Jan 19, Harry marked it as to-read Jan 23, Rose marked it as to-read Feb 07, Dave Barker marked it as to-read Feb 20, Jeffrey marked it as to-read Jul 27, Simon marked it as to-read Aug 30, Marcelo Prates marked it as to-read Jan 22, Marianne marked it as to-read Mar 14, Juanjo Dolz Marco marked it as to-read Mar 22, Sophia Nan Nakhla marked it as to-read Mar 24, Mark is currently reading it Apr 11, Dominique marked it as to-read Apr 25, Patrick Cunningham marked it as to-read May 18, Chantelle marked it as to- read Jun 16, Katarina marked it as to-read The Turing Guide 30, Ali marked it as to-read Jul 25, Eileen reisin marked it as to-read Sep 26, Tolga Karahan marked it The Turing Guide to-read Nov 15, The Turing Guide by B. Jack Copeland As a global organization, we, like many others, recognize the significant threat posed by the coronavirus. During this time, we have made some of our learning resources freely accessible. Our distribution centers are open and orders can be placed online. Do be advised that shipments may be delayed due to extra safety precautions implemented at our centers and delays with local shipping carriers. Alan Turing The Turing Guide long proved a subject of fascination, but following the centenary of his birth inthe code-breaker, computer pioneer, mathematician and much more has become even more celebrated with much media coverage, and several meetings, conferences and books raising public awareness of Turing's life and work. This volume will bring together contributions from some of the leading experts on Alan Turing to create a comprehensive guide to Turing that will serve as a useful resource for researchers in the area as well as the increasingly interested general reader. The book will cover aspects of Turing's life and the wide range of his intellectual activities, including mathematics, code-breaking, computer science, logic, artificial intelligence and mathematical biology, as well as his subsequent influence. Biography 1. DORAN Is the whole universe a computer? He has been script advisor and scientific consultant for a number of recent documentaries The Turing Guide Turing.
Load more

Recommended publications
  • APA Newsletter on Philosophy and Computers, Vol. 18, No. 2 (Spring
    NEWSLETTER | The American Philosophical Association Philosophy and Computers SPRING 2019 VOLUME 18 | NUMBER 2 FEATURED ARTICLE Jack Copeland and Diane Proudfoot Turing’s Mystery Machine ARTICLES Igor Aleksander Systems with “Subjective Feelings”: The Logic of Conscious Machines Magnus Johnsson Conscious Machine Perception Stefan Lorenz Sorgner Transhumanism: The Best Minds of Our Generation Are Needed for Shaping Our Future PHILOSOPHICAL CARTOON Riccardo Manzotti What and Where Are Colors? COMMITTEE NOTES Marcello Guarini Note from the Chair Peter Boltuc Note from the Editor Adam Briggle, Sky Croeser, Shannon Vallor, D. E. Wittkower A New Direction in Supporting Scholarship on Philosophy and Computers: The Journal of Sociotechnical Critique CALL FOR PAPERS VOLUME 18 | NUMBER 2 SPRING 2019 © 2019 BY THE AMERICAN PHILOSOPHICAL ASSOCIATION ISSN 2155-9708 APA NEWSLETTER ON Philosophy and Computers PETER BOLTUC, EDITOR VOLUME 18 | NUMBER 2 | SPRING 2019 Polanyi’s? A machine that—although “quite a simple” one— FEATURED ARTICLE thwarted attempts to analyze it? Turing’s Mystery Machine A “SIMPLE MACHINE” Turing again mentioned a simple machine with an Jack Copeland and Diane Proudfoot undiscoverable program in his 1950 article “Computing UNIVERSITY OF CANTERBURY, CHRISTCHURCH, NZ Machinery and Intelligence” (published in Mind). He was arguing against the proposition that “given a discrete- state machine it should certainly be possible to discover ABSTRACT by observation sufficient about it to predict its future This is a detective story. The starting-point is a philosophical behaviour, and this within a reasonable time, say a thousand discussion in 1949, where Alan Turing mentioned a machine years.”3 This “does not seem to be the case,” he said, and whose program, he said, would in practice be “impossible he went on to describe a counterexample: to find.” Turing used his unbreakable machine example to defeat an argument against the possibility of artificial I have set up on the Manchester computer a small intelligence.
    [Show full text]
  • The Turing Guide
    The Turing Guide Edited by Jack Copeland, Jonathan Bowen, Mark Sprevak, and Robin Wilson • A complete guide to one of the greatest scientists of the 20th century • Covers aspects of Turing’s life and the wide range of his intellectual activities • Aimed at a wide readership • This carefully edited resource written by a star-studded list of contributors • Around 100 illustrations This carefully edited resource brings together contributions from some of the world’s leading experts on Alan Turing to create a comprehensive guide that will serve as a useful resource for researchers in the area as well as the increasingly interested general reader. “The Turing Guide is just as its title suggests, a remarkably broad-ranging compendium of Alan Turing’s lifetime contributions. Credible and comprehensive, it is a rewarding exploration of a man, who in his life was appropriately revered and unfairly reviled.” - Vint Cerf, American Internet pioneer JANUARY 2017 | 544 PAGES PAPERBACK | 978-0-19-874783-3 “The Turing Guide provides a superb collection of articles £19.99 | $29.95 written from numerous different perspectives, of the life, HARDBACK | 978-0-19-874782-6 times, profound ideas, and enormous heritage of Alan £75.00 | $115.00 Turing and those around him. We find, here, numerous accounts, both personal and historical, of this great and eccentric man, whose life was both tragic and triumphantly influential.” - Sir Roger Penrose, University of Oxford Ordering Details ONLINE www.oup.com/academic/mathematics BY TELEPHONE +44 (0) 1536 452640 POSTAGE & DELIVERY For more information about postage charges and delivery times visit www.oup.com/academic/help/shipping/.
    [Show full text]
  • Ted Nelson History of Computing
    History of Computing Douglas R. Dechow Daniele C. Struppa Editors Intertwingled The Work and Influence of Ted Nelson History of Computing Founding Editor Martin Campbell-Kelly, University of Warwick, Coventry, UK Series Editor Gerard Alberts, University of Amsterdam, Amsterdam, The Netherlands Advisory Board Jack Copeland, University of Canterbury, Christchurch, New Zealand Ulf Hashagen, Deutsches Museum, Munich, Germany John V. Tucker, Swansea University, Swansea, UK Jeffrey R. Yost, University of Minnesota, Minneapolis, USA The History of Computing series publishes high-quality books which address the history of computing, with an emphasis on the ‘externalist’ view of this history, more accessible to a wider audience. The series examines content and history from four main quadrants: the history of relevant technologies, the history of the core science, the history of relevant business and economic developments, and the history of computing as it pertains to social history and societal developments. Titles can span a variety of product types, including but not exclusively, themed volumes, biographies, ‘profi le’ books (with brief biographies of a number of key people), expansions of workshop proceedings, general readers, scholarly expositions, titles used as ancillary textbooks, revivals and new editions of previous worthy titles. These books will appeal, varyingly, to academics and students in computer science, history, mathematics, business and technology studies. Some titles will also directly appeal to professionals and practitioners
    [Show full text]
  • Alan Turing's Forgotten Ideas
    Alan Turing, at age 35, about the time he wrote “Intelligent Machinery” Copyright 1998 Scientific American, Inc. lan Mathison Turing conceived of the modern computer in 1935. Today all digital comput- Aers are, in essence, “Turing machines.” The British mathematician also pioneered the field of artificial intelligence, or AI, proposing the famous and widely debated Turing test as a way of determin- ing whether a suitably programmed computer can think. During World War II, Turing was instrumental in breaking the German Enigma code in part of a top-secret British operation that historians say short- ened the war in Europe by two years. When he died Alan Turing's at the age of 41, Turing was doing the earliest work on what would now be called artificial life, simulat- ing the chemistry of biological growth. Throughout his remarkable career, Turing had no great interest in publicizing his ideas. Consequently, Forgotten important aspects of his work have been neglected or forgotten over the years. In particular, few people— even those knowledgeable about computer science— are familiar with Turing’s fascinating anticipation of connectionism, or neuronlike computing. Also ne- Ideas glected are his groundbreaking theoretical concepts in the exciting area of “hypercomputation.” Accord- ing to some experts, hypercomputers might one day in solve problems heretofore deemed intractable. Computer Science The Turing Connection igital computers are superb number crunchers. DAsk them to predict a rocket’s trajectory or calcu- late the financial figures for a large multinational cor- poration, and they can churn out the answers in sec- Well known for the machine, onds.
    [Show full text]
  • Report on the First IEEE Workshop on the Future of Research Curation Andnational Research Reproducibility Science Foundation 5-6 November 2016 Award #1641014
    Report on the First IEEE Workshop on the Future of Research Curation andNational Research Reproducibility Science Foundation 5-6 November 2016 Award #1641014 Report on the First IEEE Workshop on the Future of Research Curation and Research Reproducibility 5-6 November 2016 WASHINGTON, DC Report for NSF Award #1641014 Page 1 Report on the First IEEE Workshop on the Future of Research Curation and Research Reproducibility 5-6 November 2016 This page intentionally left blank Report for NSF Award #1641014 Page 2 Report on the First IEEE Workshop on the Future of Research Curation and Research Reproducibility 5-6 November 2016 Report on the First IEEE Workshop on The Future of Research Curation and Research Reproducibility Marriott Marquis, Washington, DC, USA 5-6 November 2016 National Science Foundation Award #1641014 Steering Committee Chair: John Baillieul, Boston University Larry Hall, University of South Florida José M.F. Moura, Carnegie Mellon Sheila Hemami, Draper Labs Gianluca Setti, University of Ferrara Michael Forster, IEEE Gerry Grenier, IEEE Fran Zappulla, IEEE John Keaton, IEEE Douglas McCormick and Kenneth Moore, rapporteurs Report for NSF Award #1641014 Page 3 Report on the First IEEE Workshop on the Future of Research Curation and Research Reproducibility 5-6 November 2016 Contents Attendees ...................................................................................................................................................... 6 Preface .........................................................................................................................................................
    [Show full text]
  • On Four Types of Argumentation for Classical Logic
    ROCZNIKI FILOZOFICZNE Tom LXVIII, numer 4 – 2020 DOI: https://doi.org/10.18290/rf20684-13 BOŻENA CZERNECKA-REJ * ON FOUR TYPES OF ARGUMENTATION FOR CLASSICAL LOGIC Classical logic1 has been many times submitted to varied criticism and at the beginning of the second half of the 20th century—together with the progressing multiplication of non-classical logical calculi – its imminent death was even prophesied. Nevertheless, it still remains the most permanent paradigm of logic as a scientific discipline. It seems that the time has gone irrevocably when it was believed that two-valued logic did not only stand in conflict with our intuitions but using it might lead to contradictions. After numerous fruitless searches, the scientists even lost hope to create a better logic than two-valued logic2. Naturally, different types of non-classical logic function which solve certain local problems and which standard logic cannot cope with. Leslie H. Tharp in his article Which Logic Is the Right Logic? puts the question about the properties that the correct system of logic should possess. He states that standard first-order logic is commonly considered to be the basic logical tool – “it appears not to go beyond what one would call logic, the problem evidently is whether it can be extended” (THARP 1975, 4). He BOŻENA CZERNECKA-REJ, PhD Habil., Associate Professor at the John Paul II Catholic University of Lublin, Faculty of Philosophy, Institute of Philosophy, Department of Logic; address for corres- pondence: Al. Racławickie 14, 20-950 Lublin; e-mail: [email protected]; ORCID: https://orcid.org/0000-0002-2992-4560.
    [Show full text]
  • Computer Simulations in Metaphysics: Possibilities and Limitations1 ______
    COMPUTER SIMULATIONS IN METAPHYSICS: POSSIBILITIES AND LIMITATIONS1 _________ BILLY WHEELER https://orcid.org/0000-0001-7017-2674 Sun Yat-Sen University Department of Philosophy Zhuhai, Guangzhou China [email protected] Article info CDD: 110 Received: 05.07.2019; Revised: 13.09.2019; Accepted: 13.09.2019 DOI: http://dx.doi.org/10.1590/0100-6045.2019.V42N3.BW Keywords Computer modeling Computer simulation Methods in metaphysics Humean Supervenience Nomic Necessity Abstract: Computer models and simulations have provided enormous benefits to researchers in the natural and social sciences, as well as many areas of philosophy. However, to date, there has been little attempt to use computer models in the development and evaluation of metaphysical theories. This is a shame, as there are good reasons for believing that metaphysics could benefit just as 1 Earlier versions of this paper were presented at the Forum on Philosophical Methods at Sun Yat-Sen University, Zhuhai as well as the 8th Asia-Pacific Conference on Philosophy of Science at Fudan University, Shanghai. I thank the participants for their helpful comments. I am also grateful to two anonymous reviewers from Manuscrito who also provided invaluable feedback on an earlier version of this paper. Manuscrito – Rev. Int. Fil. Campinas, v. 42, n. 3, pp. 108-148, Jul-Sep. 2019. Billy Wheeler 109 much from this practice as other disciplines. In this paper I assess the possibilities and limitations of using computer models in metaphysics. I outline the way in which different kinds of model could be useful for different areas of metaphysics, and I illustrate in more detail how agent-based models specifically could be used to model two well-known theories of laws: David Lewis’s "Best System Account" and David Armstrong's "Nomic Necessitation" view.
    [Show full text]
  • Computability Computability Computability Turing, Gödel, Church, and Beyond Turing, Gödel, Church, and Beyond Edited by B
    computer science/philosophy Computability Computability Computability turing, Gödel, Church, and beyond turing, Gödel, Church, and beyond edited by b. Jack Copeland, Carl J. posy, and oron Shagrir edited by b. Jack Copeland, Carl J. posy, and oron Shagrir Copeland, b. Jack Copeland is professor of philosophy at the ContributorS in the 1930s a series of seminal works published by university of Canterbury, new Zealand, and Director Scott aaronson, Dorit aharonov, b. Jack Copeland, martin Davis, Solomon Feferman, Saul alan turing, Kurt Gödel, alonzo Church, and others of the turing archive for the History of Computing. Kripke, Carl J. posy, Hilary putnam, oron Shagrir, Stewart Shapiro, Wilfried Sieg, robert established the theoretical basis for computability. p Carl J. posy is professor of philosophy and member irving Soare, umesh V. Vazirani editors and Shagrir, osy, this work, advancing precise characterizations of ef- of the Centers for the Study of rationality and for lan- fective, algorithmic computability, was the culmina- guage, logic, and Cognition at the Hebrew university tion of intensive investigations into the foundations of Jerusalem. oron Shagrir is professor of philoso- of mathematics. in the decades since, the theory of phy and Former Chair of the Cognitive Science De- computability has moved to the center of discussions partment at the Hebrew university of Jerusalem. He in philosophy, computer science, and cognitive sci- is currently the vice rector of the Hebrew university. ence. in this volume, distinguished computer scien- tists, mathematicians, logicians, and philosophers consider the conceptual foundations of comput- ability in light of our modern understanding. Some chapters focus on the pioneering work by turing, Gödel, and Church, including the Church- turing thesis and Gödel’s response to Church’s and turing’s proposals.
    [Show full text]
  • Alan Turing, Computing, Bletchley, and Mathematics, Wellington Public
    Alan Turing, Computing, Bletchley, and Mathematics Rod Downey Victoria University Wellington New Zealand Downey's research is supported by the Marsden Fund, and this material also by the Newton Institute. Wellington, February 2015 Turing I Turing has become a larger than life figure following the movie \The Imitation Game". I which followed Andrew Hodges book \Alan Turing : The Enigma", I which followed the release of classified documents about WWII. I I will try to comment on aspects of Turing's work mentioned in the movie. I I will give extensive references if you want to follow this up, including the excellent Horizon documentary. I Posted to my web site. Type \rod downey" into google. Turing Award I The equivalent of the \Nobel Prize" in computer science is the ACM Turing Award. I It is for life work in computer science and worth about $1M. I Why? This award was made up (1966) was well before Bletchley became public knowledge. I (Aside) Prof. D. Ritchie (Codebreaker)-from \Station X, Pt 3" Alan Turing was one of the figures of the century. || There were great men at Bletchley Park, but in the long hall of history Turing's name will be remembered as Number One in terms of consequences for mankind. Logic I Aristotle and other early Greeks then \modern" re-invention: Leibnitz (early 18th C), Boole, Frege, etc. I We want a way to represent arguments, language, processes etc by formal symbols and manipulate them like we do numbers to determine, e.g. validity of argument. I Simplest modern formal system propositional logic.
    [Show full text]
  • The Enigma Behind the Good–Turing Formula
    Snapshots of modern mathematics № 8/2021 from Oberwolfach The Enigma behind the Good–Turing formula Fadoua Balabdaoui • Yulia Kulagina Finding the total number of species in a population based on a finite sample is a difficult but practically important problem. In this snapshot, we will at- tempt to shed light on how during World War II, two cryptanalysts, Irving J. Good and Alan M. Turing, discovered one of the most widely applied formulas in statistics. The formula estimates the probability of missing some of the species in a sample drawn from a heterogeneous population. We will provide some intuition behind the formula, show its wide range of applications, and give a few technical details. 1 The species richness problem 1.1 Motivation and example Say we have a population comprising individuals drawn from K (possibly infinite) distinct species, among which a lot of species may be rare, andafew are very common. Our goal is to either estimate the frequencies of the species in the population based on the number of their occurrences in a finite sample, or simply to estimate the number of classes K in the population from the sample. 1 1 The term “population frequency” commonly refers to the true (unknown) proportion. It is usually contrasted with the word “empirical” that the reader will encounter later. 1 We use the word “species” in a broad sense. It may refer to flora and fauna, to types of errors in a software system, to celestial bodies in the universe, to word-types in a language, to connected components in a graph, and so on.
    [Show full text]
  • Alan Turing's Automatic Computing Engine
    5 Turing and the computer B. Jack Copeland and Diane Proudfoot The Turing machine In his first major publication, ‘On computable numbers, with an application to the Entscheidungsproblem’ (1936), Turing introduced his abstract Turing machines.1 (Turing referred to these simply as ‘computing machines’— the American logician Alonzo Church dubbed them ‘Turing machines’.2) ‘On Computable Numbers’ pioneered the idea essential to the modern computer—the concept of controlling a computing machine’s operations by means of a program of coded instructions stored in the machine’s memory. This work had a profound influence on the development in the 1940s of the electronic stored-program digital computer—an influence often neglected or denied by historians of the computer. A Turing machine is an abstract conceptual model. It consists of a scanner and a limitless memory-tape. The tape is divided into squares, each of which may be blank or may bear a single symbol (‘0’or‘1’, for example, or some other symbol taken from a finite alphabet). The scanner moves back and forth through the memory, examining one square at a time (the ‘scanned square’). It reads the symbols on the tape and writes further symbols. The tape is both the memory and the vehicle for input and output. The tape may also contain a program of instructions. (Although the tape itself is limitless—Turing’s aim was to show that there are tasks that Turing machines cannot perform, even given unlimited working memory and unlimited time—any input inscribed on the tape must consist of a finite number of symbols.) A Turing machine has a small repertoire of basic operations: move left one square, move right one square, print, and change state.
    [Show full text]
  • Can Machines Think? the Controversy That Led to the Turing Test, 1946-1950
    Can machines think? The controversy that led to the Turing test, 1946-1950 Bernardo Gonçalves1 Abstract Turing’s much debated test has turned 70 and is still fairly controversial. His 1950 paper is seen as a complex and multi-layered text and key questions remain largely unanswered. Why did Turing choose learning from experience as 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 off for conversational question-answering later in 1950? Why did Turing refer to gender imitation in a test for machine intelligence? In this article I shall address these questions directly by unveiling social, historical and epistemological roots of the so-called Turing test. I will draw attention to a historical fact that has been scarcely observed in the secondary literature so far, namely, that Turing's 1950 test came out of a controversy over the cognitive capabilities of digital computers, most notably with physicist and computer pioneer Douglas Hartree, chemist and philosopher Michael Polanyi, and neurosurgeon Geoffrey Jefferson. Seen from 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 against his view that machines can think. Keywords: Alan Turing, Can machines think?, The imitation game, The Turing test, Mind-machine controversy, History of artificial intelligence. Robin Gandy (1919-1995) was one of Turing’s best friends and his only doctorate student. He received Turing’s mathematical books and papers when Turing died in 1954, and took over from Max Newman in 1963 the task of editing the papers for publication.1 Regarding Turing’s purpose in writing his 1950 paper and sending it for publication, Gandy offered a testimony previously brought forth by Jack Copeland which has not yet been commented about:2 It was intended not so much as a penetrating contribution to philosophy but as propaganda.
    [Show full text]