Can a Machine Think?
|
|
- Adrian Reeves
- 6 years ago
- Views:
Transcription
1 Can a Machine Think? Mathematics 15: Lecture 27 Dan Sloughter Furman University December 4, 2006 Dan Sloughter (Furman University) Can a Machine Think? December 4, / 8
2 Alan Turing Dan Sloughter (Furman University) Can a Machine Think? December 4, / 8
3 Alan Turing Work during World War II Dan Sloughter (Furman University) Can a Machine Think? December 4, / 8
4 Alan Turing Work during World War II The Germans coded and decoded messages on machines called Enigma machines. Dan Sloughter (Furman University) Can a Machine Think? December 4, / 8
5 Alan Turing Work during World War II The Germans coded and decoded messages on machines called Enigma machines. English mathematicians working at Bletchley Park deciphered the code using machines specifically designed to decode Enigma messages. Dan Sloughter (Furman University) Can a Machine Think? December 4, / 8
6 Alan Turing Work during World War II The Germans coded and decoded messages on machines called Enigma machines. English mathematicians working at Bletchley Park deciphered the code using machines specifically designed to decode Enigma messages. Turing s work was instrumental in breaking the Enigma codes, a major factor in changing the course of the war. Dan Sloughter (Furman University) Can a Machine Think? December 4, / 8
7 Alan Turing Work during World War II The Germans coded and decoded messages on machines called Enigma machines. English mathematicians working at Bletchley Park deciphered the code using machines specifically designed to decode Enigma messages. Turing s work was instrumental in breaking the Enigma codes, a major factor in changing the course of the war. For example, ship convoys from the US to Britain were able to avoid the German submarines in the Atlantic, and the Allies were able to find and destroy many German submarines. Dan Sloughter (Furman University) Can a Machine Think? December 4, / 8
8 Alan Turing Work during World War II The Germans coded and decoded messages on machines called Enigma machines. English mathematicians working at Bletchley Park deciphered the code using machines specifically designed to decode Enigma messages. Turing s work was instrumental in breaking the Enigma codes, a major factor in changing the course of the war. For example, ship convoys from the US to Britain were able to avoid the German submarines in the Atlantic, and the Allies were able to find and destroy many German submarines. Before the war, Turing had worked on a machine to compute the zeros of the zeta function; after the war, he designs and builds one of the first programmable digital computers. Dan Sloughter (Furman University) Can a Machine Think? December 4, / 8
9 Alan Turing Work during World War II The Germans coded and decoded messages on machines called Enigma machines. English mathematicians working at Bletchley Park deciphered the code using machines specifically designed to decode Enigma messages. Turing s work was instrumental in breaking the Enigma codes, a major factor in changing the course of the war. For example, ship convoys from the US to Britain were able to avoid the German submarines in the Atlantic, and the Allies were able to find and destroy many German submarines. Before the war, Turing had worked on a machine to compute the zeros of the zeta function; after the war, he designs and builds one of the first programmable digital computers. Turing Prize in computer science is the equivalent of the Fields Medal in mathematics. Dan Sloughter (Furman University) Can a Machine Think? December 4, / 8
10 Alan Turing Work during World War II The Germans coded and decoded messages on machines called Enigma machines. English mathematicians working at Bletchley Park deciphered the code using machines specifically designed to decode Enigma messages. Turing s work was instrumental in breaking the Enigma codes, a major factor in changing the course of the war. For example, ship convoys from the US to Britain were able to avoid the German submarines in the Atlantic, and the Allies were able to find and destroy many German submarines. Before the war, Turing had worked on a machine to compute the zeros of the zeta function; after the war, he designs and builds one of the first programmable digital computers. Turing Prize in computer science is the equivalent of the Fields Medal in mathematics. Turing committed suicide in Dan Sloughter (Furman University) Can a Machine Think? December 4, / 8
11 Machines of the mind Turing described an ideal computing machine, which we now call a Turing machine. Dan Sloughter (Furman University) Can a Machine Think? December 4, / 8
12 Machines of the mind Turing described an ideal computing machine, which we now call a Turing machine. Infinite paper tape divided into squares Dan Sloughter (Furman University) Can a Machine Think? December 4, / 8
13 Machines of the mind Turing described an ideal computing machine, which we now call a Turing machine. Infinite paper tape divided into squares Symbols written on the squares Dan Sloughter (Furman University) Can a Machine Think? December 4, / 8
14 Machines of the mind Turing described an ideal computing machine, which we now call a Turing machine. Infinite paper tape divided into squares Symbols written on the squares A machine which could read the squares Dan Sloughter (Furman University) Can a Machine Think? December 4, / 8
15 Machines of the mind Turing described an ideal computing machine, which we now call a Turing machine. Infinite paper tape divided into squares Symbols written on the squares A machine which could read the squares Depending on the internal state of the machine and the symbol being read, the machine would Dan Sloughter (Furman University) Can a Machine Think? December 4, / 8
16 Machines of the mind Turing described an ideal computing machine, which we now call a Turing machine. Infinite paper tape divided into squares Symbols written on the squares A machine which could read the squares Depending on the internal state of the machine and the symbol being read, the machine would move forward or backward one square on the tape, or Dan Sloughter (Furman University) Can a Machine Think? December 4, / 8
17 Machines of the mind Turing described an ideal computing machine, which we now call a Turing machine. Infinite paper tape divided into squares Symbols written on the squares A machine which could read the squares Depending on the internal state of the machine and the symbol being read, the machine would move forward or backward one square on the tape, or erase the symbol on the current square and replace it with another. Dan Sloughter (Furman University) Can a Machine Think? December 4, / 8
18 Machines of the mind Turing described an ideal computing machine, which we now call a Turing machine. Infinite paper tape divided into squares Symbols written on the squares A machine which could read the squares Depending on the internal state of the machine and the symbol being read, the machine would move forward or backward one square on the tape, or erase the symbol on the current square and replace it with another. Turing shows that such a machine could perform any possible computation. Dan Sloughter (Furman University) Can a Machine Think? December 4, / 8
19 Example: solving equations Consider Fermat s equation: x n + y n = z n, where n is a positive integer. Dan Sloughter (Furman University) Can a Machine Think? December 4, / 8
20 Example: solving equations Consider Fermat s equation: x n + y n = z n, where n is a positive integer. Question: Given an n, does this equation have a solution in integers? Dan Sloughter (Furman University) Can a Machine Think? December 4, / 8
21 Example: solving equations Consider Fermat s equation: x n + y n = z n, where n is a positive integer. Question: Given an n, does this equation have a solution in integers? We could create a Turing machine T which would search for solutions when given an input n by working through a list of integers. Dan Sloughter (Furman University) Can a Machine Think? December 4, / 8
22 Example: solving equations Consider Fermat s equation: x n + y n = z n, where n is a positive integer. Question: Given an n, does this equation have a solution in integers? We could create a Turing machine T which would search for solutions when given an input n by working through a list of integers. Then T (n) would halt when n = 1 (having found a solution, such as x = 1, y = 1, and z = 2), and when n = 2 (having found a solution such as x = 3, y = 4, and z = 5). Dan Sloughter (Furman University) Can a Machine Think? December 4, / 8
23 Example: solving equations Consider Fermat s equation: x n + y n = z n, where n is a positive integer. Question: Given an n, does this equation have a solution in integers? We could create a Turing machine T which would search for solutions when given an input n by working through a list of integers. Then T (n) would halt when n = 1 (having found a solution, such as x = 1, y = 1, and z = 2), and when n = 2 (having found a solution such as x = 3, y = 4, and z = 5). But T would not halt for any other input. Dan Sloughter (Furman University) Can a Machine Think? December 4, / 8
24 The halting problem Suppose we list all Turing machines: T 1, T 2, T 3,.... Dan Sloughter (Furman University) Can a Machine Think? December 4, / 8
25 The halting problem Suppose we list all Turing machines: T 1, T 2, T 3,.... Does there exist an algorithm which can tell when T n (p) will not halt? Dan Sloughter (Furman University) Can a Machine Think? December 4, / 8
26 The halting problem Suppose we list all Turing machines: T 1, T 2, T 3,.... Does there exist an algorithm which can tell when T n (p) will not halt? That is, suppose A(n, p) is a procedure which halts only if T n (p) does not halt. Dan Sloughter (Furman University) Can a Machine Think? December 4, / 8
27 The halting problem Suppose we list all Turing machines: T 1, T 2, T 3,.... Does there exist an algorithm which can tell when T n (p) will not halt? That is, suppose A(n, p) is a procedure which halts only if T n (p) does not halt. Now consider A(n, n): If A(n, n) stops, then T n (n) does not stop. Dan Sloughter (Furman University) Can a Machine Think? December 4, / 8
28 The halting problem Suppose we list all Turing machines: T 1, T 2, T 3,.... Does there exist an algorithm which can tell when T n (p) will not halt? That is, suppose A(n, p) is a procedure which halts only if T n (p) does not halt. Now consider A(n, n): If A(n, n) stops, then T n (n) does not stop. But now A(n, n) is a Turing machine: it s a computational procedure which takes an input n and may or may not stop with some output. So A(n, n) = T k (n) for some k. Dan Sloughter (Furman University) Can a Machine Think? December 4, / 8
29 The halting problem Suppose we list all Turing machines: T 1, T 2, T 3,.... Does there exist an algorithm which can tell when T n (p) will not halt? That is, suppose A(n, p) is a procedure which halts only if T n (p) does not halt. Now consider A(n, n): If A(n, n) stops, then T n (n) does not stop. But now A(n, n) is a Turing machine: it s a computational procedure which takes an input n and may or may not stop with some output. So A(n, n) = T k (n) for some k. We now have: If A(k, k) stops, then T k (k) does not stop; that is, if T k (k) stops, then T k (k) does not stop. Dan Sloughter (Furman University) Can a Machine Think? December 4, / 8
30 Conclusion To avoid a contradiction, we must conclude that T k (k) does not stop. Dan Sloughter (Furman University) Can a Machine Think? December 4, / 8
31 Conclusion To avoid a contradiction, we must conclude that T k (k) does not stop. This means that we know T k (k) does not stop, but no computational procedure can tell us that it does. Dan Sloughter (Furman University) Can a Machine Think? December 4, / 8
32 The Turing test Question: Can a machine think? Dan Sloughter (Furman University) Can a Machine Think? December 4, / 8
33 The Turing test Question: Can a machine think? To answer, one must first say what we mean by machine and what we mean by think. Dan Sloughter (Furman University) Can a Machine Think? December 4, / 8
34 The Turing test Question: Can a machine think? To answer, one must first say what we mean by machine and what we mean by think. Machine: programmable digital computer, in part because it can mimic any other type of machine. Dan Sloughter (Furman University) Can a Machine Think? December 4, / 8
35 The Turing test Question: Can a machine think? To answer, one must first say what we mean by machine and what we mean by think. Machine: programmable digital computer, in part because it can mimic any other type of machine. Thinking: we must say a machine can think if an interrogator cannot distinguish the replies from the machine and a person. Dan Sloughter (Furman University) Can a Machine Think? December 4, / 8
36 Objections Theological: only creatures with immortal souls can think. Dan Sloughter (Furman University) Can a Machine Think? December 4, / 8
37 Objections Theological: only creatures with immortal souls can think. Heads in the Sand: the consequences of machines being able to think are too dire to consider. Dan Sloughter (Furman University) Can a Machine Think? December 4, / 8
38 Objections Theological: only creatures with immortal souls can think. Heads in the Sand: the consequences of machines being able to think are too dire to consider. Mathematical: results of Gödel and and Turing show the limitations of formal reasoning abilities. Dan Sloughter (Furman University) Can a Machine Think? December 4, / 8
39 Objections Theological: only creatures with immortal souls can think. Heads in the Sand: the consequences of machines being able to think are too dire to consider. Mathematical: results of Gödel and and Turing show the limitations of formal reasoning abilities. Consciousness: a machine cannot have self-awareness. Dan Sloughter (Furman University) Can a Machine Think? December 4, / 8
40 Objections Theological: only creatures with immortal souls can think. Heads in the Sand: the consequences of machines being able to think are too dire to consider. Mathematical: results of Gödel and and Turing show the limitations of formal reasoning abilities. Consciousness: a machine cannot have self-awareness. Disabilities: there are numerous human traits that a machine could never share. Dan Sloughter (Furman University) Can a Machine Think? December 4, / 8
41 Objections Theological: only creatures with immortal souls can think. Heads in the Sand: the consequences of machines being able to think are too dire to consider. Mathematical: results of Gödel and and Turing show the limitations of formal reasoning abilities. Consciousness: a machine cannot have self-awareness. Disabilities: there are numerous human traits that a machine could never share. Lady Lovelace s objection: a machine cannot originate ideas. Dan Sloughter (Furman University) Can a Machine Think? December 4, / 8
42 Objections Theological: only creatures with immortal souls can think. Heads in the Sand: the consequences of machines being able to think are too dire to consider. Mathematical: results of Gödel and and Turing show the limitations of formal reasoning abilities. Consciousness: a machine cannot have self-awareness. Disabilities: there are numerous human traits that a machine could never share. Lady Lovelace s objection: a machine cannot originate ideas. Continuity of the nervous system: the human nervous system appears to have a continuum of states. Dan Sloughter (Furman University) Can a Machine Think? December 4, / 8
43 Objections Theological: only creatures with immortal souls can think. Heads in the Sand: the consequences of machines being able to think are too dire to consider. Mathematical: results of Gödel and and Turing show the limitations of formal reasoning abilities. Consciousness: a machine cannot have self-awareness. Disabilities: there are numerous human traits that a machine could never share. Lady Lovelace s objection: a machine cannot originate ideas. Continuity of the nervous system: the human nervous system appears to have a continuum of states. Informality of behaviour: there is no set of rules which describe what a man should do in every conceivable set of circumstances. Dan Sloughter (Furman University) Can a Machine Think? December 4, / 8
44 Objections Theological: only creatures with immortal souls can think. Heads in the Sand: the consequences of machines being able to think are too dire to consider. Mathematical: results of Gödel and and Turing show the limitations of formal reasoning abilities. Consciousness: a machine cannot have self-awareness. Disabilities: there are numerous human traits that a machine could never share. Lady Lovelace s objection: a machine cannot originate ideas. Continuity of the nervous system: the human nervous system appears to have a continuum of states. Informality of behaviour: there is no set of rules which describe what a man should do in every conceivable set of circumstances. Extra-sensory perception Dan Sloughter (Furman University) Can a Machine Think? December 4, / 8
Class 24: Computability
Menu Class 24: Review: Gödel s Theorem Proof in Axiomatic Systems : Are there some problems that it is impossible to write a program to solve? Halting Problems Hockey Team Logo CS150: Computer Science
More informationTuring machines COMS Ashley Montanaro 21 March Department of Computer Science, University of Bristol Bristol, UK
COMS11700 Turing machines Department of Computer Science, University of Bristol Bristol, UK 21 March 2014 COMS11700: Turing machines Slide 1/15 Introduction We have seen two models of computation: finite
More informationTuring Machines. COMP2600 Formal Methods for Software Engineering. Katya Lebedeva. Australian National University Semester 2, 2014
Turing Machines COMP2600 Formal Methods for Software Engineering Katya Lebedeva Australian National University Semester 2, 2014 Slides created by Jeremy Dawson and Ranald Clouston COMP 2600 Turing Machines
More informationPre- Calculus CP 1 Section 8.5 Matrix Application: Cryptography
Name: Matrix operations, inverses, and determinants have several applications including performing a geometric transformation, solving a system, organizing data, and finding the area of a triangle. In
More informationFinite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018
Finite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018 Lecture 15 Ana Bove May 17th 2018 Recap: Context-free Languages Chomsky hierarchy: Regular languages are also context-free; Pumping lemma
More informationIV. Turing Machine. Yuxi Fu. BASICS, Shanghai Jiao Tong University
IV. Turing Machine Yuxi Fu BASICS, Shanghai Jiao Tong University Alan Turing Alan Turing (23Jun.1912-7Jun.1954), an English student of Church, introduced a machine model for effective calculation in On
More informationTheory of Computation CS3102 Spring 2014 A tale of computers, math, problem solving, life, love and tragic death
Theory of Computation CS3102 Spring 2014 A tale of computers, math, problem solving, life, love and tragic death Nathan Brunelle Department of Computer Science University of Virginia www.cs.virginia.edu/~njb2b/theory
More informationTuring Machines. The Language Hierarchy. Context-Free Languages. Regular Languages. Courtesy Costas Busch - RPI 1
Turing Machines a n b n c The anguage Hierarchy n? ww? Context-Free anguages a n b n egular anguages a * a *b* ww Courtesy Costas Busch - PI a n b n c n Turing Machines anguages accepted by Turing Machines
More informationLecture 12: Mapping Reductions
Lecture 12: Mapping Reductions October 18, 2016 CS 1010 Theory of Computation Topics Covered 1. The Language EQ T M 2. Mapping Reducibility 3. The Post Correspondence Problem 1 The Language EQ T M The
More information19 Lorenz Cipher Machine
9 Lorenz Cipher Machine During the Second World War, the codebreakers at Bletchley Park devised a variety of techniques that enabled the Allies to break the major codes used by the Germans. Not only was
More informationLecture notes on Turing machines
Lecture notes on Turing machines Ivano Ciardelli 1 Introduction Turing machines, introduced by Alan Turing in 1936, are one of the earliest and perhaps the best known model of computation. The importance
More informationDecidable Languages - relationship with other classes.
CSE2001, Fall 2006 1 Last time we saw some examples of decidable languages (or, solvable problems). Today we will start by looking at the relationship between the decidable languages, and the regular and
More informationBefore We Start. Turing Machines. Languages. Now our picture looks like. Theory Hall of Fame. The Turing Machine. Any questions? The $64,000 Question
Before We Start s Any questions? Languages The $64,000 Question What is a language? What is a class of languages? Now our picture looks like Context Free Languages Deterministic Context Free Languages
More informationMathematics 22: Lecture 19
Mathematics 22: Lecture 19 Legendre s Equation Dan Sloughter Furman University February 5, 2008 Dan Sloughter (Furman University) Mathematics 22: Lecture 19 February 5, 2008 1 / 11 Example: Legendre s
More informationCristina Nita-Rotaru. CS355: Cryptography. Lecture 4: Enigma.
CS355: Cryptography Lecture 4: Enigma. Towards cryptographic engines } How to move from pencil and paper to more automatic ways of encrypting and decrypting? } How to design more secure ciphers } Alberti
More informationComputation. Some history...
Computation Motivating questions: What does computation mean? What are the similarities and differences between computation in computers and in natural systems? What are the limits of computation? Are
More informationLecture 13: Turing Machine
Lecture 13: Turing Machine Instructor: Ketan Mulmuley Scriber: Yuan Li February 19, 2015 Turing machine is an abstract machine which in principle can simulate any computation in nature. Church-Turing Thesis:
More informationMathematics 13: Lecture 4
Mathematics 13: Lecture Planes Dan Sloughter Furman University January 10, 2008 Dan Sloughter (Furman University) Mathematics 13: Lecture January 10, 2008 1 / 10 Planes in R n Suppose v and w are nonzero
More informationObsevations, Truth and Logic
Obsevations, Truth and Logic Jaap van Oosten Department of Mathematics Utrecht University Axioma, Groningen May 9, 2018 Art and Science have the same basic subject matter: Observations. Art (visual art):
More informationTuring Machines. Lecture 8
Turing Machines Lecture 8 1 Course Trajectory We will see algorithms, what can be done. But what cannot be done? 2 Computation Problem: To compute a function F that maps each input (a string) to an output
More informationcse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska
cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska LECTURE 13 CHAPTER 4 TURING MACHINES 1. The definition of Turing machine 2. Computing with Turing machines 3. Extensions of Turing
More informationUnderstanding Computation
Understanding Computation 1 Mathematics & Computation -Mathematics has been around for a long time as a method of computing. -Efforts to find canonical way of computations. - Machines have helped with
More informationTuring Machines. Wen-Guey Tzeng Computer Science Department National Chiao Tung University
Turing Machines Wen-Guey Tzeng Computer Science Department National Chiao Tung University Alan Turing One of the first to conceive a machine that can run computation mechanically without human intervention.
More informationMa/CS 6a Class 23: Generating Functions
Ma/CS 6a Class 23: Generating Functions By Adam Sheffer Recall: Power Series We define sums and products of power series as in the case of polynomials. A x = a 0 + a 1 x + a 2 x 2 + B x = b 0 + b 1 x +
More informationConjectures and proof. Book page 24-30
Conjectures and proof Book page 24-30 What is a conjecture? A conjecture is used to describe a pattern in mathematical terms When a conjecture has been proved, it becomes a theorem There are many types
More informationIntroduction to Turing Machines
Introduction to Turing Machines Deepak D Souza Department of Computer Science and Automation Indian Institute of Science, Bangalore. 12 November 2015 Outline 1 Turing Machines 2 Formal definitions 3 Computability
More informationComputability and Complexity
Computability and Complexity Lecture 5 Reductions Undecidable problems from language theory Linear bounded automata given by Jiri Srba Lecture 5 Computability and Complexity 1/14 Reduction Informal Definition
More informationLecture 14: Recursive Languages
Lecture 14: Recursive Languages Instructor: Ketan Mulmuley Scriber: Yuan Li February 24, 2015 1 Recursive Languages Definition 1.1. A language L Σ is called recursively enumerable (r. e.) or computably
More informationTuring Machines COMP1600 / COMP6260. Dirk Pattinson Australian National University. Semester 2, 2017
Turing Machines COMP1600 / COMP6260 Dirk Pattinson Australian National University Semester 2, 2017 Catch Up / Drop in Lab When Fridays, 15.00-17.00 Where N335, CSIT Building (bldg 108) Until the end of
More informationChange of Variables: Indefinite Integrals
Change of Variables: Indefinite Integrals Mathematics 11: Lecture 39 Dan Sloughter Furman University November 29, 2007 Dan Sloughter (Furman University) Change of Variables: Indefinite Integrals November
More informationLimits of Computation
The real danger is not that computers will begin to think like men, but that men will begin to think like computers Limits of Computation - Sydney J. Harris What makes you believe now that I am just talking
More informationON COMPUTAMBLE NUMBERS, WITH AN APPLICATION TO THE ENTSCHENIDUGSPROBLEM. Turing 1936
ON COMPUTAMBLE NUMBERS, WITH AN APPLICATION TO THE ENTSCHENIDUGSPROBLEM Turing 1936 Where are We? Ignoramus et ignorabimus Wir mussen wissen Wir werden wissen We do not know We shall not know We must know
More informationA Universal Turing Machine
A Universal Turing Machine A limitation of Turing Machines: Turing Machines are hardwired they execute only one program Real Computers are re-programmable Solution: Universal Turing Machine Attributes:
More informationCRYPTOGRAPHY AND LARGE PRIMES *
CRYPTOGRAPHY AND LARGE PRIMES * B. Hartley University of Manchester, England, and National University of Singapore The word "cryptography" derives from Greek and means "secret writing". Since ancient times,
More informationNOI 2009 Solutions to Contest Tasks
NOI 2009 Solutions to Contest Tasks Martin Henz March 14, 2009 Martin Henz NOI 2009 Solutions to Contest Tasks 1 The Scientific Committee of NOI 2009 Ben Leong Chang Ee-Chien Colin Tan Frank Stephan Martin
More informationTuring machines Finite automaton no storage Pushdown automaton storage is a stack What if we give the automaton a more flexible storage?
Turing machines Finite automaton no storage Pushdown automaton storage is a stack What if we give the automaton a more flexible storage? What is the most powerful of automata? In this lecture we will introduce
More informationMathematical Logic. Giuseppe Peano ( ) Core Logic 2004/05-1ab p. 2/2
Mathematical Logic. From the XIXth century to the 1960s, logic was essentially mathematical. Development of first-order logic (1879-1928): Frege, Hilbert, Bernays, Ackermann. Development of the fundamental
More informationMost General computer?
Turing Machines Most General computer? DFAs are simple model of computation. Accept only the regular languages. Is there a kind of computer that can accept any language, or compute any function? Recall
More informationLecture 23: Rice Theorem and Turing machine behavior properties 21 April 2009
CS 373: Theory of Computation Sariel Har-Peled and Madhusudan Parthasarathy Lecture 23: Rice Theorem and Turing machine behavior properties 21 April 2009 This lecture covers Rice s theorem, as well as
More informationThe Turing machine model of computation
The Turing machine model of computation For most of the remainder of the course we will study the Turing machine model of computation, named after Alan Turing (1912 1954) who proposed the model in 1936.
More informationCSCI3390-Assignment 2 Solutions
CSCI3390-Assignment 2 Solutions due February 3, 2016 1 TMs for Deciding Languages Write the specification of a Turing machine recognizing one of the following three languages. Do one of these problems.
More informationhighlights proof by contradiction what about the real numbers?
CSE 311: Foundations of Computing Fall 2013 Lecture 27: Turing machines and decidability highlights Cardinality A set S is countableiffwe can writeit as S={s 1, s 2, s 3,...} indexed by N Set of rationals
More informationCalculus: Area. Mathematics 15: Lecture 22. Dan Sloughter. Furman University. November 12, 2006
Calculus: Area Mathematics 15: Lecture 22 Dan Sloughter Furman University November 12, 2006 Dan Sloughter (Furman University) Calculus: Area November 12, 2006 1 / 7 Area Note: formulas for the areas of
More informationCSCE 551: Chin-Tser Huang. University of South Carolina
CSCE 551: Theory of Computation Chin-Tser Huang huangct@cse.sc.edu University of South Carolina Church-Turing Thesis The definition of the algorithm came in the 1936 papers of Alonzo Church h and Alan
More informationCS5371 Theory of Computation. Lecture 10: Computability Theory I (Turing Machine)
CS537 Theory of Computation Lecture : Computability Theory I (Turing Machine) Objectives Introduce the Turing Machine (TM) Proposed by Alan Turing in 936 finite-state control + infinitely long tape A stronger
More informationState Machines. Example FSM: Roboant
page 1 State Machines 1) State Machine Design 2) How can we improve on FSMs? 3) Turing Machines 4) Computability Oh genie, will you now tell me what it means to compute? Doctor, I think you ve built a
More informationTuring s Treatise on Enigma. Chapter 2. Dr. Alan M. Turing
Turing s Treatise on Enigma Chapter 2 Dr. Alan M. Turing ii Dr. Alan M. Turing Editors Preface This document was written by the late Dr. Alan M. Turing while he worked as a cryptanalyst at Bletchley Park
More informationCSE 105 Theory of Computation
CSE 105 Theory of Computation http://www.jflap.org/jflaptmp/ Professor Jeanne Ferrante 1 Today s Agenda Quick Review of CFG s and PDA s Introduction to Turing Machines and their Languages Reminders and
More informationThe Limit of Humanly Knowable Mathematical Truth
The Limit of Humanly Knowable Mathematical Truth Gödel s Incompleteness Theorems, and Artificial Intelligence Santa Rosa Junior College December 12, 2015 Another title for this talk could be... An Argument
More informationCS5371 Theory of Computation. Lecture 10: Computability Theory I (Turing Machine)
CS537 Theory of Computation Lecture : Computability Theory I (Turing Machine) Objectives Introduce the Turing Machine (TM)? Proposed by Alan Turing in 936 finite-state control + infinitely long tape A
More informationWe prove that the creator is infinite Turing machine or infinite Cellular-automaton.
Do people leave in Matrix? Information, entropy, time and cellular-automata The paper proves that we leave in Matrix. We show that Matrix was built by the creator. By this we solve the question how everything
More informationFarewell (for now) to modular arithmetic...
Today. Farewell to modular arithmetic. Until the midterm. And final. Coutability and Uncountability. Undecidability. How big are the reals or the integers? Farewell (for now) to modular arithmetic... Modular
More informationFORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY
15-453 FORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY KOLMOGOROV-CHAITIN (descriptive) COMPLEXITY TUESDAY, MAR 18 CAN WE QUANTIFY HOW MUCH INFORMATION IS IN A STRING? A = 01010101010101010101010101010101
More informationHomework. Staff. Happy and fruitful New Year. Welcome to CSE105. (Happy New Year) שנה טובה. and. Meeting Times
Welcome to CSE5 and Happy and fruitful New Year שנה טובה (Happy New Year) Meeting Times Lectures: Tue Thu :p -3:p Cognitive Science Building Sections: Mon :p -:5p Pepper Canyon Hall Will Tue :p -:5p WLH
More informationCS154, Lecture 10: Rice s Theorem, Oracle Machines
CS154, Lecture 10: Rice s Theorem, Oracle Machines Moral: Analyzing Programs is Really, Really Hard But can we more easily tell when some program analysis problem is undecidable? Problem 1 Undecidable
More information1 Unrestricted Computation
1 Unrestricted Computation General Computing Machines Machines so far: DFAs, NFAs, PDAs Limitations on how much memory they can use: fixed amount of memory plus (for PDAs) a stack Limitations on what they
More informationCan You Count on Your Computer?
Can You Count on Your Computer? Professor Nick Higham School of Mathematics University of Manchester higham@ma.man.ac.uk http://www.ma.man.ac.uk/~higham/ p. 1/33 p. 2/33 Counting to Six I asked my computer
More informationDiscrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 27
CS 70 Discrete Mathematics for CS Spring 007 Luca Trevisan Lecture 7 Infinity and Countability Consider a function f that maps elements of a set A (called the domain of f ) to elements of set B (called
More informationFundamentals of Computer Science
Fundamentals of Computer Science Chapter 8: Turing machines Henrik Björklund Umeå University February 17, 2014 The power of automata Finite automata have only finite memory. They recognize the regular
More informationTuring Machines and Time Complexity
Turing Machines and Time Complexity Turing Machines Turing Machines (Infinitely long) Tape of 1 s and 0 s Turing Machines (Infinitely long) Tape of 1 s and 0 s Able to read and write the tape, and move
More informationNumber Theory in Cryptography
Number Theory in Cryptography Introduction September 20, 2006 Universidad de los Andes 1 Guessing Numbers 2 Guessing Numbers (person x) (last 6 digits of phone number of x) 3 Guessing Numbers (person x)
More informationModels. Models of Computation, Turing Machines, and the Limits of Turing Computation. Effective Calculability. Motivation for Models of Computation
Turing Computation /0/ Models of Computation, Turing Machines, and the Limits of Turing Computation Bruce MacLennan Models A model is a tool intended to address a class of questions about some domain of
More informationECS 120 Lesson 18 Decidable Problems, the Halting Problem
ECS 120 Lesson 18 Decidable Problems, the Halting Problem Oliver Kreylos Friday, May 11th, 2001 In the last lecture, we had a look at a problem that we claimed was not solvable by an algorithm the problem
More informationTuring Machines (TM) The Turing machine is the ultimate model of computation.
TURING MACHINES Turing Machines (TM) The Turing machine is the ultimate model of computation. Alan Turing (92 954), British mathematician/engineer and one of the most influential scientists of the last
More informationTuring Machines. Nicholas Geis. February 5, 2015
Turing Machines Nicholas Geis February 5, 2015 Disclaimer: This portion of the notes does not talk about Cellular Automata or Dynamical Systems, it talks about turing machines, however this will lay the
More informationThe P-vs-NP problem. Andrés E. Caicedo. September 10, 2011
The P-vs-NP problem Andrés E. Caicedo September 10, 2011 This note is based on lecture notes for the Caltech course Math 6c, prepared with A. Kechris and M. Shulman. 1 Decision problems Consider a finite
More informationBusch Complexity Lectures: Turing Machines. Prof. Busch - LSU 1
Busch Complexity ectures: Turing Machines Prof. Busch - SU 1 The anguage Hierarchy a n b n c n? ww? Context-Free anguages n b n a ww egular anguages a* a *b* Prof. Busch - SU 2 a n b anguages accepted
More informationDangerous Knowledge: Incompleteness A Deeper Look at Gödel's Theorems
Dangerous Knowledge: Incompleteness A Deeper Look at Gödel's Theorems A great many different proofs of Gödel's theorem are now known, and the result is now considered easy to prove and almost obvious no
More informationand Models of Computation
CDT314 FABE Formal anguages, Automata and Models of Computation ecture 12 Mälardalen University 2013 1 Content Chomsky s anguage Hierarchy Turing Machines Determinism Halting TM Examples Standard TM Computing
More informationCpSc 421 Homework 9 Solution
CpSc 421 Homework 9 Solution Attempt any three of the six problems below. The homework is graded on a scale of 100 points, even though you can attempt fewer or more points than that. Your recorded grade
More informationTuring Machine properties. Turing Machines. Alternate TM definitions. Alternate TM definitions. Alternate TM definitions. Alternate TM definitions
Turing Machine properties Turing Machines TM Variants and the Universal TM There are many ways to skin a cat And many ways to define a TM The book s Standard Turing Machines Tape unbounded on both sides
More informationjflap demo Regular expressions Pumping lemma Turing Machines Sections 12.4 and 12.5 in the text
On the menu today jflap demo Regular expressions Pumping lemma Turing Machines Sections 12.4 and 12.5 in the text 1 jflap Demo jflap: Useful tool for creating and testing abstract machines Finite automata,
More informationCOMPARATIVE ANALYSIS ON TURING MACHINE AND QUANTUM TURING MACHINE
Volume 3, No. 5, May 2012 Journal of Global Research in Computer Science REVIEW ARTICLE Available Online at www.jgrcs.info COMPARATIVE ANALYSIS ON TURING MACHINE AND QUANTUM TURING MACHINE Tirtharaj Dash
More informationAnnouncements. Problem Set 6 due next Monday, February 25, at 12:50PM. Midterm graded, will be returned at end of lecture.
Turing Machines Hello Hello Condensed Slide Slide Readers! Readers! This This lecture lecture is is almost almost entirely entirely animations that that show show how how each each Turing Turing machine
More informationAN INTRODUCTION TO COMPUTABILITY THEORY
AN INTRODUCTION TO COMPUTABILITY THEORY CINDY CHUNG Abstract. This paper will give an introduction to the fundamentals of computability theory. Based on Robert Soare s textbook, The Art of Turing Computability:
More informationPart I: Definitions and Properties
Turing Machines Part I: Definitions and Properties Finite State Automata Deterministic Automata (DFSA) M = {Q, Σ, δ, q 0, F} -- Σ = Symbols -- Q = States -- q 0 = Initial State -- F = Accepting States
More informationTheory of Computation Lecture Notes. Problems and Algorithms. Class Information
Theory of Computation Lecture Notes Prof. Yuh-Dauh Lyuu Dept. Computer Science & Information Engineering and Department of Finance National Taiwan University Problems and Algorithms c 2004 Prof. Yuh-Dauh
More informationThe purpose here is to classify computational problems according to their complexity. For that purpose we need first to agree on a computational
1 The purpose here is to classify computational problems according to their complexity. For that purpose we need first to agree on a computational model. We'll remind you what a Turing machine is --- you
More informationTuring Machines. Our most powerful model of a computer is the Turing Machine. This is an FA with an infinite tape for storage.
Turing Machines Our most powerful model of a computer is the Turing Machine. This is an FA with an infinite tape for storage. A Turing Machine A Turing Machine (TM) has three components: An infinite tape
More informationAn example of a decidable language that is not a CFL Implementation-level description of a TM State diagram of TM
Turing Machines Review An example of a decidable language that is not a CFL Implementation-level description of a TM State diagram of TM Varieties of TMs Multi-Tape TMs Nondeterministic TMs String Enumerators
More informationCS151 Complexity Theory. Lecture 1 April 3, 2017
CS151 Complexity Theory Lecture 1 April 3, 2017 Complexity Theory Classify problems according to the computational resources required running time storage space parallelism randomness rounds of interaction,
More informationTheory of Computation
Theory of Computation Lecture #10 Sarmad Abbasi Virtual University Sarmad Abbasi (Virtual University) Theory of Computation 1 / 43 Lecture 10: Overview Linear Bounded Automata Acceptance Problem for LBAs
More informationECS 120 Lesson 15 Turing Machines, Pt. 1
ECS 120 Lesson 15 Turing Machines, Pt. 1 Oliver Kreylos Wednesday, May 2nd, 2001 Before we can start investigating the really interesting problems in theoretical computer science, we have to introduce
More informationAn example of a decidable language that is not a CFL Implementation-level description of a TM State diagram of TM
Turing Machines Review An example of a decidable language that is not a CFL Implementation-level description of a TM State diagram of TM Varieties of TMs Multi-Tape TMs Nondeterministic TMs String Enumerators
More informationCSCC63 Worksheet Turing Machines
1 An Example CSCC63 Worksheet Turing Machines Goal. Design a turing machine, M that accepts only strings of the form {w#w w {0, 1} }. Idea. Describe in words how the machine would work. Read first symbol
More informationThere are problems that cannot be solved by computer programs (i.e. algorithms) even assuming unlimited time and space.
Undecidability There are problems that cannot be solved by computer programs (i.e. algorithms) even assuming unlimited time and space. Proved by Alan Turing in 1936 What is a computer program/algorithm?
More informationThermodynamics of computation.
Thermodynamics of computation. Dominique Chu School of Computing University of Kent, UK D.F.Chu@kent.ac.uk C 3 Symposium December 11, 2017 Outline 1 Computation and Life itself 2 Living computers 3 Energy
More informationSTOR 435 Lecture 5. Conditional Probability and Independence - I
STOR 435 Lecture 5 Conditional Probability and Independence - I Jan Hannig UNC Chapel Hill 1 / 16 Motivation Basic point Think of probability as the amount of belief we have in a particular outcome. If
More informationSequence of Topics. 1. The Nature of Truth. 2. Biography of Alan Turing ( ) 3. The Church-Turing Thesis. 4. Interactive Computing
1 Sequence of Topics 1. The Nature of Truth 2. Biography of Alan Turing (1912-1954) 3. The Church-Turing Thesis 4. Interactive Computing 5. Rationalism Versus Empiricism 6. Can Machines Think? 7. Stephen
More informationNUMBER THEORY AND CODES. Álvaro Pelayo WUSTL
NUMBER THEORY AND CODES Álvaro Pelayo WUSTL Talk Goal To develop codes of the sort can tell the world how to put messages in code (public key cryptography) only you can decode them Structure of Talk Part
More informationCSE355 SUMMER 2018 LECTURES TURING MACHINES AND (UN)DECIDABILITY
CSE355 SUMMER 2018 LECTURES TURING MACHINES AND (UN)DECIDABILITY RYAN DOUGHERTY If we want to talk about a program running on a real computer, consider the following: when a program reads an instruction,
More informationTheory of Computer Science
Theory of Computer Science D1. Turing-Computability Malte Helmert University of Basel April 18, 2016 Overview: Course contents of this course: logic How can knowledge be represented? How can reasoning
More informationTuring Machines and the Church-Turing Thesis
CSE2001, Fall 2006 1 Turing Machines and the Church-Turing Thesis Today our goal is to show that Turing Machines are powerful enough to model digital computers, and to see discuss some evidence for the
More informationComputation Histories
208 Computation Histories The computation history for a Turing machine on an input is simply the sequence of configurations that the machine goes through as it processes the input. An accepting computation
More informationHomework. Staff. Happy and fruitful New Year. Welcome to CS105. (Happy New Year) שנה טובה. Meeting Times.
Welcome to CS5 and Happy and fruitful ew Year שנה טובה (Happy ew Year) Meeting Times Lectures: Tue Thu 3:3p -4:5p WLH ote: Thu Oct 9 Lecture is canceled there may be a make-up lecture by quarter s end.
More informationHarvard CS 121 and CSCI E-121 Lecture 14: Turing Machines and the Church Turing Thesis
Harvard CS 121 and CSCI E-121 Lecture 14: Turing Machines and the Church Turing Thesis Harry Lewis October 22, 2013 Reading: Sipser, 3.2, 3.3. The Basic Turing Machine The Basic Turing Machine a a b a
More informationCSCI3390-Lecture 6: An Undecidable Problem
CSCI3390-Lecture 6: An Undecidable Problem September 21, 2018 1 Summary The language L T M recognized by the universal Turing machine is not decidable. Thus there is no algorithm that determines, yes or
More informationHilbert s problems, Gödel, and the limits of computation
Hilbert s problems, Gödel, and the limits of computation Logan Axon Gonzaga University April 6, 2011 Hilbert at the ICM At the 1900 International Congress of Mathematicians in Paris, David Hilbert gave
More informationFinite State Machines 2
Finite State Machines 2 Joseph Spring School of Computer Science 1COM0044 Foundations of Computation 1 Discussion Points In the last lecture we looked at: 1. Abstract Machines 2. Finite State Machines
More informationCOMP-330 Theory of Computation. Fall Prof. Claude Crépeau. Lec. 16 : Turing Machines
COMP-330 Theory of Computation Fall 2017 -- Prof. Claude Crépeau Lec. 16 : Turing Machines COMP 330 Fall 2017: Lectures Schedule 1-2. Introduction 1.5. Some basic mathematics 2-3. Deterministic finite
More information