Alan Turing and the Enigma of Computability
|
|
- Marlene Glenn
- 6 years ago
- Views:
Transcription
1 Alan Turing and the Enigma of Computability Alan Matheson Turing, b. June 23, 1912, d. June 7, 1954, was a British mathematician who conceived of a machine that could compute by reading and writing an infinite tape according to some simple instructions and state transitions. From this he was able to show the existence of incomputable functions. For example, no program can determine if any arbitrary program will terminate. He played a significant rôle in cracking German codes during World War 2, and proposed a test for machine intelligence. He went to King's College, Cambridge in 1931 to read Mathematics. Turing graduated from Cambridge in Mathematics in 1934, and was a fellow at Kings for two years, during which he wrote his now famous paper published in 1937, On Computable Numbers, with an Application to the Entscheidungsproblem. In it, he proposed a machine that could move from one state to another by following a rigorous set of rules. From this he was able to show the existence of incomputable functions. For example, no program can determine if any arbitrary program will terminate. This led to a computing scheme that foreshadowed the logic of digital computers. Consistency, Completeness, and Computability With the ever-increasing abstraction of mathematics away for Euclidean 'reality', mathematicians wanted a way to be sure their work was sound. In particular, they wanted to be sure there were no internal inconsistencies, such that if you had proven a theorem T to be true, then you could be absolutely sure that nobody would ever prove the opposite. If they could, then anything could be proven, and the whole system would become meaningless. They also wanted to be able to guarantee the completeness of their systems, which meant that if there was a theorem T in it, then there would be a way to prove or disprove it. For any specific theorem (e.g. Fermat's Last Theorem) it might be extremely difficult to do, but still, mathematicians were confident that in principle, every theorem in a system could be proven or disproven. Until Kurt Gödel came along. He showed that in a formal axiomatic system, you cannot have both consistency and completeness; either you cannot prove everything in the system, or you could not (within the system) guarantee that there could not be any contradictions. This came as a major shock to mathematicians. Gödel had shown that any sufficiently rich mathematical axiom system is incomplete in that there must exist propositions whose truth can never be determined (undecidable propositions within the system). Turing graduated in 1934 then, in the spring of 1935, he attended Max Newman's advanced course on the foundations of mathematics. This course studied Gödel's incompleteness results and Hilbert's question on decidability: given a mathematical proposition could one find an algorithm which would decide if the proposition was true of false? Turing was motivated by Gödel's work to seek an algorithmic method of determining whether any given propositions were undecidable, with the ultimate goal of eliminating them from mathematics. Instead, he proved in his seminal paper On Computable Numbers, with an Application to the Entscheidungsproblem (1936), that there cannot exist any such universal method of determination and, hence, that mathematics will always contain undecidable (as opposed to unknown) propositions.
2 An Outline of Turing's Computability Proof In September 1936 Turing went to the Institute of Advanced Studies at Princeton, completing a Ph.D. (1938) under the direction of the American mathematician Alonzo Church. He then returned to England and accepted a renewed fellowship at King's College. World War 2: The Enigma Codes During World War 2, Turing worked in the British Foreign Office, where he played a leading role in efforts to break enemy codes. Armed forces have always been dependent on communications. The efficiency of Germany's armed forces in the second world war was only made possible by the use of radio communications. Messages sent this way had to be enciphered, and the encryption system they used was developed from one that was commercially available before the war. This was then modified in such a way as to significantly increase the difficulty in breaking it. These Enigma machines could generate over 1 trillion different coding patterns. The Germans believed they were too sophisticated for Allied forces to break them. But in one of the best-kept secrets of the war, first the Poles, and later the British and Americans succeeded in deciphering messages. During World War II ( ), Turing served with the British "Government Communication Headquarters" (GCHQ) at Bletchley Park, where he played a significant role in breaking the German "Enigma" codes. There he used a machine called Collossus to decipher the Enigma codes. These machines were the predessors to the first digital computers. He was in the first handful of able mathematicians drafted into their codebreaking operations. In the next three years Turing was the key figure in the continual battle to decode messages encrypted by the increasingly complex Enigma machines, using the Bombe machine. The wooden device in the foreground is a 4 rotor German Enigma machine, used for encoding. The large machine in the background is a "Bombe," used for breaking the code. Working out the details of codebreaking machines was one of the developments that fostered electronic computers. Smithsonian Photo by Laurie Minor-Penland. German armies. The Bombe was an electro-mechanical device, developed by Turing with help from another mathematician W. G. Welchman, inspired by the Polish 'Bomba'. Many of Germany's secret messages could be deciphered and read whith it. The periods when the Naval code could be broken saw dramatic reductions in the shipping losses from the Atlantic convoys so essential to the conduct of the Allied war effort. The importance of this for the development of WWII can hardly be underestimated. The allies could always be one step ahead and avoid the worst consequences of for example the submarine war. The British brought the Americans into the picture during the war, and the Americans furnished many of the resources to attack ever more complex versions of the Enigma, especially the naval Enigma, when British resources began to run thin. Information from the decrypted messages was used by the Allies time after time to outmaneuver
3 He later worked on the development of an electronic computer, on theories of artificial intelligence, and on the application of mathematical theory to biological forms. Alan Turing's research has had profound influence on logic, computability, modern computers, and machine intelligence. The Turing Test After the War Turing went on to work for the National Physical Laboratory (NPL), to lead the design, construction, and use of a large electronic digital computer called the Automatic Computing Engine (ACE). Turing left the (NPL) and moved to the University of Manchester, to become deputy director of the Computing Laboratory, where he wrote programs for the Manchester Automatic Digital Machine (MADAM), the computer with the largest memory capacity in the world at that time. Meanwhile Turing began to think about the relationship between computers and the mind. He championed the theory that computers eventually could be constructed that would be capable of mimicking human thought. In 1950 he produced a paper on "Computing Machinery And Intelligence"; he invented a test that he said would prove a machine could think. This test later became known as the Turing Test. Turing was convinced that if a computer could do all mathematical operations, it could also do anything a person can do, a still highly controversial opinion. To argue for this position a criterion of intelligence was needed. Turing expressed this criterion as a test. The Turing Test has a computer and a person with the interrorgator trying to distinguish which is the computer. The interrorgator asks questions via teletype so no visual identification can be made. The test is repeated with a range of people in the human position and if the number of times that repeated identification is less than pure guesswork then the machine has passed. I Think, Therefore, I Am Named after the famous French philosopher and mathematician Rene DesCartes, RENE is a language used for artificial intelligence. The language is being developed at the Chicago Center of Machine Politics and Programming under a grant from the Jane Byrne Victory Fund. A spokesman described the language as "Just as great as dis [sic] city of ours." The center is very pleased with progress to date. They say they have almost succeeded in getting a VAX to think. However, sources inside the organization say that each time the machine fails to think it ceases to exist. When the person is unable to decide whether he is talking to a computer or another person, the computer can safely be said to possess all important characteristics of intelligence. Turing was convinced that is was possible to build such a machine.
4 Turing believed that thinking machines could be created by the year He was too optimisitic. In it's modern form the test is conducted in a competition called The Loebner Prize. Turing Test Alan Turing's paper was such a revolutionary piece of work because the digital computer was still very much in in it's infancy. It probably wasn't until 1990 when a computer came anywhere near passing the test, and to this day no computer ever has. Turing's papers on the subject are widely acknowledged as the foundation of research in artificial intelligence. In 1945 Turing was awarded the O.B.E. for his vital contribution to the war effort. In 1951 Turing was elected a Fellow of the Royal Society. He was still doing research on computers when in 1952 a friend of his lover broke into his house. In the following police investigation he openly mentioned his homosexuality. It turned out that the police were more interested in the fact that he was gay than in the actual crime, since being gay was a crime in Britain at the time. Turing was charged and sentenced to hormonal treatment with estrogen. Q: Please write me a sonnnet on the subject of the Forth Bridge. A: Count me out on this one. I never could write poetry. Q: Add to A: (Pause aobut 30 seconds and then give as answer) Q: Do you play chess? A: Yes. Q: I have K at my K1, and no other pieces. You have only K at K6 and R at R1. It is your move. What do you play? A: (After a puase of 15 seconds) R-R8 mate. In later years Turing was professionally hindered by his 1952 arrest for violation of British homosexuality statutes. The depression he went through following the conviction was probably the main cause of his suicide in 1954 at the age of 41. He killed himself by eating an apple soaked in potassium cyanide. Breaking the Code (1987), a play by Hugh Whitemore, is based on his life.
5 Recommended Sites Alan Turing Alan Turing is probably the 20th-century mathematician whose research has had the most importance outside the abstract field of logic. He was the first to imagine the possibility of machines really thinking and his work happened to be of crucial importance to the outcome of World War II. Alan Mathison Turing At The MacTutor History of Mathematics archive. The Church-Turing Thesis There are various equivalent formulations of the Church-Turing thesis. A common one is that every effective computation can be carried out by a Turing machine. The Church-Turing thesis is often misunderstood, particularly in recent writing in the philosophy of mind. Minds, Machines and Gödel by J.R. Lucas. First published in Philosophy, XXXVI, 1961, pp.(112)-(127); reprinted in The Modeling of Mind, Kenneth M.Sayre and Frederick J.Crosson, eds., Notre Dame Press, 1963, pp.[269]-[270]; and Minds and Machines, ed. Alan Ross Anderson, Prentice-Hall, 1954, pp.{43}-{59}. Enigma and the Code Breakers This site contains information about encryption, code breaking and the enigma machine. The Enigma Machine This applet simulates the operation of an Enigma machine. The Germans used the Enigma machine in World War II to encrypt military messages. The First Hacker and His Imaginary Machine "The idea that people could use computers to amplify thought and communication, as tools for intellectual work and social activity, was not an invention of the mainstream computer industry or orthodox computer science, nor even homebrew computerists; their work was rooted in older, equally eccentric, equally visionary, work. You can't really guess where mind-amplifying technology is going unless you understand where it came from." - Howard Rheingold
Overview: The works of Alan Turing ( )
Overview: The works of Alan Turing (1912-1954) Dan Hallin 2005-10-21 Introduction Course in Computer Science (CD5600) The methodology of Science in Technology (CT3620) Mälardalen
More informationAlan Turing: Codebreaker
1 CLOSE READING Alan Turing: Codebreaker Invisible ink, cipher wheels, and hidden messages these are the spy gadgets of the past. Modern spy devices include unmanned aircraft and other spy planes. But
More informationEMINENT & ENIGMATIC. 10 aspects of Alan Turing
EMINENT & ENIGMATIC. 10 aspects of Alan Turing Exhibition at the Heinz Nixdorf MuseumsForum from January to December 2012 The international scientific focus in 2012 will be firmly on Alan Turing. This
More informationTitle? Alan Turing and the Theoretical Foundation of the Information Age
BOOK REVIEW Title? Alan Turing and the Theoretical Foundation of the Information Age Chris Bernhardt, Turing s Vision: the Birth of Computer Science. Cambridge, MA: MIT Press 2016. xvii + 189 pp. $26.95
More informationTuring Centenary Celebration
1/18 Turing Celebration Turing s Test for Artificial Intelligence Dr. Kevin Korb Clayton School of Info Tech Building 63, Rm 205 kbkorb@gmail.com 2/18 Can Machines Think? Yes Alan Turing s question (and
More informationA celebration of Alan Turing s achievements in the year of his centenary
Intl. Trans. in Op. Res. 19 (2012) 487 491 DOI: 10.1111/j.1475-3995.2012.00848.x INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH A celebration of Alan Turing s achievements in the year of his centenary
More informationHalting Problem. Implement HALT? Today. Halt does not exist. Halt and Turing. Another view of proof: diagonalization. P - program I - input.
Today. Halting Problem. Implement HALT? Finish undecidability. Start counting. HALT (P,I) P - program I - input. Determines if P(I) (P run on I) halts or loops forever. Notice: Need a computer with the
More information10/4/10. An overview using Alan Turing s Forgotten Ideas in Computer Science as well as sources listed on last slide.
Well known for the machine, test and thesis that bear his name, the British genius also anticipated neural- network computers and hyper- computation. An overview using Alan Turing s Forgotten Ideas in
More informationBackground Data: Naval Warfare, Battle of the Atlantic, Cryptography, and the Code Game. Battle of the Atlantic Allied Convoys vs.
Background Data: Naval Warfare, Battle of the Atlantic, Cryptography, and the Code Game Randy H. Katz CS Division, EECS Dept. University of California, Berkeley Spring 2013 Battle of the Atlantic Allied
More informationDr Rong Qu History of AI
Dr Rong Qu History of AI AI Originated in 1956, John McCarthy coined the term very successful at early stage Within 10 years a computer will be a chess champion Herbert Simon, 1957 IBM Deep Blue on 11
More informationThe Imitation Game. Movie Summary
Unit 8 The Imitation Game Movie Summary 71 72 5 10 15 Everett Collection Young Alan Turing develops a strong friendship at school with a friend. The friend teaches him about making secret codes. It becomes
More informationFrom Turing Machines to Building a Brain
From Turing Machines to Building a Brain Including an introduction to Philosophy of Mind Church-Turing Thesis Turing was beaten to the punch in his solution to the Entscheidungsproblem Alonzo Church announced
More informationHistorical cryptography 2. CSCI 470: Web Science Keith Vertanen
Historical cryptography 2 CSCI 470: Web Science Keith Vertanen Overview Historical cryptography WWI Zimmerman telegram WWII Rise of the cipher machines Engima Allied encryption 2 WWI: Zimmermann Telegram
More informationA Brief History of Computer Science and Computing
A Brief History of Computer Science and Computing Tim Capes April 4, 2011 Administrative Announcements Midterms are returned today, A4 is scheduled to go out on thursday. Early Computing First computing
More informationof the hypothesis, but it would not lead to a proof. P 1
Church-Turing thesis The intuitive notion of an effective procedure or algorithm has been mentioned several times. Today the Turing machine has become the accepted formalization of an algorithm. Clearly
More informationALAN MATHISON TURING: MUŽ, JENŽ PROGRAMOVAL SOUČASNOST. Jiří Wiedermann Akademie věd ČR
ALAN MATHISON TURING: MUŽ, JENŽ PROGRAMOVAL SOUČASNOST Jiří Wiedermann Akademie věd ČR AMT: Genius and Master od Intuition The Legacy of a Genius: AMT - the Father of AI AMT: Pioneer of the Information
More informationIntroduction to Talking Robots
Introduction to Talking Robots Graham Wilcock Adjunct Professor, Docent Emeritus University of Helsinki 8.12.2015 1 Robots and Artificial Intelligence Graham Wilcock 8.12.2015 2 Breakthrough Steps of Artificial
More informationCITS2211 Discrete Structures Turing Machines
CITS2211 Discrete Structures Turing Machines October 23, 2017 Highlights We have seen that FSMs and PDAs are surprisingly powerful But there are some languages they can not recognise We will study a new
More informationCode Breakers: Uncovering German Messages. by Rena Korb. Scott Foresman Reading Street 4.4.4
Suggested levels for Guided Reading, DRA, Lexile, and Reading Recovery are provided in the Pearson Scott Foresman Leveling Guide. Code Breakers: Uncovering German Messages by Rena Korb Genre Expository
More informationAlan Turing s legacy. John Graham-Cumming INSTANT EXPERT Month 2010 NewScientist 1
Alan Turing s legacy John Graham-Cumming INSTANT EXPERT 00 Month 00 NewScientist COMPUTATION Classic Stock/Alamy Carlos Barria/Reuters The ideas of British scientist Alan Turing shaped our world. He laid
More informationCryptography. Module in Autumn Term 2016 University of Birmingham. Lecturers: Mark D. Ryan and David Galindo
Lecturers: Mark D. Ryan and David Galindo. Cryptography 2017. Slide: 1 Cryptography Module in Autumn Term 2016 University of Birmingham Lecturers: Mark D. Ryan and David Galindo Slides originally written
More informationA Balanced Introduction to Computer Science, 3/E
A Balanced Introduction to Computer Science, 3/E David Reed, Creighton University 2011 Pearson Prentice Hall ISBN 978-0-13-216675-1 Chapter 10 Computer Science as a Discipline 1 Computer Science some people
More informationSmart Cities. SESSION I : Lecture 2: Turing s s Legacy. Michael
Monday 5 October, 2015 Smart Cities SESSION I : Lecture 2: Turing s s Legacy Michael Batty m.batty@ucl.ac.uk @jmichaelbatty http://www.spatialcomplexity.info/ http://www.casa.ucl.ac.uk/ How did it all
More informationFinal Math Paper. James Marden. December 3, Introduction. Mersenne primes are a set of primes which are of the form: (2 p ) 1 = M
Final Math Paper James Marden December 3, 2016 Introduction Mersenne primes are a set of primes which are of the form: (2 p ) 1 = M There are currently only 49 known Mersenne primes, the smallest of which
More informationAwareness and Understanding in Computer Programs A Review of Shadows of the Mind by Roger Penrose
Awareness and Understanding in Computer Programs A Review of Shadows of the Mind by Roger Penrose John McCarthy Computer Science Department Stanford University Stanford, CA 94305. jmc@sail.stanford.edu
More informationRevolutionary Activity Guide Discover Revolutionary New Jersey
Revolutionary Activity Guide Discover Revolutionary New Jersey www.revolutionarynj.org New Jersey and The American Revolution New Jersey was an important place during the American Revolution. Located between
More informationComputer Science as a Discipline
Computer Science as a Discipline 1 Computer Science some people argue that computer science is not a science in the same sense that biology and chemistry are the interdisciplinary nature of computer science
More informationPhilosophical Foundations
Philosophical Foundations Weak AI claim: computers can be programmed to act as if they were intelligent (as if they were thinking) Strong AI claim: computers can be programmed to think (i.e., they really
More informationCodes and Nomenclators
Spring 2011 Chris Christensen Codes and Nomenclators In common usage, there is often no distinction made between codes and ciphers, but in cryptology there is an important distinction. Recall that a cipher
More informationPhilosophy. AI Slides (5e) c Lin
Philosophy 15 AI Slides (5e) c Lin Zuoquan@PKU 2003-2018 15 1 15 Philosophy 15.1 AI philosophy 15.2 Weak AI 15.3 Strong AI 15.4 Ethics 15.5 The future of AI AI Slides (5e) c Lin Zuoquan@PKU 2003-2018 15
More informationPhilosophy and the Human Situation Artificial Intelligence
Philosophy and the Human Situation Artificial Intelligence Tim Crane In 1965, Herbert Simon, one of the pioneers of the new science of Artificial Intelligence, predicted that machines will be capable,
More informationCANDOER News. Volume 8 Number 2 Inside this issue
CANDOER News A quarterly Newsletter dedicated to Communicators AND Others Enjoying Retirement July 2008 Summer Issue Volume 8 Number 2 Inside this issue candoercat@gmail.com or to my snail-mail address:
More informationStanford Encyclopedia of Philosophy
This content is available online: http://stanford.library.usyd.edu.au/entries/turing/ (2015/05/05) Stanford Encyclopedia of Philosophy Alan Turing Alan Turing First published Mon Jun 3, 2002; substantive
More informationB. Substitution Ciphers, continued. 3. Polyalphabetic: Use multiple maps from the plaintext alphabet to the ciphertext alphabet.
B. Substitution Ciphers, continued 3. Polyalphabetic: Use multiple maps from the plaintext alphabet to the ciphertext alphabet. Non-periodic case: Running key substitution ciphers use a known text (in
More informationThe Fall Of Japan (World War II) By Keith Wheeler
The Fall Of Japan (World War II) By Keith Wheeler If you are searched for a ebook The Fall of Japan (World War II) by Keith Wheeler in pdf format, then you have come on to faithful website. We furnish
More informationComputational Thinking
Artificial Intelligence Learning goals CT Application: Students will be able to describe the difference between Strong and Weak AI CT Impact: Students will be able to describe the gulf that exists between
More informationHis Just Deserts: A Review of Four Books
Book Review His Just Deserts: A Review of Four Books Reviewed by Alvy Ray Smith Alan Turing: The Enigma: The Centenary Edition Andrew Hodges Princeton University Press, May 2012 US$24.95, 632 pages ISBN-13:
More informationQuick work: Memory allocation
Quick work: Memory allocation The OS is using a fixed partition algorithm. Processes place requests to the OS in the following sequence: P1=15 KB, P2=5 KB, P3=30 KB Draw the memory map at the end, if each
More informationRICHARD FLETCHER, Secretary, the Bill Tutte Memorial Fund
keep Like all of them at Bletchley Park, they were all told never to talk about it. Churchill called them the geese that laid the golden eggs but never cackled. RICHARD FLETCHER, Secretary, the Bill Tutte
More informationPart I. First Notions
Part I First Notions 1 Introduction In their great variety, from contests of global significance such as a championship match or the election of a president down to a coin flip or a show of hands, games
More informationBooks. Foundations of Computer Science, 2 nd edition, Behrouz Forouzan and Firouz Mosha rraf, Thomson Learning, UK, ( 歐亞書局,(02) )
Books Foundations of Computer Science, 2 nd edition, Behrouz Forouzan and Firouz Mosha rraf, Thomson Learning, UK, 2008. ( 歐亞書局,(02)89121188) Administration Instructor: 曾學文資工系助理教授 Office: Room 908 Email:
More informationThe Philosophy of Time. Time without Change
The Philosophy of Time Lecture One Time without Change Rob Trueman rob.trueman@york.ac.uk University of York Introducing McTaggart s Argument Time without Change Introducing McTaggart s Argument McTaggart
More information18.204: CHIP FIRING GAMES
18.204: CHIP FIRING GAMES ANNE KELLEY Abstract. Chip firing is a one-player game where piles start with an initial number of chips and any pile with at least two chips can send one chip to the piles on
More informationDigital image processing vs. computer vision Higher-level anchoring
Digital image processing vs. computer vision Higher-level anchoring Václav Hlaváč Czech Technical University in Prague Faculty of Electrical Engineering, Department of Cybernetics Center for Machine Perception
More informationCryptography Made Easy. Stuart Reges Principal Lecturer University of Washington
Cryptography Made Easy Stuart Reges Principal Lecturer University of Washington Why Study Cryptography? Secrets are intrinsically interesting So much real-life drama: Mary Queen of Scots executed for treason
More informationModal logic. Benzmüller/Rojas, 2014 Artificial Intelligence 2
Modal logic Benzmüller/Rojas, 2014 Artificial Intelligence 2 What is Modal Logic? Narrowly, traditionally: modal logic studies reasoning that involves the use of the expressions necessarily and possibly.
More informationIntelligent Systems. Lecture 1 - Introduction
Intelligent Systems Lecture 1 - Introduction In which we try to explain why we consider artificial intelligence to be a subject most worthy of study, and in which we try to decide what exactly it is Dr.
More informationTiling Problems. This document supersedes the earlier notes posted about the tiling problem. 1 An Undecidable Problem about Tilings of the Plane
Tiling Problems This document supersedes the earlier notes posted about the tiling problem. 1 An Undecidable Problem about Tilings of the Plane The undecidable problems we saw at the start of our unit
More informationCODE-BREAKER. by JIM HOLT. The life and death of Alan Turing. Issue of Posted
CODE-BREAKER by JIM HOLT The life and death of Alan Turing. Issue of 2006-02-06 Posted 2006-01-30 On June 8, 1954, Alan Turing, a forty-one-year-old research scientist at Manchester University, was found
More information5.4 Imperfect, Real-Time Decisions
5.4 Imperfect, Real-Time Decisions Searching through the whole (pruned) game tree is too inefficient for any realistic game Moves must be made in a reasonable amount of time One has to cut off the generation
More informationSoftware Eng. 2F03: Logic For Software Engineering
Software Eng. 2F03: Logic For Software Engineering Dr. Mark Lawford Dept. of Computing And Software, Faculty of Engineering McMaster University 0-0 Motivation Why study logic? You want to learn some cool
More informationMathematics Explorers Club Fall 2012 Number Theory and Cryptography
Mathematics Explorers Club Fall 2012 Number Theory and Cryptography Chapter 0: Introduction Number Theory enjoys a very long history in short, number theory is a study of integers. Mathematicians over
More informationCryptography. 2. decoding is extremely difficult (for protection against eavesdroppers);
18.310 lecture notes September 2, 2013 Cryptography Lecturer: Michel Goemans 1 Public Key Cryptosystems In these notes, we will be concerned with constructing secret codes. A sender would like to encrypt
More informationCanadian History 1201 January, 2011 Exam
Canadian History 1201 January, 2011 Exam Name: Time: 2 Hours INSTRUCTIONS: 1. Read all the questions and instructions carefully before answering. 2. For Part A (the multiple choice), write your answers
More informationFrigga s Day, 1/9: Digital Ontology 102
Frigga s Day, 1/9: Digital Ontology 102 EQ: Can a machine be a Self? Welcome! Gather J. Lanier, You Are Not A Gadget, pen/pencil, paper, wits! Digital Ontology 102 o Reading and Writing: Jaron Lanier,
More informationa. Mechanical procedure for doing different computing: system b. Organon, codify logical deduction with rules of inference (syllogisms)
L&S160E Week 12 Notes I. Logic: a. Mechanical procedure for doing different computing: system b. Organon, codify logical deduction with rules of inference (syllogisms) c. Greek Logic (propositional logic)
More informationChapter 7 Information Redux
Chapter 7 Information Redux Information exists at the core of human activities such as observing, reasoning, and communicating. Information serves a foundational role in these areas, similar to the role
More informationVoting Systems, Mass Murder, and the Enigma Machine
Voting Systems, Mass Murder, and the Enigma Machine Department of Mathematics University of Arizona 3/22/11 Outline Der Reichstag 1 Der Reichstag 2 3 Der Reichstag German Parliamentary Election Results
More informationArtificial Intelligence
Artificial Intelligence Chapter 1 Chapter 1 1 Outline What is AI? A brief history The state of the art Chapter 1 2 What is AI? Systems that think like humans Systems that think rationally Systems that
More informationAlmost everyone knows that mathematics serves the very practical purpose of dictating engineering design... It is... less widely known that
Almost everyone knows that mathematics serves the very practical purpose of dictating engineering design.... It is... less widely known that mathematics has determined the direction and content of philosophical
More informationDiffie-Hellman key-exchange protocol
Diffie-Hellman key-exchange protocol This protocol allows two users to choose a common secret key, for DES or AES, say, while communicating over an insecure channel (with eavesdroppers). The two users
More informationWords to Know before You Go!
Words to Know before You Go! artifact urban rural suburbs retired treaty Fun Facts John Jay was the eighth of ten children. Today King s College, the school where John Jay was educated, is called Columbia
More informationIntroduction to Computer Science
Introduction to CS, 2003 p.1 Introduction to Computer Science Ian Leslie with thanks to Robin Milner, Andrew Pitts and others... Computer Laboratory In the beginning... Introduction to CS, 2003 p.2 Introduction
More informationMath 319 Problem Set #7 Solution 18 April 2002
Math 319 Problem Set #7 Solution 18 April 2002 1. ( 2.4, problem 9) Show that if x 2 1 (mod m) and x / ±1 (mod m) then 1 < (x 1, m) < m and 1 < (x + 1, m) < m. Proof: From x 2 1 (mod m) we get m (x 2 1).
More informationLord of the Flies Intro CN
Lord of the Flies Intro CN Story Premise Set in mid 1940s when Europe was engulfed in war A plane carrying British school boys ages 6-12 is mistaken for a military craft and shot down over the South Pacific.
More informationFrom a Ball Game to Incompleteness
From a Ball Game to Incompleteness Arindama Singh We present a ball game that can be continued as long as we wish. It looks as though the game would never end. But by applying a result on trees, we show
More informationBulgaria: May enter the war any time from II 1915 on, or if Serbia is conquered.
Time Track Each round of turns represents four months of real time. The rounds are designated by a Roman numeral, followed by the year, so the game starts in II 1914 (to represent the war's beginning in
More informationA BIT OF. Machines that learn. Make me invisible! The robot painter. Spies like us. Computer Science for Fun Issue 1
A BIT OF Computer Science for Fun Issue 1 Machines that learn Make me invisible! The robot painter Spies like us ADA LOVELACE Victorian computing wizard Ada Lovelace was a Victorian countess. She loved
More informationAdam Aziz 1203 Words. Artificial Intelligence vs. Human Intelligence
Adam Aziz 1203 Words Artificial Intelligence vs. Human Intelligence Currently, the field of science is progressing faster than it ever has. When anything is progressing this quickly, we very quickly venture
More informationLecture 20 November 13, 2014
6.890: Algorithmic Lower Bounds: Fun With Hardness Proofs Fall 2014 Prof. Erik Demaine Lecture 20 November 13, 2014 Scribes: Chennah Heroor 1 Overview This lecture completes our lectures on game characterization.
More informationKey People Causes Battles Terms. Grab Bag
Key People Causes Battles Terms Grab Bag 200 200 200 200 200 400 400 400 400 400 600 600 600 600 600 800 800 800 800 800 1000 1000 1000 1000 1000 Key People - 200 Question This man is given credit for
More informationHistory and Philosophical Underpinnings
History and Philosophical Underpinnings Last Class Recap game-theory why normal search won t work minimax algorithm brute-force traversal of game tree for best move alpha-beta pruning how to improve on
More informationTechnical framework of Operating System using Turing Machines
Reviewed Paper Technical framework of Operating System using Turing Machines Paper ID IJIFR/ V2/ E2/ 028 Page No 465-470 Subject Area Computer Science Key Words Turing, Undesirability, Complexity, Snapshot
More informationWhere tax and science meet part 2*
Where tax and science meet part 2* How CAs can identify eligible activities for the federal government s SR&ED program *This is an expanded version of a summary that appeared in the November 2003 print
More informationTo wards Empirical and Scientific Theories of Computation
To wards Empirical and Scientific Theories of Computation (Extended Abstract) Steven Meyer Pragmatic C Software Corp., Minneapolis, MN, USA smeyer@tdl.com Abstract The current situation in empirical testing
More informationMAT Modular arithmetic and number theory. Modular arithmetic
Modular arithmetic 1 Modular arithmetic may seem like a new and strange concept at first The aim of these notes is to describe it in several different ways, in the hope that you will find at least one
More informationThis is an oral history interview conducted on May. 16th of 2003, conducted in Armonk, New York, with Uchinaga-san
This is an oral history interview conducted on May 16th of 2003, conducted in Armonk, New York, with Uchinaga-san from IBM Japan by IBM's corporate archivist, Paul Lasewicz. Thank you for coming and participating.
More informationTuring's Vision: The Birth of Computer Science (MIT Press)
Turing's Vision: The Birth of Computer Science (MIT Press) Chris Bernhardt Click here if your download doesn"t start automatically Turing's Vision: The Birth of Computer Science (MIT Press) Chris Bernhardt
More informationCSC 550: Introduction to Artificial Intelligence. Fall 2004
CSC 550: Introduction to Artificial Intelligence Fall 2004 See online syllabus at: http://www.creighton.edu/~davereed/csc550 Course goals: survey the field of Artificial Intelligence, including major areas
More informationNumber Theory and Security in the Digital Age
Number Theory and Security in the Digital Age Lola Thompson Ross Program July 21, 2010 Lola Thompson (Ross Program) Number Theory and Security in the Digital Age July 21, 2010 1 / 37 Introduction I have
More informationAirplane. Estimated Casualty Statistics for the Battle of Tannenberg Allied Powers: 267,000 Central Powers: 80,000
Airplane The Battle of Tannenberg in 1914 was an important victory for the Germans. They stopped the Russian army from advancing into German-controlled territory. Prior to the outbreak of fighting, both
More informationCE213 Artificial Intelligence Lecture 1
CE213 Artificial Intelligence Lecture 1 Module supervisor: Prof. John Gan, Email: jqgan, Office: 4B.524 Homepage: http://csee.essex.ac.uk/staff/jqgan/ CE213 website: http://orb.essex.ac.uk/ce/ce213/ Learning
More informationZolt-Gilburne Imagination Seminar. Knowledge and Games. Sergei Artemov
Zolt-Gilburne Imagination Seminar Knowledge and Games Sergei Artemov October 1, 2009 1 Plato (5-4 Century B.C.) One of the world's best known and most widely read and studied philosophers, a student of
More informationONCE HUMANS LEARNED TO SPEAK AND WRITE, THE FIRST NEWS REPORTS BEGAN TO EMERGE. TWO SOCIETIES ARE KNOWN FOR THEIR ADVANCES IN NEWS REPORTING:
IN THE BEGINNING ONCE HUMANS LEARNED TO SPEAK AND WRITE, THE FIRST NEWS REPORTS BEGAN TO EMERGE. TWO SOCIETIES ARE KNOWN FOR THEIR ADVANCES IN NEWS REPORTING: ROME CREATED A DAILY HANDWRITTEN NEWS SHEETS
More informationIntroduction to cognitive science Session 3: Cognitivism
Introduction to cognitive science Session 3: Cognitivism Martin Takáč Centre for cognitive science DAI FMFI Comenius University in Bratislava Príprava štúdia matematiky a informatiky na FMFI UK v anglickom
More informationThe Military Use of Alan Turing
312 The Military Use of Alan Turing Andrew Hodges* Alan Turing (1912-1954), British mathematician, was critical in the Anglo- American decipherment of German communications in the Second World War. This
More informationStrategic Bargaining. This is page 1 Printer: Opaq
16 This is page 1 Printer: Opaq Strategic Bargaining The strength of the framework we have developed so far, be it normal form or extensive form games, is that almost any well structured game can be presented
More informationOPERATION UNTHINKABLE: THE THIRD WORLD WAR: BRITISH PLANS TO ATTACK THE SOVIET EMPIRE 1945 BY JONATHAN WALKER
Read Online and Download Ebook OPERATION UNTHINKABLE: THE THIRD WORLD WAR: BRITISH PLANS TO ATTACK THE SOVIET EMPIRE 1945 BY JONATHAN WALKER DOWNLOAD EBOOK : OPERATION UNTHINKABLE: THE THIRD WORLD WAR:
More informationCSCI3390-Lecture 8: Undecidability of a special case of the tiling problem
CSCI3390-Lecture 8: Undecidability of a special case of the tiling problem February 16, 2016 Here we show that the constrained tiling problem from the last lecture (tiling the first quadrant with a designated
More informationJimi Hendrix. Activity. Stop and Think. Read the paragraphs. Stop and think as you read.
AF Archive/Alamy Jimi Hendrix l Reading Comprehension l Activity Read the paragraphs. Stop and think as you read. Stop and Think Good readers are active readers. Good readers stop and think about what
More informationPhilosophical Foundations. Artificial Intelligence Santa Clara University 2016
Philosophical Foundations Artificial Intelligence Santa Clara University 2016 Weak AI: Can machines act intelligently? 1956 AI Summer Workshop Every aspect of learning or any other feature of intelligence
More informationAUTOMATA What happens when your creation comes to life?
AUTOMATA What happens when your creation comes to life? WHO WAS FRANKENSTEIN? What do you know about Victor Frankenstein and his creature? Victor Frankenstein and the monster he created first appeared
More informationHex. Carlos Martinho
Hex Carlos Martinho 1 History and Rules Piet Hein The game of HEX was invented by Danish scientist, artist and poet Piet Hein (1905-1996) in 1942. Royal University College of Fine Arts (Sweden) to become
More informationWorld History Unit 13 Lesson 1 The Start of WWI The Belle Epoque The late 1800s & early 1900s had been a time of great scientific discoveries &
Unit 13 Lesson 1 The Start of WWI The Belle Epoque The late 1800s & early 1900s had been a time of great scientific discoveries & technological inventions. Europe was civilizing the world & living standards
More informationArtificial Intelligence. Robert Karapetyan, Benjamin Valadez, Gabriel Garcia, Jose Ambrosio, Ben Jair
Artificial Intelligence Robert Karapetyan, Benjamin Valadez, Gabriel Garcia, Jose Ambrosio, Ben Jair Historical Context For thousands of years, philosophers have tried to understand how we think The role
More informationFoundations of Artificial Intelligence Introduction State of the Art Summary. classification: Board Games: Overview
Foundations of Artificial Intelligence May 14, 2018 40. Board Games: Introduction and State of the Art Foundations of Artificial Intelligence 40. Board Games: Introduction and State of the Art 40.1 Introduction
More informationOsprey Publishing
OSPREY ADVENTURES Philip Smith & Joseph A. MCCullough Artistic Consultant: Mark Stacey 2 CONTENTS Introduction 6 Great Britain 8 France 34 Germany 52 United and Confederate States of America 70 Russia
More informationIf intelligence is uncomputable, then * Peter Kugel Computer Science Department, Boston College
If intelligence is uncomputable, then * Peter Kugel Computer Science Department, Boston College Intelligent behaviour presumably consists in a departure from the completely disciplined behaviour involved
More informationMyth Of The Great War: A New Military History Of WW1 By John Mosier
Myth Of The Great War: A New Military History Of WW1 By John Mosier 9780060084332: The Myth of the Great War: A New Military History of - AbeBooks.com: The Myth of the Great War: A New Military History
More informationUnit 8: Problems of Common Sense
Unit 8: Problems of Common Sense AI is brain-dead Can a machine have intelligence? Difficulty of Endowing Common Sense to Computers Philosophical Objections Strong vs. Weak AI Reference copyright c 2013
More information