The Essential Turing Alan M
Total Page:16
File Type:pdf, Size:1020Kb
The Essential Turing Alan M. Turing The Essential Turing Seminal Writings in Computing, Logic, Philosophy, Artificial Intelligence, and Artificial Life plus The Secrets of Enigma Edited by B. Jack Copeland CLARENDON PRESS OXFORD Great Clarendon Street, Oxford OX2 6DP Oxford University Press is a department of the University of Oxford. It furthers the University’s objective of excellence in research, scholarship, and education by publishing worldwide in Oxford New York Auckland Cape Town Dar es Salaam Hong Kong Karachi Kuala Lumpur Madrid Melbourne Mexico City Nairobi New Delhi Taipei Toronto Shanghai With offices in Argentina Austria Brazil Chile Czech Republic France Greece Guatemala Hungary Italy Japan South Korea Poland Portugal Singapore Switzerland Thailand Turkey Ukraine Vietnam Published in the United States by Oxford University Press Inc., New York © In this volume the Estate of Alan Turing 2004 Supplementary Material © the several contributors 2004 The moral rights of the author have been asserted Database right Oxford University Press (maker) First published 2004 All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, without the prior permission in writing of Oxford University Press, or as expressly permitted by law, or under terms agreed with the appropriate reprographics rights organization. Enquiries concerning reproduction outside the scope of the above should be sent to the Rights Department, Oxford University Press, at the address above. You must not circulate this book in any other binding or cover and you must impose this same condition on any acquirer. British Library Cataloguing in Publication Data Data available Library of Congress Cataloging in Publication Data Data available ISBN 0–19–825079–7 ISBN 0–19–825080–0 (pbk.) 10 9 8 7 6 5 4 3 Typeset by Kolam Information Services Pvt. Ltd, Pondicherry, India Printed in Great Britain on acid-free paper by Biddles Ltd., King’s Lynn, Norfolk Acknowledgements Work on this book began in 2000 at the Dibner Institute for the History of Science and Technology, Massachusetts Institute of Technology, and was com- pleted at the University of Canterbury, New Zealand. I am grateful to both these institutions for aid, and to the following for scholarly assistance: John Andreae, Friedrich Bauer, Frank Carter, Alonzo Church Jnr, David Clayden, Bob Doran, Ralph Erskine, Harry Fensom, Jack Good, John Harper, Geoff Hayes, Peter Hilton, Harry Huskey, Eric Jacobson, Elizabeth Mahon, Philip Marks, Elisabeth Norcliffe, Rolf Noskwith, Gualtiero Piccinini, Andre´s Sicard, Wilfried Sieg, Frode Weierud, Maurice Wilkes, Mike Woodger, and especially Diane Proudfoot. This book would not have existed without the support of Turing’s literary executor, P. N. Furbank, and that of Peter Momtchiloff at Oxford University Press. B.J.C. This page intentionally left blank Contents Alan Turing 1912–1954 1 Jack Copeland Computable Numbers: A Guide 5 Jack Copeland 1. On Computable Numbers, with an Application to the Entscheidungsproblem (1936) 58 2. On Computable Numbers: Corrections and Critiques 91 Alan Turing, Emil Post, and Donald W. Davies 3. Systems of Logic Based on Ordinals (1938 ), including excerpts from Turing’s correspondence, 1936–1938 125 4. Letters on Logic to Max Newman (c.1940) 205 Enigma 217 Jack Copeland 5. History of Hut 8 to December 1941 (1945 ), featuring an excerpt from Turing’s ‘Treatise on the Enigma’ 265 Patrick Mahon 6. Bombe and Spider (1940 ) 313 7. Letter to Winston Churchill (1941) 336 8. Memorandum to OP-20-G on Naval Enigma (c.1941) 341 Artificial Intelligence 353 Jack Copeland 9. Lecture on the Automatic Computing Engine (1947 ) 362 10. Intelligent Machinery (1948) 395 viii | Contents 11. Computing Machinery and Intelligence (1950) 433 12. Intelligent Machinery, A Heretical Theory (c.1951) 465 13. Can Digital Computers Think? (1951) 476 14. Can Automatic Calculating Machines Be Said to Think? (1952) 487 Alan Turing, Richard Braithwaite, Geoffrey Jefferson, and Max Newman Artificial Life 507 Jack Copeland 15. The Chemical Basis of Morphogenesis (1952) 519 16. Chess (1953) 562 17. Solvable and Unsolvable Problems (1954) 576 Index 597 Alan Turing 1912–1954 Jack Copeland Alan Mathison Turing was born on 23 June 1912 in London1;hediedon7 June 1954 at his home in Wilmslow, Cheshire. Turing contributed to logic, mathematics, biology, philosophy, cryptanalysis, and formatively to the areas later known as computer science, cognitive science, ArtiWcial Intelligence, and ArtiWcial Life. Educated at Sherborne School in Dorset, Turing went up to King’s College, Cambridge, in October 1931 to read Mathematics. He graduated in 1934, and in March 1935 was elected a Fellow of King’s, at the age of only 22. In 1936 he published his most important theoretical work, ‘On Computable Numbers, with an Application to the Entscheidungsproblem [Decision Problem]’ (Chapter 1, with corrections in Chapter 2). This article described the abstract digital com- puting machine—now referred to simply as the universal Turing machine—on which the modern computer is based. Turing’s fundamental idea of a universal stored-programme computing machine was promoted in the United States by John von Neumann and in England by Max Newman. By the end of 1945 several groups, including Turing’s own in London, were devising plans for an electronic stored-programme universal digital computer—a Turing machine in hardware. In 1936 Turing left Cambridge for the United States in order to continue his research at Princeton University. There in 1938 he completed a Ph.D. entitled ‘Systems of Logic Based on Ordinals’, subsequently published under the same title (Chapter 3, with further exposition in Chapter 4). Now a classic, this work addresses the implications of Go¨del’s famous incompleteness result. Turing gave a new analysis of mathematical reasoning, and continued the study, begun in ‘On Computable Numbers’, of uncomputable problems—problems that are ‘too hard’ to be solved by a computing machine (even one with unlimited time and memory). Turing returned to his Fellowship at King’s in the summer of 1938. At the outbreak of war with Germany in September 1939 he moved to Bletchley Park, the wartime headquarters of the Government Code and Cypher School (GC & CS). Turing’s brilliant work at Bletchley Park had far-reaching consequences. 1 At 2 Warrington Crescent, London W9, where now there is a commemorative plaque. 2 | Jack Copeland ‘I won’t say that what Turing did made us win the war, but I daresay we might have lost it without him’, said another leading Bletchley cryptanalyst.2 Turing broke Naval Enigma—a decisive factor in the Battle of the Atlantic—and was the principal designer of the ‘bombe’, a high-speed codebreaking machine. The ingenious bombes produced a Xood of high-grade intelligence from Enigma. It is estimated that the work done by Turing and his colleagues at GC & CS shortened the war in Europe by at least two years.3 Turing’s contribution to the Allied victory was a state secret and the only oYcial recognition he received, the Order of the British Empire, was in the circumstances derisory. The full story of Turing’s involvement with Enigma is told for the Wrst time in this volume, the material that forms Chapters 5, 6, and 8 having been classiWed until recently. In 1945, the war over, Turing was recruited to the National Physical Labora- tory (NPL) in London, his brief to design and develop an electronic digital computer—a concrete form of the universal Turing machine. His design (for the Automatic Computing Engine or ACE) was more advanced than anything else then under consideration on either side of the Atlantic. While waiting for the engineers to build the ACE, Turing and his group pioneered the science of computer programming, writing a library of sophisticated mathematical pro- grammes for the planned machine. Turing founded the Weld now called ‘ArtiWcial Intelligence’ (AI) and was a leading early exponent of the theory that the human brain is in eVect a digital computer. In February 1947 he delivered the earliest known public lecture to mention computer intelligence (‘Lecture on the Automatic Computing Engine’ (Chapter 9)). His technical report ‘Intelligent Machinery’ (Chapter 10), written for the NPL in 1948, was eVectively the Wrst manifesto of AI. Two years later, in his now famous article ‘Computing Machinery and Intelligence’ (Chapter 11), Turing proposed (what subsequently came to be called) the Turing test as a criterion for whether machines can think. The Essential Turing collects together for the Wrst time the series of Wve papers that Turing devoted exclusively to ArtiWcial Intelligence (Chapters 10, 11, 12, 13, 16). Also included is a discussion of AI by Turing, Newman, and others (Chapter 14). In the end, the NPL’s engineers lost the race to build the world’s Wrst working electronic stored-programme digital computer—an honour that went to the Computing Machine Laboratory at the University of Manchester in June 1948. The concept of the universal Turing machine was a fundamental inXuence on the Manchester computer project, via Newman, the project’s instigator. Later in 2 Jack Good in an interview with Pamela McCorduck, on p. 53 of her Machines Who Think (New York: W. H. Freeman, 1979). 3 This estimate is given by Sir Harry Hinsley, oYcial historian of the British Secret Service, writing on p. 12 of his and Alan Stripp’s edited volume Codebreakers: The Inside Story of Bletchley Park (Oxford: Oxford University Press, 1993). Alan Turing 1912–1954 | 3 1948, at Newman’s invitation, Turing took up the deputy directorship of the Computing Machine Laboratory (there was no Director). Turing spent the rest of his short career at Manchester University. He was elected a Fellow of the Royal Society of London in March 1951 (a high honour) and in May 1953 was appointed to a specially created Readership in the Theory of Computing at Manchester.