Lec17E2R - March 30 Exam Topics 1. Basic Turing Machine...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
March 30 Exam Topics 1. Basic Turing Machine (3.1) 1. Know formal definition 2. Trace through computations 2. Variants of TM (3.2) 1. Multiple TM 2. Non-deterministic TM 3. Many of the models are equivalent to standard Turing Machine 3. Church-Turing Thesis (3.3) Whatever a TM can do is the maximum of what a computer can do. * Note: No questions from this section 4. Decidable Language (4.1) 1. Can build a TM that will always half correctly on accept or reject. * Examples: A DFA , A NFA , A REX , A CFG , E DFA , etc. * Note: On exam, language will be defined and we'll have to prove it is/is not decidable using high level descriptions. 2. Symmetric difference: If you have a solution to one problem and are trying to figure out another, change the input and send it to the one you know. * Note: On exam, we can build off things already proved in class/book. 5. Halting Problem (4.2) 1. Diagonalization and Countability 2. Countable: one to one from set to natural numbers * Note: On exam, use diagonalization to prove that something in uncountable. 6. Undecidable Problems (5.1)
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 09/16/2011 for the course COT 4210 taught by Professor Staff during the Spring '08 term at University of Central Florida.

Page1 / 3

Lec17E2R - March 30 Exam Topics 1. Basic Turing Machine...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online