Overview: The works of Alan Turing ( )
|
|
- Baldwin Palmer
- 5 years ago
- Views:
Transcription
1 Overview: The works of Alan Turing ( ) Dan Hallin Introduction Course in Computer Science (CD5600) The methodology of Science in Technology (CT3620) Mälardalen University 1
2 Abstract The main objective of the report is to give a general and chronological overview of the more important scientific contributions of Alan M. Turing ( ). Turing did major works in a wide array of areas: logic, mathematics, biology, philosophy, cryptanalysis, and in the then undefined areas which later became known as computer science, cognitive science, artificial intelligence and artificial life. Each of the works included is set in a background and explained in brief. The works include the classic On computable numbers where the so called universal Turing machine was first defined. Next is his PhD thesis where he defined ordinal logics and then his secret work for the British government breaking the German Enigma codes during World War II. After the war is his work of constructing the first nontheoretical universal Turing machines, stored-programme computers. At the end comes his works in the areas of artificial intelligence and artificial life. 2
3 Contents Overview: The works of Alan Turing ( )... 1 Abstract... 2 Contents... 3 Works of Alan Turing (chronologically) On computable numbers, with an application to the Entscheidungsproblem4 Background... 4 The systematic method... 4 The Turing machine... 4 The Church-Turing thesis Systems of logic based on ordinals... 5 Background... 5 The thesis Work at Bletchley Park... 6 Background... 6 Turing s contributions The first computers Artificial Intelligence Artificial Life... 8 Conclusions... 8 References
4 Works of Alan Turing (chronologically) 1936 On computable numbers, with an application to the Entscheidungsproblem Background In 1900 David Hilbert proposed the making of a complete, consistent, decidable formal system [Copeland04] for mathematics, which could express the whole thought content of mathematics in a uniform way [Copeland04]. In other words, it would be possible to decide the true or false status (this requires consistency) of any (completeness) statement by determining whether it is provable in the system (decidability) [Copeland04] and this would have to be possible to do with a systematic method. [Copeland04] When Kurt Gödel published his first incompleteness theorem he proved that such a system, if consistent, must be incomplete. This means that there will be true statements which cannot be proven within the system. The theorem was a devastating blow to the work of realizing Hilbert s system. It did however leave the so called Entscheidungsproblem (decidability problem). It is the problem of finding a systematic method which can decide whether any statement is provable in the system or not. In a lecture course held by M. H. A. Newman in 1935 Turing learned about this problem. [Copeland04] [Hodges95] [Wiki05d] The systematic method A systematic method... is any mathematical method of which all the following are true: The method can, in practice or in principle, be carried out by a human computer working with paper and pencil; The method can be given to the human computer in the form of a finite number of instructions; The method demands neither insight nor ingenuity on the part of the human being carrying it out; The method will definitely work if carried out without error; The method produces the desired result in a finite number of steps; or if the desired result is some infinite sequence of symbols..., then the method produces each individual symbol in the sequence in some finite number of steps. [Copeland04] In the definition above the terms insight and ingenuity are not explicitly defined. To tackle the problem of decidability Turing had to create a rigorously defined expression of a systematic method. He did this using an abstract machine with a basic set of simple rules. Turing referred to it as a computing machine, now called the Turing machine. [Copeland04] The Turing machine The machine Turing proposed consisted of a scanner and an unlimited tape divided into squares. The squares could contain either a blank, or any one symbol from a finite alphabet. The scanner could move one square at a time to the right or left along the tape, and read the symbol in its current square. The scanner could also erase the symbol in the square, or replace it with another. Finally the scanner had the ability to change into a finite number of different states at any time, the states defining the behaviour of the machine, moving, printing, erasing and changing state, in accordance to the scanned squares. Turing argued that this theoretical machine would be capable of carrying out any systematic method. [Copeland04] [Hodges04] [Turing36] 4
5 A special machine was a machine with a list of states such that it could carry out one certain method. Turing was able to show that a special machine capable of reading its states from the tape would be able to simulate any other special machine, this was called the universal computing machine. [Copeland04] [Turing36] [Wiki05b] The Church-Turing thesis In April 1936 Alonzo Church published A note on the Entsheidungsproblem where he stated that to each [systematic] method there corresponds a lambda-definable function [Copeland04]. Turing who had not yet published his results by this time had to reference to Church s work, but was able to prove that the universal computing machine was equivalent to his work. The universal computing machine was however a more intuitive solution to the problem and it has become the generally accepted notion, even if the thesis is called the Church-Turing thesis. [Copeland04] Both Church and Turing could with these systems independently prove that no consistent formal system of arithmetic is decidable [Copeland04], nor was any formal system based on functional calculus (now called first order predicate calculus ), which includes many important mathematical systems. [Copeland04] [Turing36] 1938 Systems of logic based on ordinals Background At this time Princeton University in USA was an intellectual centre, much due to the scientists who had been exiled from Nazi Germany. This was where Alonzo Church was active, and Turing had unsuccessfully applied for a Visiting Fellowship there in When Alonzo Church s parallel work was published in 1936 Turing decided yet again to go there and arrived in September 1936, intending to stay for one year. In the mid of 1937 he was offered a Visiting Fellowship, and came to stay another year. During this period he wrote his PhD thesis, being supervised by Church. [Copeland04] [Hodges04] The supervision of Church was not all for the better, Church suggested additions to the thesis which made it expand[...] to an appalling length [Turing38]. Moreover Turing also choose to use Church s more abstruse lambda-calculus notation making the thesis less accessible than if he had chosen to continue using Turing machines. [Copeland04] [Hodges04] The thesis In this work Turing tries to work around the implications of his own and Gödels work. Gödel had shown that there would always be statements which could be intuitively realized as true, but were not provable within the system. Turing wanted to extend logical systems by including each unprovable statement as a new rule and thus create new systems recursively. Each such new system would infinitely also include unprovable statements, but each system would also be more complete than the previous, capable of proving more statements. Turing called this ordinal logic. [Copeland04] Gödel had shown there was no systematic method of finding the unprovable true statements. As the Turing machine was equivalent to the systematic method, Turing had to introduce a new concept in the machine, the oracle, the new machine being called the o-machine. The oracle had the capability of answering questions which no Turing-machine could simulate, that is, the ones requiring intuition. Turing let the oracles function remain undefined - We 5
6 shall not go any further into the nature of this oracle apart from saying it cannot be a machine. [Turing39]. [Copeland04] Work at Bletchley Park Background After returning from America in September 1938 Turing went back to work at King s college. He was contacted by the Government Code and Cypher School (GC&CS) in London and secretly worked part-time on decrypting the Enigma cipher used by the German forces. The Enigma was a machine, looking much like an old-fashioned type-writer, which could be used to encrypt text messages before being sent over radio. The most important part of the Enigma were three wheels, which for each keystroke rotated and thus changed the internal wiring of the machine and the letter produced. In addition somewhere between 3 and 10 pairs of keys could be swapped onto each other. To decode a message, one needed not only the machine, but also the settings of the wheels and the swapped keys. The settings changed at regular intervals according to monthly tables. [Copeland04] Turing s contributions The German Army s routine of unnecessarily sending the current days wheel-setup as an uncoded preamble to the encrypted message, together with a twicely encoded message wheelsetup (called indicator) had made it relatively easy to decrypt messages. The British knew this routine was likely to change sooner or later and set out to find methods of decrypting messages without having this advantage. The day after the declaration of war on 3 September 1939, Turing and several other scientists moved to work at GS&CS, now in Bletchley Park outside London. [Copeland04] In late 1939 Turing did the logical design of an improved version of the Polish Bomba, a machine used in finding the correct indicators. The new machine was named Bombe, it was a logic machine consisting of 36 replicas of an Enigma. It could do the same work as the Bomba, but also had the ability of searching for something Turing called cribs. Cribs allowed the personnel to guess at a longer sentence within an encoded message and the machines would try to find a correct wheel-position given this. Guessing was possible by looking at stereotypical messages, for example reports from weather stations. Turing also worked out a method of finding which letters had been swapped with each other, by finding logical loops within the system and coupling the Bombes to mimic those. [Copeland04] In 1940 a lot of the traffic sent by the German Air Force could be decrypted. The German navy however used a more advanced technique for encrypting the indicator, and as it was thought of as impossible to break, no one was assigned to breaking to it. Turing quite enjoyed the idea of having a problem no one else was working on. By looking at old traffic where all the other message settings were known, he was soon able to figure the technique behind the indicators. They were hand-encrypted an extra time according to given tables and the tables were to always be destroyed before abandoning a ship. [Copeland04] In March and May 1941, captures of German ships brought in material which made it possible to reconstruct the tables. In June and July they were for the first time able to decrypt messages within hours of reception. This came at a critical time; the German submarines had sunk so many convoy ships headed for Britain that there was not enough food or oil. The convoys could now have their routes changed, and during the first 23 days of June not a single convoy ship sank from submarine attack. In July 1941 Turing and two of his co-workers were 6
7 summoned to the Foreign Office in London to be awarded for their services with 200 each, more than half a years wage for Turing. At the end of the war he received the Order of the British Empire. [Copeland04] [Mohan45] When operations were set up and running in Bletchley park, there was no longer enough work to occupy Turing, and instead he worked as a general scientific consultant. He only returned shortly in 1942 to help in breaking Tunny, a new system the Germans used in high-level army communications. In November 1942 he went on a journey to the USA to oversee the production of Bombes and the set up of an enciphered speech system for Churchill- Roosevelt messages. After returning in March the next year he spent the rest of the war on designing a secure voice communication device. [Copeland04] [Hodges95] [Wiki05a] The first computers At the end of the war Turing had seen the capabilities of Colossus, the special-purpose electronic digital computer built at Bletchley Park and had himself studied electronics. In the autumn of 1945 Turing was recruited to the Mathematics Division at the National Physics Laboratory (NPL) in London to design a stored-programme digital computer. He spent the end of 1945 writing a detailed report of the Automatic Computing Engine (ACE) and it was accepted in March [Copeland04] [Hodges04] His complex ACE design was cut down severely for a smaller pilot-version. The building of the ACE was not done in NPL, but by the engineers at the Post Office Research Station, where it was not given a high priority. The different sites also meant there was less communication between the designers and the implementers. [Copeland04] [Hodges04] Disheartened by the slow progress, Turing left NPL in autumn 1947 to go to Cambridge for a sabbatical year, from which he was never to return. In May 1948 Newman offered him a job as Deputy Director of the Computing Machine Laboratory at Manchester University where he came to design input and programming systems for an expanded version of the Manchester Baby, which had been the world s first stored-programme computer. [Copeland04] [Hodges04] Artificial Intelligence The first records of Turing mentioning intelligence in machines date as early as 1941, while he was working on the Enigma codes. He mentioned such things as problem-solving machines and learning machines. He designed chess-playing programs, and in lack of computers to run them on he drew out the operations by means of paper-and-pencil. [Copeland04] In 1948 Turing finished a report he called Intelligent Machinery. It was a far-sighted work, introducing many of the concepts which later became central to Artificial Intelligence (AI). His director, Sir Charles Darwin however thought of it as a school boy s essay [Copeland04] and Turing never published his ideas. Some of them were not discovered until reinvented by others. [Copeland04] Influenced by his experiences during the war, where machines searched for correct keys, in his work he hypothesized that intellectual activity consists mainly of various kinds of search [Copeland04]. He further defined logic-based problem-solving, and an early version of the imitation game, now known as the Turing test. He also proposed a system with a network of neurons, capable of learning. He claimed to have a proof (which has never been found) that such a network could be setup to learn to become a universal computing 7
8 machine (with a finite amount of memory), and proposed this to be similar to the functioning of an infants brain. [Copeland04] [Turing48] His next major contribution came with the publishing of his essay Computing machinery and Intelligence in In this work he looks at the definitions of thinking and intelligence, and how intelligence can be achieved by learning systems. This was also where he defined the complete setup of the conversational imitation game, where a computer taking the place of a person will be able to succeed equally well as a person. [Copeland04] [Hodges04] [Turing50] Artificial Life When Turing got his hands on the Ferranti Mark I, the first commercial electronic generalpurpose computer he set out into a new field. He wanted to study the generation of organization and pattern in biological structures. He was convinced that those were results of physical and mathematical laws and that the processes behind them could be simulated on the computer. In his 1952 publication The Chemical Basis of Morphogenesis he proposed the reaction-diffusion model, a mechanism capable of explaining the creation of animal patterns such as stripes, flecks and spots. Turing s ideas were so complex the computer power to execute them was not available until the early 80 s. When Turing died in 1954 he left behind material in this area which is yet to be understood. [Copeland04] [Hodges04] Conclusions The report shows Alan Turing to be a multifaceted man. While educated as a mathematician, he was able to commence and succeed in any area of logics interesting him. During his short life he made great contributions in the areas of logic, mathematics, philosophy, biology, cryptanalysis and he more or less came to define the areas of computer science, cognitive science, artificial intelligence and artificial life. 8
9 References [Copeland04] B. Jack Copeland, The essential Turing: seminal writings in computing, logic, philosophy, artifical intelligence, and artificial life plus the secrets of Enigma, Oxford University Press, ISBN , [Hodges95] Andrew Hodges, Alan Turing: a short biography, Alan Turing, at Short Turing Biography < (7 Oct 2005) [Hodges04] Andrew Hodges, The Alan Turing Internet Scrapbook, Alan Turing, at Alan Turing Internet Scrapbook < (7 Oct 2005) [Mohan45] Patrick Mohan, History of Hut 8 to December 1941, as reprinted in [Copeland04], [Turing36] A. M. Turing, On computable numbers, with an application to the Entscheidungsproblem, Proceedings of the London Mathematical Society, Series 2, 42, [Turing38] A. M. Turing, Turing s letters home, as reprinted in [Copeland04], May [Turing39] A. M. Turing, Systems of logic based on ordinals, Proceedings of the London Mathematical Society, Series 2, 45, As reprinted in [Copeland04]. [Turing48] A. M. Turing, Intelligent Machinery, as reprinted in [Copeland04], [Turing50] A. M. Turing, Computing machinery and Intelligence, Mind, vol. LIX, no. 236, p , As reprinted in [Copeland04]. [Wiki05a] Alan Turing Wikipedia, the free encyclopedia, Alan Turing, at Wikipedia, the free Encyclopedia < (7 Oct 2005) [Wiki05b] Church Turing thesis Wikipedia, the free encyclopedia, Church Turing thesis, at Wikipedia, the free Encyclopedia < (7 Oct 2005) [Wiki05c] Turing machine Wikipedia, the free encyclopedia, Turing Machine, at Wikipedia, the free Encyclopedia < (7 Oct 2005) [Wiki05d] Entscheidungsproblem Wikipedia, the free encyclopedia, Entscheidungsproblem, at Wikipedia, the free Encyclopedia < (14 Oct 2005) 9
Alan Turing and the Enigma of Computability
Alan Turing and the Enigma of Computability http://kosmoi.com/technology//computer/turing/ Alan Matheson Turing, b. June 23, 1912, d. June 7, 1954, was a British mathematician who conceived of a machine
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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationComputation. Philosophical Issues. Instructor: Viola Schiaffonati. March, 26 th 2018
Computation Philosophical Issues Instructor: Viola Schiaffonati March, 26 th 2018 Computer science: what kind of object? 2 Computer science: science/disciplines of computersor of computation? History of
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 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 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 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 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 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 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 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 informationComputability. What can be computed?
Computability What can be computed? Computability What can be computed? read/write tape 0 1 1 0 control Computability What can be computed? read/write tape 0 1 1 0 control Computability What can be computed?
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 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 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 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 informationPart I. Four Concepts
Part I Four Concepts B. Jack Copeland 2 Computation Chapter 1 Computation B. Jack Copeland The Birth of the Modern Computer As everyone who can operate a personal computer knows, the way to make the machine
More informationReflector A Dynamic Manifestation of Turing Machines with Time and Space Complexity Analysis
Reflector A Dynamic Manifestation of Turing Machines with Time and Space Complexity Analysis Behroz Mirza MS Computing, Shaheed Zulfikar Ali Bhutto Institute of Science and Technology 90 and 100 Clifton
More informationTuring s model of the mind
Published in J. Copeland, J. Bowen, M. Sprevak & R. Wilson (Eds.) The Turing Guide: Life, Work, Legacy (2017), Oxford: Oxford University Press mark.sprevak@ed.ac.uk Turing s model of the mind Mark Sprevak
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 informationAI Principles, Semester 2, Week 1, Lecture 2, Cognitive Science and AI Applications. The Computational and Representational Understanding of Mind
AI Principles, Semester 2, Week 1, Lecture 2, Cognitive Science and AI Applications How simulations can act as scientific theories The Computational and Representational Understanding of Mind Boundaries
More informationOracle Turing Machine. Kaixiang Wang
Oracle Turing Machine Kaixiang Wang Pre-background: What is Turing machine Oracle Turing Machine Definition Function Complexity Why Oracle Turing Machine is important Application of Oracle Turing Machine
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 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 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 informationDVA325 Formal Languages, Automata and Models of Computation (FABER)
DVA325 Formal Languages, Automata and Models of Computation (FABER) Lecture 1 - Introduction School of Innovation, Design and Engineering Mälardalen University 11 November 2014 Abu Naser Masud FABER November
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 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 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 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 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 informationThe depth HQIBPEXEZMUG is intercepted & read. September December Whole of Research Section works on trying to analyze the key produced by the depth
Appendix A - Fish Chronology 1940 First non-morse transmissions heard, but not followed up due to lack of resources and concentration on Enigma Swedish codebreaker, Arno Beurling, breaks the Siemens T52
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 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 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 informationProceedings Cognitive Distributed Computing and Its Impact on Information Technology (IT) as We Know It
Proceedings Cognitive Distributed Computing and Its Impact on Information Technology (IT) as We Know It Rao Mikkilineni C 3 DNA, 7533 Kingsbury Ct, Cupertino, CA 95014, USA; rao@c3dna.com; Tel.: +1-408-406-7639
More informationWhat is AI? AI is the reproduction of human reasoning and intelligent behavior by computational methods. an attempt of. Intelligent behavior Computer
What is AI? an attempt of AI is the reproduction of human reasoning and intelligent behavior by computational methods Intelligent behavior Computer Humans 1 What is AI? (R&N) Discipline that systematizes
More informationA Definition of Artificial Intelligence
A Definition of Artificial Intelligence arxiv:1210.1568v1 [cs.ai] 3 Oct 2012 Dimiter Dobrev Institute of Mathematics and Informatics Bulgarian Academy of Sciences Sofia 1090, BULGARIA e-mail: d@dobrev.com
More informationArtificial Intelligence
Artificial Intelligence (Sistemas Inteligentes) Pedro Cabalar Depto. Computación Universidade da Coruña, SPAIN Chapter 1. Introduction Pedro Cabalar (UDC) ( Depto. AIComputación Universidade da Chapter
More informationName: Date: Period: The Atomic Bomb: Trinity, Hiroshima and Nagasaki, the Cold War and More. By Alan Ream 2017 Version
Name: Date: Period: The Atomic Bomb: Trinity, Hiroshima and Nagasaki, the Cold War and More By Alan Ream 2017 Version The bombings of Hiroshima and Nagasaki marked the first and only time in the history
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 information18 Completeness and Compactness of First-Order Tableaux
CS 486: Applied Logic Lecture 18, March 27, 2003 18 Completeness and Compactness of First-Order Tableaux 18.1 Completeness Proving the completeness of a first-order calculus gives us Gödel s famous completeness
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 informationPublic Key Cryptography
Public Key Cryptography How mathematics allows us to send our most secret messages quite openly without revealing their contents - except only to those who are supposed to read them The mathematical ideas
More informationCDT314 FABER Formal Languages, Automata and Models of Computation MARK BURGIN INDUCTIVE TURING MACHINES
CDT314 FABER Formal Languages, Automata and Models of Computation MARK BURGIN INDUCTIVE TURING MACHINES 2012 1 Inductive Turing Machines Burgin, M. Inductive Turing Machines, Notices of the Academy of
More informationThe Irrelevance of Turing Machines to AI
To appear in a book edited by Matthias Scheutz The Irrelevance of Turing Machines to AI Aaron Sloman University of Birmingham http://www.cs.bham.ac.uk/ axs/ Contents 1 Introduction 2 2 Two Strands of Development
More informationCS415 Human Computer Interaction
CS415 Human Computer Interaction Lecture 11 Advanced HCI Intro to Cognitive Models November 3, 2016 Sam Siewert Assignments Assignment #5 Propose Group Project (Groups of 3) Assignment #6 Project Final
More informationCSC384 Intro to Artificial Intelligence* *The following slides are based on Fahiem Bacchus course lecture notes.
CSC384 Intro to Artificial Intelligence* *The following slides are based on Fahiem Bacchus course lecture notes. Artificial Intelligence A branch of Computer Science. Examines how we can achieve intelligent
More informationArtificial Intelligence. An Introductory Course
Artificial Intelligence An Introductory Course 1 Outline 1. Introduction 2. Problems and Search 3. Knowledge Representation 4. Advanced Topics - Game Playing - Uncertainty and Imprecision - Planning -
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 informationMaster Artificial Intelligence
Master Artificial Intelligence Appendix I Teaching outcomes of the degree programme (art. 1.3) 1. The master demonstrates knowledge, understanding and the ability to evaluate, analyze and interpret relevant
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 informationCOMPUTATONAL INTELLIGENCE
COMPUTATONAL INTELLIGENCE October 2011 November 2011 Siegfried Nijssen partially based on slides by Uzay Kaymak Leiden Institute of Advanced Computer Science e-mail: snijssen@liacs.nl Katholieke Universiteit
More informationRemember that represents the set of all permutations of {1, 2,... n}
20180918 Remember that represents the set of all permutations of {1, 2,... n} There are some basic facts about that we need to have in hand: 1. Closure: If and then 2. Associativity: If and and then 3.
More informationConway s Soldiers. Jasper Taylor
Conway s Soldiers Jasper Taylor And the maths problem that I did was called Conway s Soldiers. And in Conway s Soldiers you have a chessboard that continues infinitely in all directions and every square
More informationThe essential role of. mental models in HCI: Card, Moran and Newell
1 The essential role of mental models in HCI: Card, Moran and Newell Kate Ehrlich IBM Research, Cambridge MA, USA Introduction In the formative years of HCI in the early1980s, researchers explored the
More informationIrving John (Jack) Good
Irving John (Jack) Good Born Isidore Jacob Gudak December 9, 1916, London, England,- cryptologist, statistician, and early worker on Colossus at Bletchley Park and the University of Manchester Mark I;
More informationSocial Understanding
Social Understanding THEORY AND DECISION LIBRARY General Editor: Julian Nida-Rümelin (Universität München) Series A: Philosophy and Methodology of the Social Sciences Series B: Mathematical and Statistical
More informationStrong AI and the Chinese Room Argument, Four views
Strong AI and the Chinese Room Argument, Four views Joris de Ruiter 3AI, Vrije Universiteit Amsterdam jdruiter@few.vu.nl First paper for: FAAI 2006 Abstract Strong AI is the view that the human mind is
More informationhttp://www.youtube.com/watch?v=dnbsnde1ika&feature=related http://www.youtube.com/watch?v=jlnc9yvku0k&feature=playlist&p=ad3bb14f42437555&index=1 http://www.youtube.com/watch?v=axwaqtluzmi&feature=playlist&p=ad3bb14f42437555&index=2
More informationMachines that dream: A brief introduction into developing artificial general intelligence through AI- Kindergarten
Machines that dream: A brief introduction into developing artificial general intelligence through AI- Kindergarten Danko Nikolić - Department of Neurophysiology, Max Planck Institute for Brain Research,
More informationBrain-inspired information processing: Beyond the Turing machine
Brain-inspired information processing: Beyond the Turing machine Herbert Jaeger Jacobs University Bremen Part 1: That is Computing! Turing computability Image sources are given on last slide Deep historical
More informationAI 101: An Opinionated Computer Scientist s View. Ed Felten
AI 101: An Opinionated Computer Scientist s View Ed Felten Robert E. Kahn Professor of Computer Science and Public Affairs Director, Center for Information Technology Policy Princeton University A Brief
More informationWhy we need to know what AI is. Overview. Artificial Intelligence is it finally arriving?
Artificial Intelligence is it finally arriving? Artificial Intelligence is it finally arriving? Are we nearly there yet? Leslie Smith Computing Science and Mathematics University of Stirling May 2 2013.
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 informationLesson Plan. Session Title: History & Development of Technology: Innovative Applications of Technology in Engineering Part 1
Course Title: Principles of Manufacturing Lesson Plan Session Title: History & Development of Technology: Innovative Applications of Technology in Engineering Part 1 Performance Objective: After completing
More informationContinuous time and Discrete time Signals and Systems
Continuous time and Discrete time Signals and Systems 1. Systems in Engineering A system is usually understood to be an engineering device in the field, and a mathematical representation of this system
More informationMATHEMATICS IN COMMUNICATIONS: INTRODUCTION TO CODING. A Public Lecture to the Uganda Mathematics Society
Abstract MATHEMATICS IN COMMUNICATIONS: INTRODUCTION TO CODING A Public Lecture to the Uganda Mathematics Society F F Tusubira, PhD, MUIPE, MIEE, REng, CEng Mathematical theory and techniques play a vital
More information(Refer Slide Time: 3:11)
Digital Communication. Professor Surendra Prasad. Department of Electrical Engineering. Indian Institute of Technology, Delhi. Lecture-2. Digital Representation of Analog Signals: Delta Modulation. Professor:
More informationCS:4420 Artificial Intelligence
CS:4420 Artificial Intelligence Spring 2018 Introduction Cesare Tinelli The University of Iowa Copyright 2004 18, Cesare Tinelli and Stuart Russell a a These notes were originally developed by Stuart Russell
More informationSeizing The Enigma: The Race To Break The German U- Boat Codes, , Revised Edition By David Kahn READ ONLINE
Seizing The Enigma: The Race To Break The German U- Boat Codes, 1939 1945, Revised Edition By David Kahn READ ONLINE If you are searched for a ebook by David Kahn Seizing the Enigma: The Race to Break
More informationTribute to Martin Gardner: Combinatorial Card Problems
Tribute to Martin Gardner: Combinatorial Card Problems Doug Ensley, SU Math Department October 7, 2010 Combinatorial Card Problems The column originally appeared in Scientific American magazine. Combinatorial
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 informationCPSC 467: Cryptography and Computer Security
CPSC 467: Cryptography and Computer Security Michael J. Fischer Lecture 5b September 11, 2013 CPSC 467, Lecture 5b 1/11 Stream ciphers CPSC 467, Lecture 5b 2/11 Manual stream ciphers Classical stream ciphers
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 informationMembrane Computing as Multi Turing Machines
Volume 4 No.8, December 2012 www.ijais.org Membrane Computing as Multi Turing Machines Mahmoud Abdelaziz Amr Badr Ibrahim Farag ABSTRACT A Turing machine (TM) can be adapted to simulate the logic of any
More informationAppendices master s degree programme Artificial Intelligence
Appendices master s degree programme Artificial Intelligence 2015-2016 Appendix I Teaching outcomes of the degree programme (art. 1.3) 1. The master demonstrates knowledge, understanding and the ability
More informationArtificial Intelligence: Definition
Lecture Notes Artificial Intelligence: Definition Dae-Won Kim School of Computer Science & Engineering Chung-Ang University What are AI Systems? Deep Blue defeated the world chess champion Garry Kasparov
More informationThe attribution problem in Cognitive Science. Thinking Meat?! Formal Systems. Formal Systems have a history
The attribution problem in Cognitive Science Thinking Meat?! How can we get Reason-respecting behavior out of a lump of flesh? We can t see the processes we care the most about, so we must infer them from
More informationCSE 355: Human-aware Robo.cs Introduction to Theoretical Computer Science
CSE 355: Introduction to Theoretical Computer Science Instructor: Dr. Yu ( Tony ) Zhang Lecture: WGHL101, Tue/Thu, 3:00 4:15 PM Office Hours: BYENG 594, Tue/Thu, 5:00 6:00PM 1 Subject of interest? 2 Robo.cs
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 informationLecture 19 November 6, 2014
6.890: Algorithmic Lower Bounds: Fun With Hardness Proofs Fall 2014 Prof. Erik Demaine Lecture 19 November 6, 2014 Scribes: Jeffrey Shen, Kevin Wu 1 Overview Today, we ll cover a few more 2 player games
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 informationAppendices master s degree programme Human Machine Communication
Appendices master s degree programme Human Machine Communication 2015-2016 Appendix I Teaching outcomes of the degree programme (art. 1.3) 1. The master demonstrates knowledge, understanding and the ability
More informationStuart C. Shapiro. Department of Computer Science. State University of New York at Bualo. 226 Bell Hall U.S.A. March 9, 1995.
Computationalism Stuart C. Shapiro Department of Computer Science and Center for Cognitive Science State University of New York at Bualo 226 Bell Hall Bualo, NY 14260-2000 U.S.A shapiro@cs.buffalo.edu
More informationUNIT 19 Lesson Plan 1
UNIT 19 Lesson Plan 1 1 Introduction T: In this first lesson we'll look at the principles of the Lorenz cipher; in the next lesson we'll learn how the Lorenz cipher machine was used to break the code.
More informationThe number theory behind cryptography
The University of Vermont May 16, 2017 What is cryptography? Cryptography is the practice and study of techniques for secure communication in the presence of adverse third parties. What is cryptography?
More information