Computability Go over homework problems. Godel numbering. Homework: prepare for midterm.

Slides:



Advertisements
Similar presentations
Restricted Machines Presented by Muhannad Harrim.
Advertisements

Multi-tape Turing Machines: Informal Description
1 Turing Machines and Equivalent Models Section 13.2 The Church-Turing Thesis.
CS 345: Chapter 9 Algorithmic Universality and Its Robustness
Variants of Turing machines
Primitive Recursive Functions (Chapter 3)
THE CHURCH-TURING T H E S I S “ TURING MACHINES” Pages COMPUTABILITY THEORY.
The Recursion Theorem Sipser – pages Self replication Living things are machines Living things can self-reproduce Machines cannot self reproduce.
October 13, 2009Theory of Computation Lecture 11: A Universal Program III 1 Coding Programs by Numbers Gödel numbers are usually very large, even for small.
Week 7 - Wednesday.  What did we talk about last time?  Set proofs and disproofs  Russell’s paradox.
INHERENT LIMITATIONS OF COMPUTER PROGRAMS CSci 4011.
Complexity 11-1 Complexity Andrei Bulatov Space Complexity.
1 Introduction to Computability Theory Lecture11: Variants of Turing Machines Prof. Amos Israeli.
Mu-Recursive Functions
Programming the TM qa  (,q) (,q) q1q1 0q1q1 R q1q1 1q1q1 R q1q1  h  Qa  (,q) (,q) q1q1 0q2q2  q1q1 1q3q3  q1q1  h  q2q2 0q4q4 R q2q2 1q4q4.
October 27, 2009Theory of Computation Lecture 12: A Universal Program IV 1Universality Then we append the following instruction: [C]IF K = Lt(Z) + 1 
Homework #9 Solutions.
Computability and Complexity 10-1 Computability and Complexity Andrei Bulatov Gödel’s Incompleteness Theorem.
September 17, 2009Theory of Computation Lecture 4: Programs and Computable Functions III 1 Macros Now we want to use macros of the form: W  f(V 1, …,
1 Introduction to Computability Theory Lecture11: The Halting Problem Prof. Amos Israeli.
Final Exam Review Cummulative Chapters 0, 1, 2, 3, 4, 5 and 7.
Chapter 4: A Universal Program 1. Coding programs Example : For our programs P we have variables that are arranged in a certain order: Y 1 X 1 Z 1 X 2.
Lecture 18 Various TMs. Allow the head not move Theorem. If the head is allowed to stay at the cell in each move, then every function computed by the.
1 1 CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 14 School of Innovation, Design and Engineering Mälardalen University 2012.
1 111 Computability Computability Administration Brief introduction to course Homework: Obtain book. Sign on to Moodle: introduce.
CSCI 4325 / 6339 Theory of Computation Zhixiang Chen Department of Computer Science University of Texas-Pan American.
111 Computability, etc. Recap. Present homework. Grammar and machine equivalences. Turing history Homework: Equivalence assignments. Presentation proposals,
Computability Turing machines for functions. Recursive functions. Homework: Modify class example for addition to produce contiguous 1s. Construct TM for.
DECIDABILITY OF PRESBURGER ARITHMETIC USING FINITE AUTOMATA Presented by : Shubha Jain Reference : Paper by Alexandre Boudet and Hubert Comon.
111 Discrete Mathematics Computability Brief introduction to computable functions, recursive functions, etc. Jeanine Meyer.
The Recursion Theorem Pages 217– ADVANCED TOPICS IN C O M P U T A B I L I T Y THEORY.
1 111 Computability, etc. Midterm review. Turing machines. Finite state machines. Push down automata. Homework: FSA, PDA, TM problems (can work in teams)
Introduction to CS Theory Lecture 15 –Turing Machines Piotr Faliszewski
1 The Halting Problem and Decidability How powerful is a TM? Any program in a high level language can be simulated by a TM. Any algorithmic procedure carried.
1 Turing Machines Reading: Chapter 8. 2 Turing Machines are… Very powerful (abstract) machines that could simulate any modern day computer (although very,
Chapter 10 Computable Functions Copyright © 2011 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1.
Computation Motivating questions: What does “computation” mean? What are the similarities and differences between computation in computers and in natural.
CS 3813: Introduction to Formal Languages and Automata Chapter 13 Other Models of Computation These class notes are based on material from our textbook,
Theory of Computation Lecture 5: Primitive Recursive Functions I
::ICS 804:: Theory of Computation - Ibrahim Otieno SCI/ICT Building Rm. G15.
Lecture 3: Count Programs, While Programs and Recursively Defined Functions 虞台文 大同大學資工所 智慧型多媒體研究室.
Lecture 17 Undecidability Topics:  TM variations  Undecidability June 25, 2015 CSCE 355 Foundations of Computation.
Overview of the theory of computation Episode 3 0 Turing machines The traditional concepts of computability, decidability and recursive enumerability.
Donghyun (David) Kim Department of Mathematics and Computer Science North Carolina Central University 1 Chapter 4 Decidability Some slides are in courtesy.
1 Turing Machines - Chap 8 Turing Machines Recursive and Recursively Enumerable Languages.
Lecture 16b Turing Machines Topics: Closure Properties of Context Free Languages Cocke-Younger-Kasimi Parsing Algorithm June 23, 2015 CSCE 355 Foundations.
Automata & Formal Languages, Feodor F. Dragan, Kent State University 1 CHAPTER 3 The Church-Turing Thesis Contents Turing Machines definitions, examples,
1 Introduction to Turing Machines
1 CD5560 FABER Formal Languages, Automata and Models of Computation Lecture 12 Mälardalen University 2007.
6/12/2016 Prepared by Dr.Saad Alabbad1 CS100 : Discrete Structures Proof Techniques(2) Mathematical Induction & Recursion Dr.Saad Alabbad Department of.
CS 154 Formal Languages and Computability May 5 Class Meeting Department of Computer Science San Jose State University Spring 2016 Instructor: Ron Mak.
Turing Machines CS 130 Theory of Computation HMU Textbook: Chap 8.
The Church-Turing Thesis Chapter Are We Done? FSM  PDA  Turing machine Is this the end of the line? There are still problems we cannot solve:
MA/CSSE 474 Theory of Computation Universal Turing Machine Church-Turing Thesis (Winter 2016, these slides were also used for Day 33)
Universal Turing Machine
MA/CSSE 474 Theory of Computation Decision Problems, Continued DFSMs.
MA/CSSE 474 Theory of Computation Universal Turing Machine Church-Turing Thesis Delayed due dates for HWs See updated schedule page. No class meeting.
Modeling Arithmetic, Computation, and Languages Mathematical Structures for Computer Science Chapter 8 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesTuring.
Cpt S 317: Spring 2009 Reading: Chapter 8
Theory of Computation Lecture 10: A Universal Program I
Cellular Automata Universalities.
Theory of Computation Lecture 14: A Universal Program V
Cpt S 317: Spring 2009 Reading: Chapter 8
Turing Machines Acceptors; Enumerators
Theory Of Computer Science
Decidable Languages A language L is decidable if there is a Turing machine ML such that given any word w  0*, then: Input of ML: a  b  … w Output of.
Programming Languages
Theory of Computation Lecture 6: Primitive Recursive Functions I
Theory of Computation Lecture 13: A Universal Program V
Turing Machines Everything is an Integer
Presentation transcript:

Computability Go over homework problems. Godel numbering. Homework: prepare for midterm.

TM for Neat addition Create function TM that adds two numbers and returns as answer all 1s starting from the left end of the tape, no blanks. ????

TM for multiplication Tape starts with two sets of 1s, recall n+1 1 for number n. Follow example for addition. Consider using markers on tape. ????

TM to tidy up… Claim: we can create quintuples to add to any TM to re-format and modify outputs to facilitate composition –output for N is N 1s anywhere on tape. Change to (N+1) 1s. –insert or remove marker symbols separating numbers to be proper inputs.

Reprise: Recursive functions The recursive functions are a set of functions defined using a starter set and allowing any functions that can be defined using a finite number of applications of composition, primitive recursion, and minimalization

Starter set Identity F(x) = x This is special case of Projections U i n (x 1, x 2,…,x n ) = x i Successor S(x) = x+1 Constant F c (x) = c

Composition Given F and G, FG (x) = F(G(x))

Primitive recursion Motivation similar to mathematical induction, definition of factorial, exponentiation. –Have definition for the zero case. Have way for building. x 0 = 1 x (n+1) = x n * x

Primitive recursion Given functions f: N → N and g: (N,N,N) →N, then define h: (N,N) as follows h(x,0) = f(x) h(x,y+1) = g(x,y,h(x,y)) You will see variations. For example, f: N n and g: N n+2

Minimalization Better name MAY be inverse. If f(x) is recursive, then define g to be g(y) = min {x | f(x) = y} if any x exists. Otherwise, g(y) is undefined.

Multiplication … is recursive. Can be defined by use of composition, primitive recursion, minimalization of other recursive functions. Can assume addition! ????

Subtraction …is recursive. Can be defined by use of composition, primitive recursion, minimalization of other recursive functions. Can assume addition! Hint: use minimalization ????

Equivalence of TMs and Recursive functions If a function is recursive, then we can construct a TM for it. –Build TM for starter sets. Assume fix-up function to get things in proper format for next step. –Describe process for doing composition, primitive recursion, and minimalization. Minimalization: given function f for which there is a TM, call it F, then build a TM that calls F in turn for 0, 1, 2, ….

TM to Recursive Need to come up with encoding for TM that can be decoded to 'do' the steps as a function. –Gödel Numbering ! Prove set of steps that are recursive that lead to the existence of a computation using the steps of TM

Arithmetization of [theory of] Turing machines Symbols of TM are: –symbols available to be on tape: B=S0, S1,… –R and L –states: q 1,q 2 … Assign odd numbers starting with 3 to R,L,S0,q 1,S1,q 2,S2,… So quadruples q 1 1Rq 2 is represented by 9,11,3,13. The instantaneous description: q is represented by 9,11,11,11

Arithmetization, cont. Gödel Number of expression represented by sequence of n numbers a1,a2,..,an is the product of the first n primes, each raised to the corresponding ak power! gn(q 1 1Rq 2 ) = 2 9 * 3 11 * 5 3 * 7 13 gn(sequence of n expressions) = product of the first n primes each raised to the gn of each expression Note: gn's are either an expression or a sequence of expressions. gn's are huge! gn's are unique—can get back to expression or sequence.

Arithmetization, cont. Take any Turing Machine. (Using quadruples in place of quintuples. The operation of writing is distinct from moving left or right). TM defines by its set of quadruples. Define a gn for a TM is the gn for a sequence of its quadruples. So different orders will produce different gn.

Computation A computation is a sequence s 1,…s k of expressions representing steps of a TM operating on input – starting with q1 followed by input – sequence, s i  s i+1, according to TM – s k is terminal (final, no next step)

Description of proof With a gn for TM T, show by a set of steps involving what are valid computations starting from expression representing initial state in front of input, that a recursive function exists that has same behavior as T on the input.

Predicate A predicate is a function of 1 or more parameters that returns true or false. Proof shows that a certain predicate is primitive recursive (that is, in the set starting with the starting functions and with any functions added using primitive recursion and composition)

Predicate T(z,x1, x2, … xn,y) is true if z is the gn for a TM x1, x2,.. xn are the inputs y is a computation of the TM encoded by z T(x,x1,x2, …, xn, y) is false, otherwise, including z or y not being gn for any TM or any computation.

Claim By many steps, can show T to be primitive recursive Example, Yield(x,y,z) is defined as the predicate, such that if x and y are gn for instantaneous expressions and z is gn for a TM and x  y for TM z, then true, Otherwise, false

Define function in 2 steps Then V z (x1,…xn) defined as min y | T (z,x1, … xn, y) is recursive. Note: at most one such y.

Last step U(y), defined as: if y is a computation, number of 1s in last expression of y. Undefined, otherwise. This can be shown to be primitive recursive. Then U(min y | T (z,x1, … xn, y) ) is recursive

Comments The predicate T is very powerful. It is false most of the time. It does the job for ALL TMs. For any particular function computed by a particular TM, there would be a more efficient recursive function. The steps are based on the mechanistic feature of TMs. There are other formulations equivalent to these two (TMs and recursive functions).

More Topics Implementation of TM (language recognizer or function) in code –there exists on-line examples Gödel work on incompleteness of logical systems Other equivalent formulations for computability computable numbers Work on randomness and computability –Greg Chaitin, others. others cited previously

Homework Review midterm guide. Study charts. Come with questions based on your review.