DOCSLIB.ORG

Alan Turing 纳瞧盼倘 ¬ ¾ 13 川

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Alan Turing 纳瞧盼倘 ¬ ¾ 13 川 Ë ¥ § ÄÉÇÆÅÎÌÈ Ê Alan Turing Ernest Davis The Turing Guide. By Jack Copeland, Jonathan Bowen, Mark Sprevak, and Robin Wilson. Oxford University Press, New York, NY, March 2017. 545 pages. $115.00. § º à ¾ 2012 Ø 6 23 Alan Tur- » Ø ¨ Ø Ø ¥ ing(Ü ) 100 2012 ¹ Ù Ø Ø “Alan Turing Ø”, 21 Ú Ï Ê Ò ¹ “Alan ² ¿ Û Ñ ¥ Í Á ¥ Æ ¨ Ý Turing Ø”. ¦ Á Û Ø ß Æ Ô Turing 2014 ­ Ø ¤ ¦Æ ¢ (The Imitation Game) Á ¬ ¨ Turing ³ ¼ ª ¯ ª ¢ Ü Ö 42 Ñ ² ¹ (The Turing Guide) ¤ Ó ¦ ¹ ² É É Ð ¨ Ê Í Turing ² Á © © Á Â Ø · ¦ ­ ¨ 60 Ê ª ¯ Ü Ã ­ ¼ » à · ° à ª ¦¡ Ê ³ Á ¬ Í µ Ù ± ¦ ¦Ü ´ Ê Ç ¨ º Ò ¸ ¼ Jack Copeland, ¼ (Can- ¥ £ The Turing Guide Å Ø Ø ¦ à terbury) ª ¯ ¦Ì ¯ ­ ¢ Ü Ñ ¤ ¼ É ³ ¨© Ê ¦ » ℄ ¾ à 13 Í ½ Æ Ô © » Û Á Ê ¨© Ù ² Á µ » Turing 5 Turing Î Ø Ò Ø Å Ø Ø ½ ¿ Ø Ø Ø ¿ Ë ³ ¨ ¶ Ø Ê Ó · Turing Sir John Dermott Turing David Leavitt ³ Ù © ³ » » Û Ï © » ¸ Ï ß ¤ ¨Ý ° Turing 7 Æ ¨ Ý Ç ¦ ¤ Á ¬ Æ Ú ¦© · Í © ³ Í (Bletchley Park, ¥ ) © ¿Ã ¬ Á ´ ¨ Turing (morphogenesis) « Á ¢ ¨ ¹ º É Turing « SIAM News, v. 50 (2017), no. 6, Paying Tribute to Alan Turing’s Life and Work, Ernest Davis, figure number 2. Copyright c 2017 Society for Industrial and Applied Mathematics. All Ì Þ Ô Ï Þ Â È Ü « Á © rights reserved. Reprinted with permission. Î Î Ü ¥ Ï À Ó È § × ° Ð Ä Ernest Davis Ä Courant [email protected]. · 78 · ¦ ³ © ¼ Í ¯ ¨ Ê Ë ª ¯ ² ½ Turing ¦ ´ ³ « à ª Ã Ò Î . 1936 Ø “ (On Ò ¿Ã Ä ¦Ø computable numbers)”, ÖØ Turing ° ¿ © Ø Ó ¦ ½ ­ ¬ Õ ¹ µ Turing Ø ¦µ ² Ø Ã ¹ Ø —— Ðà —— £ ¸ Ò Ø ¬ Î ¦ David Hilbert ( ) “Entscheidungs ( ) Õ”. © Ñ ¥ Í Á ¥ Æ· ¦ à » ¸ Þ ℄. Turing ¦ Þ ¦ ¤ Ç (Enigma code). Ù Ü ¦Õ © à © Å ³ Ç ¨ É Þ Ý Õ Ò ¬ ¬ º É Á Ó ¨¥ Æ Â ¦ × Turing ¦ ¨ » Û Ú Ò Turing 1945 Ø (Automatic Comput- ° Í ¹ Å Ò ± Ò ¨ ing Engine) 1948 1) ¦ Ú ¼ ÛÉ © É Ò Ø Max Newman ( ) (Manchester) Å Å ¦µ © É Ò Ò ¦ · ¦ Í ¼ Á Ó ¨ à ³ µ Ö . Turing (artificial intelligence, AI) ª 1930 Ù Alan Turing Ù ¢ ß Ø ¨ Ø Ó À Í º ¬ ¨ © · —— Sherborne School. ¡ Beryl Turing ¬ ¨ à ٠¹ ¦ Í º ¬ ¨ Ö Ê Ã Ù ¹ Ù Í º —— ´ Æ Á ¥ ­ µ Ö Í ¹ Ç µ Turing (Turing test) ¦ ¦ Ñ Í Ö µ « ¨ ÂÌ Ù © ¨ Á × Ø ¦ Ó À Turing Ê 20 50 Turing Í ¹ Ù ¿Ã ¨Â ¾ ¦ Í Í ¿Ã ª ¯ µ Í » Û Ò 2) © ª ¯ · À ¿Ã ℄ ³ µ Ö ª ¯ Ó Ü É ¨² ¡ ¦ » Margaret Boden Ó Í Î Á ¥ ª ¯ Ñ ³ Á Ð È ¦ Ö ª Ò ¹ (Google Scholar) ¡ ¹ Ã Ó Á Ö º É Á ¥ Ñ ³ Á ³ ¨ © ³ —— —— Turing Ò ¿Ã Î Á ¦ µ · ½ Ø ¿ Î Å (normal 3) ± à · Ë ¬ Õ ¾ É Û ¨ Ý number) ¿Ã Riemann ( ) Christopher Strachey Á ¦È Á Ñ Í ½ Õ Ô » ¬ Ø ¦É Ò Ò Ä Í µ Ä Ö Ú ¯ 1951 “ ½ Ãà ¶ Æ (God Save the King)” Glenn Miller “ (In the mood)” “ (Baa » ¶ » Ï ¨Ì ¦© à ª Ò ­ µ Ö Baa Black Sheep)” “ (Computing Ï Ù ℄ È § Ù § Ì Ù 1) Maxwell Herman Alexander Newman (1897–1984), © ¡ —— À È §ª À  ¶ ´ ¶ × ¡¾ ¡ ¡¸ Ó 2) 1936–, Sussex §¬ ¶ Ù ´ «Þ ¤ (British Academy, United Kingdom’s National ¤ ¡ ¾ ½ ¶ © Academy for the Humanities and the Social Sciences) —— Ó Ù ©° ß Â É ´ Î § ß Â 3) 1916–1975, (denotational semantics) © Ó —— · 79 · Ä Â Í ¡ · ¦ ¦ Æ ¦ Machinery and Intelligence)” · Turing Turing Turing 1) ½ ¿ » Ê Í ¯ · Ñ Ã ¹ ¼ Ê (parapsychology); Leavitt © ª È ¯ ¨ º à ª Ù © Þ ¾ Ù º ¨Í · » ¿ Í ³ Ê ¹ Turing Ê Ã ¿ Ï × © ¼ ³ ± º É ¦ ¢ ¨© Ò ¿Ã · ± Turing 2) Á ¦ ´  § ¦ ´ ¾ Ñ Ã · ¦ ¹ Ó © ­ Turing 6 Emil Post Ù Ý ¦ Ö ¾ ¿ £ Þ ℄ Í º à à ¹ ± £ ¨Ì ¦´ ( ) Copeland È » Ú ÐË Ö Ï ¡ Ñ ² Ð “ Isaac Newton ( ) [Turing ], Newton Ð Ã Æ ¨­ ¹ Û » È ¤ ª  ”, “ Newton Turing ” ° ° ² ¢ Ã Ë ¦Â à à ´ » ¦ÐË Ï © Newton Turing ¯ ² ¦© Ë Ê Ì Ù ¨ ´ À ° Ø Ã ¦ ℄  ¦ Turing Boden Turing Ç » Î Ô ¡ ± ¨ ¹ Ó Ý Ù Ã Í Ý ¿Ã © » Î ß ¤ ( ) ² Ê Ã Ð È ¦ Ð Ã Ê Ï ß ¨ “ ”; ¦ª ¾ ¢ Ü Ñ ¤ Æ ¦ ¹ ¦ ¦ à ÙÍ º Ì Turing Ü º · Ð Ø £ À À ¦· ¥ µ Ì Ù Ú À ¨ ² ¦ Turing —— Á ¹ Þ ¦ Ø Á Ê Î ¹ ¹ Bletchley 1976 Turing ÊÓ À Í Ù ¦ ¹ ¦© Ò ¦ ¬ Ë Á ¢ —— Ý Í ¦ ¹ ² Ì Ù ° ¤ Ü ¨² ¡ ¦³ Ï Ï · ¥ © ¬ 3) © Þ ¾ ¤ Ü ¨ª ¾ » Ì ¦ à Turing Boden Francis Crick 4) ¦ ¢ µ ¡ à ¿Ã ¹ ¯ ¨ James Watson DNA Turing Copeland Ã Æ Ð À ¼ ± Õ ¦µ À Ù Albert Einstein ( ) Turing Einstein 5) Ê ¬ ¼ ¨ Ë Ã ¥ Æ ² Í Richard Dawkins Turing ­ ½ ¢ £ ℄ £ ² Â Ö Dwight D. Eisenhower ( ) Winston Churchill ( ) ( · ¥ à « ¦ ¹ à ° ¦ ¾ Copeland “ ”). ¹ ¦ Í Æ « ³ ¯ Æ Ã µ · Í ¹ ¨ ¡ Á ¦ Û ­ Ï ¤ Í Æ © Ø Á ³ ¹ ¦¢ Ü Ñ ¤ Ã Í º É ² ¨ ¢ ¤ Í Ê Á ËÍ The Turing Guide Ô Biography (Æ ) 1. Life and work, Jack Copeland and Jonathan Bowen 2. The man with the terrible trousers, Sir John Dermot Turing · Ù ¡ß ·  ¡Ç Õ Â Ù © 1) David Leavitt, 1961–, Î —— Ï Ù Æ Ù § À Â Ä ª Ó Ä 2) 1897–1954, Î (computability theory) À Á © —— Ù ¡ Ù Æ Ù § Ì Ù ¡ © 3) 1916–2004, —— Ù ¡ Ç Ù Û Ù § Ù Þ ´ Ú § £ ¶ § 4) 1928–, Î 1953 Francis Crick DNA ¦ § £ ¶ ª ª ¸ Ç Ò ℄ ´ Ú ÙÞ ¤ ¶ “ ”, 1962 Ï © —— º Ä £ Ý ° Ò ¥ ¸ Ä «  §¸ Ó Ä Ì Ä « ¸ Ô ½ Ô © 5) —— · 80 · 3. Meeting a genius, Peter Hilton 4. Crime and punishment, Jack Copeland Ó ¦ ­ The Universal Machine and Beyond (Ø ) 5. A century of Turing, Stephen Wolfram 6. Turing’s great invention: the universal computing machine, Jack Copeland 7. Hilbert and his famous problem, Jack Copeland 8. Turing and the origins of digital computers, Brian Randell ¦ Codebreaker ( Ç ) 9. At Bletchley Park, Jack Copeland 10. The Enigma machine, Joel Greenberg 11. Breaking machines with a pencil, Mavis Batey 12. Bombes, Jack Copeland with Jean Valentine and Catherine Caughey 13. Introducing Banburismus, Edward Simpson 14. Tunny, Hitler’s biggest fish, Jack Copeland 15. We were the world’s first computer operators, Eleanor Ireland 16. The Testery: breaking Hitler’s most secret code, Jerry Roberts 17. Ultra revelations, Brian Randell 18. Delilah - encrypting speech, Jack Copeland 19. Turing’s Monument, Simon Greenish, Jonathan Bowen and Jack Copeland Â Ò Computers After the War (Æ ) 20. Baby, Jack Copeland 21. ACE, Martin Campbell-Kelly 22. Turing’s Zeitgeist, Brian E. Carpenter and Robert W. Doran 23. Computer music, Jack Copeland and Jason Long 24. Turing, Lovelace, and Babbage, Doron Swade µ Ö Ý Û Ô Artificial Intelligence and The Mind (³ ) 25. Intelligent machinery, Jack Copeland 26. Turing’s model of the mind, Mark Sprevak 27. The Turing test - from every angle, Diane Proudfoot 28. Turing’s concept of intelligence, Diane Proudfoot 29. Connectionism: computing with neurons, Jack Copeland and Diane Proudfoot 30. Child machines, Diane Proudfoot 31. Computer chess - the first moments, Jack Copeland and Dani Prinz 32. Turing and the paranormal, David Leavitt Biological Growth ( ) 33. Pioneer of artificial life, Margaret Boden 34. Turing’s theory of morphogenesis, Thomas E. Woolley, Ruth Baker and Philip Maini 35. Radiolaria: validating the Turing theory, Bernard Richards Mathematics (Î ) 36. Introducing Turing’s mathematics, Robin Whitty and Robin Wilson 37. Decidability and the Entscheidungsproblem, Robin Whitty 38. Banburismus revisited: depths and Bayes, Edward Simpson 39. Turing and randomness, Rod Downey 40. Turing’s mentor, Max Newman, Ivor Grattan-Guinness § Finale (¢ ) 41. Is the whole universe a computer? Jack Copeland, Oron Shagrir, and Mark Sprevak 42. Turing’s legacy, Jonathan Bowen Ï ¸ ( ) · 81 ·.
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]
  • Table of Contents
    Table of Contents Vision Statement 5 Strengthening the Intellectual Community 7 Academic Review 17 Recognition of Excellence 20 New Faculty 26 Student Prizes and Scholarships 28 News from the Faculties and Schools 29 Institute for Advanced Studies 47 Saltiel Pre‐Academic Center 49 Truman Institute for the Advancement of Peace 50 The Authority for Research Students 51 The Library Authority 54 In Appreciation 56 2009 Report by the Rector Back ACADEMIC DEVELOPMENTS VISION STATEMENT The academic year 2008/2009, which is now drawing to its end, has been a tumultuous one. The continuous budgetary cuts almost prevented the opening of the academic year, and we end the year under the shadow of the current global economic crisis. Notwithstanding these difficulties, the Hebrew University continues to thrive: as the present report shows, we have maintained our position of excellence. However the name of our game is not maintenance, but rather constant change and improvement, and despite the need to cut back and save, we have embarked on several new, innovative initiatives. As I reflect on my first year as Rector of the Hebrew University, the difficulties fade in comparison to the feeling of opportunity. We are fortunate to have the ongoing support of our friends, both in Israel and abroad, which is a constant reminder to us of the significance of the Hebrew University beyond its walls. Prof. Menachem Magidor is stepping down after twelve years as President of the University: it has been an enormous privilege to work with him during this year, and benefit from his experience, wisdom and vision.
    [Show full text]
  • War Machines: Women's Computing Work and the Underpinnings of the Data-Driven State, 1930-1946
    Programmed Inequality How Britain Discarded Women Technologists and Lost Its Edge in Computing Marie Hicks HD 6135 H53 2017 The Library Mt. St. Vincent Univ. Halifax, N.S. B3M 2J6 The MIT Press Cambridge, Massachusetts London, England 1 War Machines: Women's Computing Work and the Underpinnings of the Data-Driven State, 1930-1946 In recent years, the restoration of Bletchley Park has attracted worldwide attention. The country estate in Milton Keynes, United Kingdom, was the site of the most important codebreaking operations of World War II and home to the first digital, electronic, programmable computer: the Colossus. The British-designed and manufactured Colossus computers, of which there were ten in all by war's end, were critical to the conduct of Allied wartime operations. Unlike their better-known U.S. counter­ part, the ENIAC, the Colossus computers were actually deployed during the war, actively changing its outcome. Kept secret for decades, the full import of the developments at Bletchley has only recently become widely known.1 Yet while popular culture has begun to recognize the importance of Bletchley's wartime operations, misunderstandings persist about the nature of the information work performed there. The 2014 blockbuster The Imitation Game, for instance, cleaves the Colossus computers from the narrative entirely in favor of building a "great man" narrative for a single codebreaker.2 Hidden within the story of Bletchley is a less popular narrative that cannot leverage the appeal of a lone genius and his accomplishments. Thousands of women worked at Bletchley during the war-most in tech­ nical roles.3 Although it is generally accepted that the striking and wide­ ranging roles of the mostly women workers within Bletchley Park give lie to stereotypes about computing as a traditionally masculine field, the contributions of these women have not been analyzed as constitutive of larger trends in the history of computing.
    [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]
  • Jewish National Organizations in the United States
    JEWISH NATIONAL ORGANIZATIONS IN THE UNITED STATES INote.—The information given below is as of May 1, 1924.—An askrisk(*) indicates that revised data was not furnished upon request.] ALPHA EPSILON PI FRATERNITY Org. 1913. OFFICE 131 W. 13th, New York City Tenth Annual Convention, Dec. 29-31, 1923, New York City. Chapters, 12. Members, 350. PURPOSE: A national collegiate Greek-letter organization for Jew- ish students. OFFICERS: Pres., Sidney Picker, N. Y. C; Vice-Pres., William Cohen, N. Y. C; Treas., Herman Rolnick, N. Y. C; Sec., Louis S. Amreich, Brooklyn, N. Y. BOARD OF GOVERNORS: The officers and Milton Adler, Brook- lyn, N. Y.; Lewis J. Laventhol, Philadelphia, Pa.; Alfred D. Peltz, Brooklyn, N. Y.; Theodore R. Racoosin, N. Y. C; I. L. Rubin, Phila- delphia, Pa. ALPHA EPSILON PHI SORORITY Org. 1909. OFFICE: 134 E. 43d New York City Convention, Dec. 24, 1920, New York City Members 950. PURPOSE: TO foster close friendship between members, to stimulate the intellectual, social and spiritual life of the members, and to count as a force through service rendered to others. OFFICERS: Dean, Alice Borchard Greene (Mrs. S.), Montclair, N. J.; Sub.-Dean, Rose Oltusky, Waukegan, 111.; Treas., Jeanette Armstrong Slatoff (Mrs. E.), Newark, N. J.; Scribe, Stella Caplin Bloom (Mrs. N.) 338 McDonough, Brooklyn, N. Y. ALPHA OMEGA FRATERNITY Org. 1906, Inc., 1909. OFFICE: Secretary, 2435 N. 17th, Philadelphia, Pa. Sixteenth Annual Convention, Dec. 26-28, 1923. Boston, Mass. Members, 2,000. PURPOSE: Uphold the highest standards of the dental profession, provide for ourselves the pleasures.of universal brotherhood and to promote our general welfare.
    [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]
  • EMMIT 2009 EURO-MEDITERRANEAN MEDICAL INFORMATICS and TELEMEDICINE 5Th International Conference
    EMMIT 2009 EURO-MEDITERRANEAN MEDICAL INFORMATICS and TELEMEDICINE th 5 International Conference October 16-18, 2009 Hotel - Dieu de France - Beirut (Lebanon) promoted by HOTEL-DIEU DE FRANCE EEEMMMMMMIIITT@ssociation Centre Hospitalier et Universitaire With the Partecipation off PROGRAMME October 16 h.08.30-09.30: Participants Registration h 09.30 Opening Ceremony and Welcome Addresses Johnny Heubri (Hotel Dieu de France, Beirut - Chairman of Organizing Committee) Francesco Sicurello (Chairman of EMMIT) Joseph Otayek (General Manager of Hotel Dieu de France, Beirut) Representatives of Local and National Authorities h 10.30 Scientific Lectures (chair: Zouheir El Imad – Ain Wazein Hospital Lebanon) - eHealth: a global perspective and responsibility; Najeeb Al Shorbaji (Director of IER/KMS,WHO, Geneva) - Telecom Regulatory Aspects of e-Health; Imad Y. Hoballah (Telecommunications Regulatory Authority, Republic of Lebanon) - How computers can save patients’ lives: computers in ICU; Bernard Richards (University of Manchester, UK) - Broadband projects and their implication in Health; Fadi Moubarak (General Manager Of Cisco Middle East, Beirut - Lebanon) - Telemedicine and e-Health in Eastern Mediterranean Region ;Digital Gaps and Economic Obstacles; Mohammed Abd-Allah ( Ex.Senior Advisor for ITU, Regional office for Arab States.Cairo) -Integration of Medical Informatics and Telemedicine Systems within and between Mediterranean Countries; Francesco Sicurello (chairman of EMMIT) h 12.45 lunch break h 14.00 – 15.45 The challenges of Today Medicine
    [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]
  • 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]
  • Formalizing Common Sense Reasoning for Scalable Inconsistency-Robust Information Integration Using Direct Logictm Reasoning and the Actor Model
    Formalizing common sense reasoning for scalable inconsistency-robust information integration using Direct LogicTM Reasoning and the Actor Model Carl Hewitt. http://carlhewitt.info This paper is dedicated to Alonzo Church, Stanisław Jaśkowski, John McCarthy and Ludwig Wittgenstein. ABSTRACT People use common sense in their interactions with large software systems. This common sense needs to be formalized so that it can be used by computer systems. Unfortunately, previous formalizations have been inadequate. For example, because contemporary large software systems are pervasively inconsistent, it is not safe to reason about them using classical logic. Our goal is to develop a standard foundation for reasoning in large-scale Internet applications (including sense making for natural language) by addressing the following issues: inconsistency robustness, classical contrapositive inference bug, and direct argumentation. Inconsistency Robust Direct Logic is a minimal fix to Classical Logic without the rule of Classical Proof by Contradiction [i.e., (Ψ├ (¬))├¬Ψ], the addition of which transforms Inconsistency Robust Direct Logic into Classical Logic. Inconsistency Robust Direct Logic makes the following contributions over previous work: Direct Inference Direct Argumentation (argumentation directly expressed) Inconsistency-robust Natural Deduction that doesn’t require artifices such as indices (labels) on propositions or restrictions on reiteration Intuitive inferences hold including the following: . Propositional equivalences (except absorption) including Double Negation and De Morgan . -Elimination (Disjunctive Syllogism), i.e., ¬Φ, (ΦΨ)├T Ψ . Reasoning by disjunctive cases, i.e., (), (├T ), (├T Ω)├T Ω . Contrapositive for implication i.e., Ψ⇒ if and only if ¬⇒¬Ψ . Soundness, i.e., ├T ((├T) ⇒ ) . Inconsistency Robust Proof by Contradiction, i.e., ├T (Ψ⇒ (¬))⇒¬Ψ 1 A fundamental goal of Inconsistency Robust Direct Logic is to effectively reason about large amounts of pervasively inconsistent information using computer information systems.
    [Show full text]
  • An Observation About Truth
    An Observation about Truth (with Implications for Meaning and Language) Thesis submitted for the degree of “Doctor of Philosophy” By David Kashtan Submitted to the Senate of the Hebrew University of Jerusalem November 2017 i This work was carried out under the supervision of: Prof. Carl Posy ii Racheli Kasztan-Czerwonogórze i Avigail Kasztan-Czerwonogórze i ich matce iii Acknowledgements I am the proximal cause of this dissertation. It has many distal causes, of which I will give only a partial list. During the several years in which this work was in preparation I was lucky to be supported by several sources. For almost the whole duration of my doctoral studies I was a funded doctoral fellow at the Language, Logic and Cognition Center. The membership in the LLCC has been of tremendous significance to my scientific education and to the final shape and content of this dissertation. I thank especially Danny Fox, from whom I learnt how linguistics is done (though, due to my stubbornness, not how to do it) and all the other members of this important place, past and present, and in particular Lital Myers who makes it all come together. In the years 2011-2013 I was a funded participant in an inter-university research and study program about Kantian philosophy. The program was organized by Ido Geiger and Yakir Levin from Ben-Gurion University, and by Eli Friedlander, Ofra Rechter and Yaron Senderowicz from Tel-Aviv University. The atmosphere in the program was one of intimacy and devotion to philosophy; I predict we will soon witness blossoms, the seeds of which were planted there.
    [Show full text]