.Open Class 01 -- Surviving the Theory of Computation .Open Syllabus . CSCI546 Introduction to Theory of Computation Deterministic and non-deterministic Turing machines, decidable and undecidable problems, complexity classes P and NP. PreReq: 431 Elective in the CSci BS. Note: this class will make more sense if you have completed CSCI500 first. . CSCI 646 Theory of Computation Theoretical foundations of computer science: models of Computation, recursive functions; Church's thesis and undecidable problems; complexity classes: P, NP, CO-NP and PSPACE. Prereq: classified. Elective in the CSci MS. Note: this class will make most sense if you have completed CSCI600 or 500 first. If you are enrolled in CS646 then to earn full credit for the work you have to select the tougher exercises marked by an exclamation mark in the book(!). .Open Why take this class Do you want to be a millionaire? .See http://www.claymath.org/millennium/ .See http://www.claymath.org/millennium/P_vs_NP/ .See http://www.claymath.org/Popular_Lectures/Minesweeper/ Do you want to tackle some of the most intriguing and powerful results in the whole CSci curriculum? Why is some encryption so hard to crack? Does it have to be that way? Why am I still waiting for the answer? Has the computer crashed? Which programs can not be solved by programming? What kind of problem is hard to solve quickly? .Close . Instructor Information I haven't taught this class for nearly a decade. I've never taught it with this text book or as a co-scheduled class (CS546 + CS646). .See ../index.html . Calendar, Schedule, Required Work The schedule may have to change.... since I've not used this book before etc... .See ./schedule.html . Support, Instructional Methods, Policies, & Grading .See ../syllabus.html .Open Readings . Required Text .Box INTRODUCTION TO AUTOMATA AND LANGUAGE THEORY John E. Hopcroft & Rajeev Motwani & Jeffrey D. Ullman .See http://www-db.stanford.edu/~ullman/ialc.html Addison Wesley 2001 ISBN 0-201-44124-1 .Close.Box (We'll cover chapters 1,2,8,9,10, and 11 of it in this course, the rest was in the previous quarter's theory course). . A relevant book The following was used in previous editions of this class. You may find it helpful but you don't need to buy it if you haven't got a copy: .Box Author: John Martin Title: Intro to Languages and Theory of Computation Edition: 3rd ISBN#: 0-07-232200-4 .See http://highered.mcgraw-hill.com/sites/0072322004/ .Close.Box . A Classic Text .Box Marvin Minsky Computation: Finite and Infinite Machines Prentice Hall 1964 =TEXT THEORY OBSOLETE READABLE TURING AUTOMATA FUNCTIONS POST Written before complexity and intractability was published. .Close.Box I will be handing out a couple of pages as reading for one class. This has just been rated the 13th most popular computer science book that is out of print by the Association for Computing Machinery. Do not buy -- unless you see a second hand copy going cheap. . Library There are very few books on computability and tractability in the CSUSB library. Possible library of congress classifications are QA9 (Foundations of mathematics) and QA76.6 G35. I have found (and borrowed) a useful reference work: Michael R Garey & David S Johnson, Computers and Intractability: A Guide to the theory of NP-Completeness, Bell Telephone Labs 1979. . Research on the World Wide Web The preparation for two classes requires you to search the web for topics and submit a relevant URL that you have discovered as assigned work/study. .Close Readings .Open Work to be done . Project Work and Programming(6%) You will work in a team to produce a simple simulator of a Turing Machine. More details in the schedule. The whole project earns 30 points: 10 points for a progress report(2%) and 20 points (4%) for the finished product and presentation. . Bonus(2%) I will ask you to program and test a single, well known function. This is a bonus of 10 points(2%). . Assigned work(26%) (Study): The schedule assigns a piece of reading to be studied to prepare for class. You must "[Submit]" a questions based on the reading using the "[Submit]" button on the web pages at least one hour before the start of each class. This is worth 2 points if on time. You get a 2point bonus for attending the first class. Notice that if you don't ask about something we probably will not spend time class time on it. So ask about things you need help with. (Ex): You should also attempt all the exercises that you have time for and bring a written answer to one of them that is not marked by an asterisk(*). An exercise is one part of a numbered exercise. You may work in a team of up to 4 people and hand in one answer with all the names on the front sheet. This is worth 5 points(1%). All members of the team will get the same score. I will pick one person from the team to present -- and they may lose all their points if they apparently don't know what their team did. When the reading in the schedule is on the web you should "[Submit]" a URL for a page at least one hour before class. This is worth 5 points max(1%). . Quizzes and Exams (50%) The will be a short test of the material in the first chapter of the book (math) in the third class -- it contributes 50 points(10%) to the total grade for the class. The final exam is comprehensive and contributes 200 points (40%) to the total grade. . Participation (20%) To earn all 5 points you must: (1) turn up and be ready to take part at the start of the class, (2) stay until the class is dismissed, (3) Answer questions, (4) ask questions, and (5) take part in class discussions and exercises. .Close Work to be done . Grading All points earned before the final will be totaled with the maximum possible score being set to 300 points. The maximum on the final is 200 points. These two totals will be added together to calculate the grade for the course according to the rules .See ../syllabus.html in my generic syllabus. .Close Syllabus . Beta Schedule .Table Date .Item Meet'g .Item $Study(2 pts) .Item Bring(5 pts) .Item $Topic(5 pts) .Item Notes .Row Mon Apr 3 .Item 1 .Item - .Item - .Item Survival .Row Wed Apr 5 .Item 2 .Item Chapter 1+O(.)+graph .Item $Ex .Item Methods .Row Mon Apr 10 .Item 3 .Item Preface+$Web1 .Item $URL .Item History .Item Exam on $math(50 pts) .Row Wed Apr 12 .Item 4 .Item Chapter 2+Chapter 6 section 6.1 .Item $Ex .Item Automata .Row Mon Apr 17 .Item 5 .Item Chapter 8 sections 8.1, 8.2 .Item $Ex .Item Turing Machines .Row Wed Apr 19 .Item 6 .Item Chapter 8 sections 8.2, 8.4 .Item $Ex .Item Programming $TM .Row Fri Apr 21 .Item - .Item - .Item - .Item Last day to drop .Row Mon Apr 24 .Item 7 .Item Chapter 8 sections 8.5, 8.6 .Item $Ex .Item Restricted $TM .Row Wed Apr 26 .Item 8 .Item Chapter 8 section 8.7+$Minsky .Item $Ex .Item The Halting Problem .Item Start $Project .Row Mon May 1 .Item 9 .Item $Web2 .Item $URL .Item Recursive Functions .Item $Acker(10 pts Bonus) .Row Wed May 3 .Item 10 .Item Chapter 9 sections 9.1, 9.2 .Item $Ex .Item Undecidability & RE .Item $Project1 (10 pts) .Row Mon May 8 .Item 11 .Item $Project2 (20 pts) .Item - .Item Turing Machines .Row Wed May 10 .Item 12 .Item Chapter 9 section 9.3 .Item $Ex .Item Undecidability & $TM .Row Mon May 15 .Item 13 .Item Chapter 9 sections 9.4, 9.5.1, 9.6 .Item $Ex .Item Post Correspondence+ Programs .Row Wed May 17 .Item 14 .Item Chapter 10 sections 10.1 .Item $Ex .Item Intractable Problems P & NP .Row Mon May 22 .Item 15 .Item Chapter 10 sections 10.2, 10.3 .Item $Ex .Item NP-Complete .Row Wed May 24 .Item 16 .Item Chapter 10 sections 10.4, 10.5 .Item $Ex .Item Graph Problems & TSP .Row Mon May 29 .Item - .Item - .Item - .Item HOLIDAY .Row Wed May 31 .Item 17 .Item Chapter 11 sections 11.1, 11.2, 11.3 .Item $Ex .Item Co-NP & PSPACE .Row Mon Jun 5 .Item 18 .Item Chapter 11 sections 11.4 .Item $Ex .Item Randomization RP ZPP .Row Wed Jun 7 .Item 19 .Item Chapter 11 sections 11.5, 11.6 .Item $Ex .Item Primality .Row Mon Jun 12 .Item 20 .Item Chapters 8, 9, 10, 11 .Item $Ex .Item Review .Row Fri Jun 16 .Item Final .Item Chapters 1, 2, 8, 9, 10, 11 .Item - .Item Comprehensive (200 pts) .Row Tue Jun 20 .Item - .Item - .Item - .Item Grades Due in .Close.Table (Web1): Search the WWW for pages on the theory of computability, Alan Turing, Turing Machines, tractability, Stephen Cook, Michael Rabin, etc. Submit one $URL. (math): Chapter 1 + notes on the `big-O` notation .See http://www.nist.gov/dads/HTML/bigOnotation.html .See http://en.wikipedia.org/wiki/Big_O_notation .See ./time1.cpp (Down load and run some tests on UNIX system) + notes on directed graphs. .See http://en.wikipedia.org/wiki/Graph_theory .See http://www.math.fau.edu/locke/GRAPHTHE.HTM (Acker): Study the Ackermann function on page 381 -- Exercise 9.2.2. Write the simplest possible program that could possibly compute this function for small x & y. Use recursion and long ints(at least). Demo results to class. Earn a bonus of 10 points. Note: your program does not have to run fast (halt within 10 minutes) on large numbers (y>2). (Web2): Search the web for pages on recursive functions, partial recursive functions, primitive recursive functions, recursively enumerable, recursive languages, and recursion in general. Submit one $URL. (Minsky): Study my two page handout from Minsky's 1964 "??" (Project): Working in a team of 3 or 4 people design, code, and test a simple Turing Machine simulator. .Set Notes You may use any language that can be demonstrated in class. You may choose any kind of user interface you like. Your $TM simulator does not have to have infinite memory capacity like a real $TM. Do the simplest thing that can possibly work. Consult with me in my office hours. .Close.Set Process .List Start by thinking about the design and developing tests for your code... (Project1): First deadline: bring a progress report to class and present it. Grading: pass/fail. Any running set of tests will pass. (Project2): Second deadline: bring a report on the final status, present it, and hand in a hard copy for grading. .Close.List (URL): Submit one Universal Resorce Locator for a relevant page on a piece of paper. Use the submit button at the top of the web page. To earn complete credit you need to do this at least 90 minutes before the start of class. (Ex): Do as many of the relevant exercises as you have time for. You may work in a team of upto 4 students and hand in one joint solution. Bring to class one written solution to an exercise. This must not be a solution to an exercise marked with an asterisk(*) to earn full credit. One of the authors will be invited to present the solution to the class -- failure will loose points. Students taking CS646 must hand in the solution to an exercise marked with an exclamation mark(!) to earn full credit. (Study): Read & think about the assigned items. Submit one question by selecting the submit button at the top of the web page. To earn complete credit you need to do this at least 90 minutes before the start of class. Hints. Read each section twice -- once the easy bits and then the tough bits. Use a scratch pad and pencil as you read. (Topic): To earn all the possible points you must: turn up on time, not leave early, present work when called upon, and take part in discussions. .Close Class 01 -- Surviving the Theory of Computation